If a , b , and c are non-zero distinct pairwise co-prime integers, find the number of solutions for
a 8 + b 4 = c 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.
Mathologer made a video on this :)
Nice solution! Can you provide a proof that x 4 + y 4 = z 2 has no solutions for everybody's enjoyment?
Fermat, famous for his unproven claim that x n + y n = z n has no non-trivial solutions for n ≥ 3 , did actually provide a prove for this.
Suppose, w.l.o.g., that ( x , y , z ) have no common factors and y is even. Then ( x 2 , y 2 , z ) are a primitive Pythagorean triple. This means that x 2 = p 2 − q 2 , y 2 = 2 p q and z = p 2 + q 2 , for some odd p and even q .
But now we have x 2 + q 2 = p 2 , showing that ( x , q , p ) are also a Pythagorean triple (which is actually primitive). Let's say x = u 2 − v 2 , q = 2 u v and p = u 2 + v 2 . Now y 2 = 2 p q = 2 ⋅ ( u 2 + v 2 ) ⋅ 2 u v = 4 u v ( u 2 + v 2 ) must be a square. However, u , v and u 2 + v 2 are coprime, so that they must all be squares; say, u = ξ 2 , v = η 2 , and u 2 + v 2 = ζ 2 , with ξ , η , ζ coprime. But now we have a triple ξ 4 + η 4 = ζ 2 , We now have a recipe to replace any coprime triple ( x , y , z ) such that x 4 + y 4 = z 2 by a strictly smaller coprime triple ( ξ , η , ζ ) with the same property. This process could be repeated indefinitely, ( x , y , z ) ↦ ( ξ , η , ζ ) ↦ … However, such an infinitely descending sequence of positive integers does not exist, proving that there cannot be any triple ( x , y , z ) with the desired property.
We try for a primitive solution: Then a^4 = 2xy, b^2 = x^2 - y^2, c = x^2 + y^2, (x,y) = 1. Let a = 2m, a^4 = 16m^4 = 2xy, 8m^4 = xy. Let x = 8t, since (x,y) = 1. Then 8m^4 = 8ty, and m^4 = ty, Since (t,y) = 1, t = i^4, y = j^4. Then b^2 = 64t^2 - j^8, or b^2 + j^8 = 64t^2. But b is odd and j is odd, so b^2 = 8n + 1, j^8 = 8f + 1, b^2 + j^8 = 8H + 2 =64t^2, which is impossible since 8 does not divide 2.
Just for visual ease:
We try for a primitive solution: Then a 4 = 2 x y , b 2 = x 2 − y 2 , c = x 2 + y 2 , ( x , y ) = 1 .
Let a = 2 m , a 4 = 1 6 m 4 = 2 x y , 8 m 4 = x y .
Let x = 8 t , since ( x , y ) = 1 . Then 8 m 4 = 8 t y , and m 4 = t y ,
Since ( t , y ) = 1 , t = i 4 , y = j 4 . Then b 2 = 6 4 t 2 − j 8 , or b 2 + j 8 = 6 4 t 2 .
But b is odd and j is odd, so b 2 = 8 n + 1 , j 8 = 8 f + 1 , b 2 + j 8 = 8 H + 2 = 6 4 t 2 , which is impossible since 8 does not divide 2 .
Problem Loading...
Note Loading...
Set Loading...
It is well-known that x 4 + y 4 = z 2 has no solutions; this immediately applies to x = a 2 .