Find the number of solution triples ( p , a , b ) to the equation
a + a + 8 p = 4 + 2 b
where a and b are positive integers and p < 1 0 0 0 0 0 is 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.
Excellent solution, Patrick. I believe though that you are referring to Fermat primes rather than Mersenne primes. These are the only 5 known Fermat primes, but it is an open question as to whether or not there are more, hence my restriction on p , (just in case someone were to find more in the future).
For now I'll just list out the solution triples:
( 2 , 9 , 2 ) , ( 3 , 1 , 1 ) , ( 3 , 2 5 , 3 ) , ( 5 , 8 1 , 4 ) , ( 1 7 , 1 0 8 9 , 6 ) , ( 2 5 7 , 2 6 3 1 6 9 , 1 0 ) , ( 6 5 5 3 7 , 1 7 1 8 0 1 3 1 3 2 9 , 1 8 ) .
The sequence of primes 3 , 5 , 1 7 , 2 5 7 , 6 5 5 3 7 should look familiar.
Problem Loading...
Note Loading...
Set Loading...
Let a + 8 p = x 2 , a = y 2 . We get x + y = 4 + 2 b and x − y = x + y x 2 − y 2 = 4 + 2 b 8 p .
From this we get that x and y are, respectively, 2 + 2 b − 1 ± 1 + 2 b − 2 p .
Since x and y are rational numbers whose squares are integers, they must be integers themselves.
If b = 1 then they are 3 ± 3 2 p , so p = 3 leads to a solution ( 3 , 1 , 1 ) .
If b = 2 then they are 4 ± 2 p , so p = 2 leads to a solution ( 2 , 9 , 2 ) .
Otherwise, the denominator is an odd integer > 1 , which must equal p for x and y to be integral. But the only odd primes that are one more than powers of 2 are the Fermat primes, i.e. b − 2 is a power of 2 . (This is a standard result.)
There are five odd Fermat primes less than 1 0 0 0 0 0 : 3 , 5 , 1 7 , 2 5 7 , 6 5 5 3 7 . So there are a total of 7 solutions in all.