Find the number of pair of prime numbers such that
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.
The remainder on dividing any cube number by 7 is always one of { − 1 , 0 , 1 } . The technical way of saying this is that these are the cubic residues modulo 7 ; we have 0 3 ≡ 0 , 1 3 ≡ 2 3 ≡ 4 3 ≡ 1 , 3 3 ≡ 5 3 ≡ 6 3 ≡ − 1 ( m o d 7 )
The given equation becomes − a 3 − b 3 ≡ 1 ( m o d 7 )
The only way this can happen is if one of a or b is a multiple of 7 ; and since they're prime, would have to be 7 itself.
2 0 a 3 − 7 3 = 1 ⟹ 2 0 a 3 = 3 4 4 has no integer solution.
2 0 ⋅ 7 3 − b 3 = 1 ⟹ b = 1 9 is a valid solution; so there is exactly 1 solution pair.
An alternative approach is to rearrange the equation as 2 0 a 3 = b 3 + 1 = ( b + 1 ) ( b 2 − b + 1 )
Comparing factors of b + 1 , b 2 − b + 1 and 2 0 a 3 leads to a solution but involves more case analysis than the above approach.