If a prime number can be written as then enter the product of all possible primes of this form less than
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.
Since
1 6 1 6 + 1 ≈ 1 . 8 ⋅ 1 0 1 9 > 1 0 1 9
We get the bound for a
1 ≤ a ≤ 1 5
If a is an odd number, a a + 1 is even and it is surely composite, exept for the case a = 1 that gives the prime 2
Now suppose a was not a power of 2 and let a = 2 b ⋅ c , where 2 ∤ c , c = 1 , so
a a + 1 = a 2 b ⋅ c + 1 = ( a 2 b ) c + 1 = ( a 2 b + 1 ) [ ( a 2 b ) c − 1 − ( a 2 b ) c − 2 + … + 1 ]
Which is not prime, so it is necessary but not sufficient that a is a power of 2 . We have only 3 powers of 2 to check
2 2 + 1 = 5 c c c c c c c Prime
4 4 + 1 = 2 5 7 c c c c c c c Prime
8 8 + 1 = 2 2 4 + 1 = ( 2 8 ) 3 + 1 = 2 5 6 3 + 1 = ( 2 5 6 + 1 ) ( 2 5 6 2 − 2 5 6 + 1 ) c c c c c c c Not prime
Hence the product of all primes of the form a a + 1 less than 1 0 1 9 is
2 ⋅ 5 ⋅ 2 5 7 = 2 5 7 0