True or False : If and are positive integers and is any prime number , then the sum of all possible positive integer solutions for the equation is always the product of and the sum of and .
(For example, if and , then , a prime number . The possible positive integer solutions for the equation are , , , and , and and .)
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.
If ω = − 2 1 + 2 1 i 3 is a primitive cube root of unity, then the ring R = Z [ ω ] is an Euclidean domain with distance function N ( u + v ω ) = ∣ u + v ω ∣ 2 = u 2 − u v + v 2 u , v ∈ Z If a , b ∈ N are such that a 2 + a b + b 2 = p > 3 is prime, then a − b ω ∈ R is such that N ( a − b ω ) = p , and hence a − b ω is irreducible in R . Similarly, a − b ω 2 ∈ R is irreducible.
If c , d ∈ N are such that c 2 − c d + d 2 = p , then ( c + d ω ) ( c + d ω 2 ) = ( a − b ω ) ( a − b ω 2 ) and hence either c + d ω = u ( a − b ω ) or c + d ω = u ( a − b ω 2 ) for some unit u ∈ R . The units of R are ± 1 , ± ω , ± ω 2 . Checking the twelve possibilities for c + d ω for solutions where both c and d are positive, we deduce that we must have ( c , d ) = ( a , a + b ) , ( b , a + b ) , ( a + b , a ) or ( a + b , b ) . If a = b , then p = 3 a 2 , and hence 3 divides p , which is not possible, since p > 3 . Thus we deduce that a = b , and hence there are four distinct solutions for ( c , d ) . Thus the sum of their values is a + ( a + b ) + b + ( a + b ) + ( a + b ) + a + ( a + b ) + b = 6 ( a + b ) making the result T r u e .