What is only the prime among the positive integers, written as usual in base 1 0 , are such that their digits are alternating 1 ’s and 0 's, beginning and ending with 1 ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Define the n t h term of the sequence to be a n , so that a 1 = 1 , a 2 = 1 0 1 , a 3 = 1 0 1 0 1 , etc, and the decimal expansion of a n contains n 1 s. We want to show that a 2 = 1 0 1 is the only prime in the sequence. The simplest thing to do is to try factorising, and look for patterns.
One idea is to note that when n is a multiple of 3 , by the usual divisibility test, so is a n . Similarly, if n is a mulitple of 1 1 , so is a n . But this approach doesn't get too far - there are still lots of gaps.
Playing around with the factorisations, we can find two patterns. For even n :
a 2 = 1 0 1 = 1 0 1 × 1
a 4 = 1 0 1 0 1 0 1 = 1 0 1 × 1 0 0 0 1
a 6 = 1 0 1 0 1 0 1 0 1 = 1 0 1 × 1 0 0 0 1 0 0 0 1
and it's easy to see that this pattern continues.
For odd n :
a 1 = 1 = 1 × 1
a 3 = 1 0 1 0 1 = 9 1 × 1 1 1
a 5 = 1 0 1 0 1 0 1 0 1 = 9 0 9 1 × 1 1 1 1 1
a 7 = 1 0 1 0 1 0 1 0 1 0 1 0 1 = 9 0 9 0 9 1 × 1 1 1 1 1 1 1
This pattern is slightly less obvious, but still fairly easy to prove.
If we define r 1 = 1 , r 2 = 1 1 , r 3 = 1 1 1 , etc, we conjecture from the pattern that r n divides a n whenever n is odd.
Note that each of the a n and r n can be thought of as sums of geometric progressions. This gives the formulas a n = 9 9 1 ( 1 0 0 n − 1 ) and r n = 9 1 ( 1 0 n − 1 ) .
So we want to show that r n a n is an integer for odd n .
We have r n a n = 1 1 ( 1 0 n − 1 ) 1 0 0 n − 1 = 1 1 ( 1 0 n − 1 ) 1 0 2 n − 1 = 1 1 ( 1 0 n − 1 ) ( 1 0 n − 1 ) ( 1 0 n + 1 ) = 1 1 1 0 n + 1
and since n is odd, we can see this last form is indeed an integer (using the fact that x + 1 divides x n + 1 when n is odd).
So we've proved that the only prime in the sequence is 1 0 1 .
Problem Loading...
Note Loading...
Set Loading...
Confirmed that 1 0 1 is the only one, using M a t h e m a t i c a , up to 1 0 1 0 . . . 1 0 1 => 3 0 0 0 d i g i t s
here is the program if you want to search further
Monitor[For[n=1,n<10000,n++,If[PrimeQ@FromDigits@Join[{1},Flatten@Table[{0,1},n]],Print@n]],n]