In the following sequence, how many primes exist? 1 0 0 0 1 , 1 0 0 0 1 0 0 0 1 , 1 0 0 0 1 0 0 0 1 0 0 0 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.
Thank you for sharing a nice solution.
We're looking at the number 1 0 4 n − 4 + 1 0 4 n − 8 + ⋯ + 1 0 4 + 1 = 1 0 4 − 1 1 0 4 n − 1 for n ≥ 2 .
If n is even, then 1 0 4 n − 1 is divisible by 1 0 8 − 1 , so 1 0 4 − 1 1 0 4 n − 1 is divisible by 1 0 4 + 1 . There are two cases: when n = 2 our number is 1 0 4 + 1 = 7 3 ⋅ 1 3 7 , and when n ≥ 4 is even 1 0 4 + 1 is a nontrivial proper factor.
If n is odd, then I claim that 9 1 0 n − 1 is a factor; or, equivalently, ( 1 0 4 − 1 ) ( 1 0 n − 1 ) ( 1 0 4 n − 1 ) ( 1 0 − 1 ) is an integer. But this is a consequence of the fact that ( x 4 − 1 ) ( x n − 1 ) ( x 4 n − 1 ) ( x − 1 ) is a polynomial with integer coefficients; this is easy to see because gcd ( x 4 − 1 , x n − 1 ) = x − 1 , so x − 1 x 4 − 1 and x − 1 x n − 1 are relatively prime polynomials which both divide x − 1 x 4 n − 1 , so their product divides it.
So, to sum up, when n = 2 , the number factors by inspection. When n ≥ 4 is even, 1 0 4 + 1 is a nontrivial proper factor. When n ≥ 3 is odd, 9 1 0 n − 1 is a nontrivial proper factor.
Thank you for sharing a nice solution.
Silly me. I saw the long string of zero and ones and assumed we were talking binary numbers, not decimal. This lead me down an interesting trail. In decimal this sequence is https://oeis.org/A023001. I searched this sequence for primes up to 10^3500 and found only one: 73.
Fletcher's Conjecture: 73 is the only prime in the binary sequence 10001, 100010001, 1000100010001 .. I think 1 should also be accepted as an answer. :)
The binary sequence starts 1 7 , 2 7 3 , … . You might be overlooking a zero. I believe the argument I used for base 1 0 shows that 1 7 is the only prime in that sequence.
Log in to reply
How embarrassing! I did miss a zero. That sinks Fletcher's conjecture and my chance for fame. :). Good sleuthing, Patrick.
Problem Loading...
Note Loading...
Set Loading...
1 0 0 0 1 , 1 0 0 0 1 0 0 0 1 , 1 0 0 0 1 0 0 0 1 0 0 0 1 , . . .
= 9 9 9 9 9 9 9 9 9 9 9 9 , 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 , 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 , . . .
= 1 0 4 − 1 1 0 8 − 1 , 1 0 4 − 1 1 0 1 2 − 1 , 1 0 4 − 1 1 0 1 6 − 1 , . . .
= 1 0 4 − 1 1 0 4 n − 1 for n ≥ 2
= 1 0 4 − 1 ( 1 0 n − 1 ) ( 1 0 n + 1 ) ( 1 0 2 n + 1 ) for n ≥ 2
By inspection, n = 2 and n = 3 are not prime because 1 0 0 0 1 = 7 3 ⋅ 1 3 7 and 1 0 0 0 1 0 0 0 1 = 3 ⋅ 3 3 3 3 6 6 6 7 .
For n ≥ 4 , there will be at least two factors of the numerator (namely ( 1 0 n + 1 ) and ( 1 0 2 n + 1 ) ) that will be larger than the denominator 1 0 4 − 1 which will result in a number with at least two factors greater than 1 ; in other words, a number that will never be prime, either.
There are therefore 0 prime numbers in the given sequence.