Alternating Even-Odd Digit Palindromic Prime
Jump to navigation
Jump to search
This theorem requires a proof.
By brute force, one supposes.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
Theorem
Let the notation $\left({abc}\right)_n$ be interpreted to mean $n$ consecutive repetitions of a string of digits $abc$ concatenated in the decimal representation of an integer.
The integer:
- $\left({10987654321234567890}\right)_{42} 1$
has the following properties:
- it is a palindromic prime with $841$ digits
- its digits are alternately odd and even.
Proof
By brute force, one supposes.
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
When this page/section has been completed, {{ProofWanted}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
Sources
- 1994: Harvey Dubner: Palindromic Primes with a Palindromic Prime Number of Digits (J. Recr. Math. Vol. 26, no. 4: p. 256)
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $\left({10987654321234567890}\right)_{42} 1$
