NumberTheoryBasic ProofByContradiction Intermediate

Problem - 2817
A prime number is called an absolute prime if every permutation of its digits in base 10 is also a prime number. For example: 2, 3, 5, 7, 11, 13 (31), 17 (71), 37 (73) 79 (97), 113 (131, 311), 199 (919, 991) and 337 (373, 733) are absolute primes. Prove that no absolute prime contains all of the digits 1, 3, 7 and 9 in base 10.

The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error