scramble prime challenge
|
02-14-2020, 01:14 AM
Post: #1
|
|||
|
|||
scramble prime challenge
Let's say a number is a "scramble prime" if you can scramble its digits and always come up with a prime number. For example, 37 is a scramble prime because both 37 and 73 are primes. 317 is not a scramble prime because 371 is composite. 971 is not a scramble prime because 917 is composite.
So the challenge is to devise a HP calculator program such that you enter a number and the program tells you whether it is a scramble prime or not. Now, if the number contains certain digits, it will be impossible for it to be a scramble prime. |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 1 Guest(s)