Let and be integers such that and .
How many integers exist such that will never form a prime?
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 x n − 1 = ( x − 1 ) ( x n − 1 + x n − 2 + . . . . . . + x + 1 )
For example, 7 4 n − 1 = ( 7 4 − 1 ) ( 7 4 n − 1 + 7 4 n − 2 + . . . . . . + 7 4 + 1 ) = ( 7 3 ) ( 7 4 n − 1 + 7 4 n − 2 + . . . . . . + 7 4 + 1 )
Since 7 3 is a prime number, 7 4 n − 1 can produce a prime if we set n = 1 .
For example, 7 5 n − 1 = ( 7 5 − 1 ) ( 7 5 n − 1 + 7 5 n − 2 + . . . . . . + 7 5 + 1 ) = ( 7 4 ) ( 7 5 n − 1 + 7 5 n − 2 + . . . . . . + 7 5 + 1 )
Since 7 4 is not a prime number, 7 5 n − 1 can never produce a prime as it will always have a factor of 74.
Therefore, x n − 1 can produce a prime if x − 1 is a prime. Since there are 25 primes under 100, we can produce those primes in the form of ( p + 1 ) n − 1 , where p is a prime number.
We also cannot ignore the number 2 as 2 n − 1 can also produce some primes, otherwise known as [Mersenne Primes], (https://en.wikipedia.org/wiki/Mersenne_prime).
Therefore, we have 2 5 prime numbers and the number 2 that can be produced or produce primes in the form x n − 1 .
That means that 1 0 0 − 2 6 = 7 4 integers cannot produce prime numbers.