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 only distinct positive integers for which the given equation is true are 2 and 4: 2 4 = 4 2 = 1 6 . Then 2 2 ⋅ 4 4 = 1 0 2 4
Proof that this is the only solution. Assume without loss of generality that x > y ≥ 1 .
Let a = gcd ( x , y ) . Then u = x / a and v = y / a are coprime. The equation x y = y x yields a y u y = a x v x ∴ u y = a x − y v x . Since u and v are coprime, they have no common prime factors. On the other hand, any prime factor in v must also be a prime factor in u . This implies v = 1 ; y = a ; u = y a x − y = a x / y − 1 ; x = a x / y = a u . We see that u = a u − 1 . It is also clear that a > 1 and u > 1 .
Now set b = a − 1 > 0 and w = u − 1 > 0 ; by binomial expansion we write a u − 1 = ( 1 + b ) w = 1 + w b + ⋯ . But this must be equal to u = 1 + w ; this only works if b = 1 and w = 1 , i.e. a = 2 and u = 2 . This means of course that x = 4 , y = 2 .