How many prime numbers are in the following (infinite) sequence?
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.
Notice that
1 0 1 0 1 . . . 1 0 1 0 1 = 1 + 1 0 2 + 1 0 4 + . . . + 1 0 2 n
= 1 0 0 + 1 0 2 + 1 0 4 + . . . + 1 0 2 n
= 9 9 1 ( 1 0 2 n + 2 − 1 )
Since ( 2 n + 2 ) = 2 ( n + 1 ) , by the difference of two squares this gives
1 0 1 0 1 . . . 1 0 1 0 1 = 9 9 1 ( 1 0 n + 1 − 1 ) ( 1 0 n + 1 + 1 )
When n = 1 :
( 1 0 n + 1 − 1 ) = 9 9
( 1 0 n + 1 + 1 ) = 1 0 1
When n = 2 :
( 1 0 n + 1 − 1 ) = 9 9 9
( 1 0 n + 1 + 1 ) = 1 0 0 1
When n = 3 :
( 1 0 n + 1 − 1 ) = 9 9 9 9
( 1 0 n + 1 + 1 ) = 1 0 0 0 1
For n > 1 , the two factors ( 1 0 n + 1 − 1 ) ( 1 0 n + 1 + 1 ) are both greater than 9 9 , hence when ( 1 0 n + 1 − 1 ) is divided by factors of 9 9 , the two remain as non-trivial factors (i.e. factors that are not 1 or the number itself) of the original number. Thus we can conclude that the number is not prime, except when n = 1 .
When n = 1 , the number is 1 0 1 and that is a prime number.
Other prime number problems:
I love prime numbers! 1
I love prime numbers! 3