It's like binary but not really

What is the largest prime composed of alternating zeroes and ones? As an example, n = 101010101 n=101010101 is a number composed of alternating zeroes an ones.


The answer is 101.

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.

1 solution

Kenny Lau
Jul 20, 2015

Why it must start and end with "1" is left as an exercise for the reader.

Since it starts and ends with "1", we can write the number as i = 0 k 10 0 i \displaystyle\sum_{i=0}^k100^i .

If k is positive and even, then we have: i = 0 k 10 0 i = 1 0 0 + 1 0 2 + + 1 0 2 k [ 1 0 0 + 1 0 1 + + 1 0 k ] [ ( 10 ) 0 + ( 10 ) 1 + + ( 10 ) k ] \displaystyle\sum_{i=0}^k100^i=10^0+10^2+\cdots+10^{2k}\equiv[10^0+10^1+\cdots+10^k][(-10)^0+(-10)^1+\cdots+(-10)^k] (This result can be proven by induction.)

If k is an odd number greater than 1, then we have: i = 0 k 10 0 i = 1 0 0 + 1 0 2 + + 1 0 2 k [ 1 0 0 + 1 0 2 ] [ 1 0 0 + 1 0 4 + + 1 0 2 k 2 ] \displaystyle\sum_{i=0}^k100^i=10^0+10^2+\cdots+10^{2k}\equiv[10^0+10^2][10^0+10^4+\cdots+10^{2k-2}] (This result can be proven by induction.)

For example, when k = 3 k=3 (which corresponds to 1010101 1010101 ): 1010101 = 1 0 0 + 1 0 2 + 1 0 4 + 1 0 6 = ( 1 0 0 + 1 0 2 ) ( 1 0 0 + 1 0 4 ) = 101 × 10001 1010101=10^0+10^2+10^4+10^6=(10^0+10^2)(10^0+10^4)=101\times10001

For example, when k = 4 k=4 (which corresponds to 101010101 101010101 ): 101010101 = 1 0 0 + 1 0 2 + 1 0 4 + 1 0 6 + 1 0 8 = ( 1 0 0 + 1 0 1 + 1 0 2 + 1 0 3 + 1 0 4 ) ( 1 0 0 1 0 1 + 1 0 2 1 0 3 + 1 0 4 ) = 11111 × 9091 101010101=10^0+10^2+10^4+10^6+10^8=(10^0+10^1+10^2+10^3+10^4)(10^0-10^1+10^2-10^3+10^4)=11111\times9091

Therefore the only solution is k = 1 k=1 which corresponds to 101 \mbox{101} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...