How Many Primes Exist Here?

In the following sequence, how many primes exist? 10001 , 100010001 , 1000100010001 , 10001, 100010001, 1000100010001, \dots

0 4 2 1 3

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.

2 solutions

David Vreken
Dec 31, 2019

10001 , 100010001 , 1000100010001 , . . . 10001, 100010001, 1000100010001, ...

= 99999999 9999 , 999999999999 9999 , 9999999999999999 9999 , . . . = \frac{99999999}{9999}, \frac{999999999999}{9999}, \frac{9999999999999999}{9999}, ...

= 1 0 8 1 1 0 4 1 , 1 0 12 1 1 0 4 1 , 1 0 16 1 1 0 4 1 , . . . = \frac{10^{8} - 1}{10^4 - 1}, \frac{10^{12} - 1}{10^4 - 1}, \frac{10^{16} - 1}{10^4 - 1}, ...

= 1 0 4 n 1 1 0 4 1 = \frac{10^{4n} - 1}{10^4 - 1} for n 2 n \geq 2

= ( 1 0 n 1 ) ( 1 0 n + 1 ) ( 1 0 2 n + 1 ) 1 0 4 1 = \frac{(10^{n} - 1)(10^{n} + 1)(10^{2n} + 1)}{10^4 - 1} for n 2 n \geq 2

By inspection, n = 2 n = 2 and n = 3 n = 3 are not prime because 10001 = 73 137 10001 = 73 \cdot 137 and 100010001 = 3 33336667 100010001 = 3 \cdot 33336667 .

For n 4 n \geq 4 , there will be at least two factors of the numerator (namely ( 1 0 n + 1 ) (10^{n} + 1) and ( 1 0 2 n + 1 ) (10^{2n} + 1) ) that will be larger than the denominator 1 0 4 1 10^4 - 1 which will result in a number with at least two factors greater than 1 1 ; in other words, a number that will never be prime, either.

There are therefore 0 \boxed{0} prime numbers in the given sequence.

Thank you for sharing a nice solution.

Hana Wehbi - 1 year, 5 months ago
Patrick Corn
Jan 7, 2020

We're looking at the number 1 0 4 n 4 + 1 0 4 n 8 + + 1 0 4 + 1 = 1 0 4 n 1 1 0 4 1 10^{4n-4} + 10^{4n-8} + \cdots + 10^4 + 1 = \frac{10^{4n}-1}{10^4-1} for n 2. n \ge 2.

If n n is even, then 1 0 4 n 1 10^{4n} -1 is divisible by 1 0 8 1 , 10^8-1, so 1 0 4 n 1 1 0 4 1 \frac{10^{4n}-1}{10^4-1} is divisible by 1 0 4 + 1. 10^4+1. There are two cases: when n = 2 n=2 our number is 1 0 4 + 1 = 73 137 , 10^4+1 = 73 \cdot 137, and when n 4 n \ge 4 is even 1 0 4 + 1 10^4+1 is a nontrivial proper factor.

If n n is odd, then I claim that 1 0 n 1 9 \frac{10^n-1}9 is a factor; or, equivalently, ( 1 0 4 n 1 ) ( 10 1 ) ( 1 0 4 1 ) ( 1 0 n 1 ) \frac{(10^{4n}-1)(10-1)}{(10^4-1)(10^n-1)} is an integer. But this is a consequence of the fact that ( x 4 n 1 ) ( x 1 ) ( x 4 1 ) ( x n 1 ) \frac{(x^{4n}-1)(x-1)}{(x^4-1)(x^n-1)} is a polynomial with integer coefficients; this is easy to see because gcd ( x 4 1 , x n 1 ) = x 1 , \text{gcd}(x^4-1,x^n-1) = x-1, so x 4 1 x 1 \frac{x^4-1}{x-1} and x n 1 x 1 \frac{x^n-1}{x-1} are relatively prime polynomials which both divide x 4 n 1 x 1 , \frac{x^{4n}-1}{x-1}, so their product divides it.

So, to sum up, when n = 2 , n = 2, the number factors by inspection. When n 4 n \ge 4 is even, 1 0 4 + 1 10^4+1 is a nontrivial proper factor. When n 3 n \ge 3 is odd, 1 0 n 1 9 \frac{10^n-1}9 is a nontrivial proper factor.

Thank you for sharing a nice solution.

Hana Wehbi - 1 year, 5 months ago

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. :)

Fletcher Mattox - 1 year, 1 month ago

Log in to reply

No worries.

Hana Wehbi - 1 year, 1 month ago

The binary sequence starts 17 , 273 , . 17,273,\ldots. You might be overlooking a zero. I believe the argument I used for base 10 10 shows that 17 17 is the only prime in that sequence.

Patrick Corn - 1 year, 1 month ago

Log in to reply

How embarrassing! I did miss a zero. That sinks Fletcher's conjecture and my chance for fame. :). Good sleuthing, Patrick.

Fletcher Mattox - 1 year, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...