Does there exist a triple of positive integers ( a , b , n ) , with n ≥ 3 such that
n a b = a 2 + b 2 ?
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.
let us assume a = k b
( n ) ( k b ) ( b ) = ( k b ) 2 + ( b 2 )
( b 2 ) ( n k ) = [ ( b 2 ) [ ( k 2 ) + 1 ]
n k = [ ( k 2 ) + 1 ]
n = [ ( k 2 ) + 1 ]
n = k + 1 / k
n cannot have an integer value except for when k = 1
but then n = 2
but n > = 3
let g=gcd(a,b).Then ,write a=gx and b=gy.
then it follows that,nxy= x 2 + y 2 .Now,x and y both divides x 2 + y 2 .Since,x and y are coprime ,we have x=y=1. That implies n=1+1=2.So,no solutions exist.
Problem Loading...
Note Loading...
Set Loading...
Suppose that such a solution exists: b 2 − n a b + a 2 = 0 .
Then, the quadratic equation gives us b = 2 n a ± n 2 a 2 − 4 a 2 = a 2 n ± n 2 − 4 .
Hence, we require n 2 − 4 to be a perfect square.
Suppose that n 2 − 4 = m 2 . Then, n 2 − m 2 = 4 , so ( n − m ) ( n + m ) = 4 .
Since n − m , n + m are integers with the same parity, and are factors of 4, we must have n − m = n + m = 2 .
Thus m = 0 , n = 2 .
However, we require n ≥ 3 , so there are not solutions.
Note: When n = 2 , m = 0 , we have the positive integer solutions a = b .