# Integer Solutions to \(x^4 + y^4 + z^4 = w^4\) ## 1. Statement of Problem We seek all integer solutions to the equation: \[ x^4 + y^4 + z^4 = w^4 \] and an explanation for why these are the only solutions, referring to relevant mathematical theory. --- ## 2. Trivial Solutions ### All Zeros The quadruple \((x, y, z, w) = (0, 0, 0, 0)\) is an obvious **trivial solution**. ### Sign Variations Because the equation is homogeneous and the fourth power is even, any permutation of signs and orderings of \((x, y, z)\) with the same \(w\) will also be a solution if one is. --- ## 3. Nontrivial Integer Solutions ### Search for Nontrivial Solutions #### Fermat's Last Theorem (FLT) and Sums of Fourth Powers Fermat's Last Theorem states that there are **no nonzero integer solutions** to \[ x^n + y^n = z^n, \quad n > 2 \] Here, we have the sum of **three** fourth powers, not two. #### Euler's Sum of Powers Conjecture Euler conjectured that for fourth powers, \[ a^4 + b^4 + c^4 = d^4 \] has **no nontrivial integer solutions**. However, this was **disproved** in 1986 by Noam Elkies, who found the first positive integer solution. ##### Elkies' Solution The smallest known positive integer solution: \[ 2682440^4 + 15365639^4 + 18796760^4 = 20615673^4 \] ([Reference: Elkies, N. D., "On A^4 + B^4 + C^4 = D^4", Math. Computation, 1988](https://doi.org/10.2307/2008027)). #### Infinite Solutions? Elkies also showed there are **infinitely many positive integer solutions**. This is because the set of solutions forms an **infinite family**, via **parameterizations** using elliptic curves. --- ## 4. Why These are the Only Solutions ### Step-by-Step Explanation 1. **Trivial Solutions**: Obvious when any of \(x, y, z, w\) is zero (all zeros). 2. **Nontrivial Solutions**: - **Existence**: Elkies' counterexample shows nontrivial positive integer solutions exist. - **Infinite Family**: Using elliptic curves, one can generate infinitely many such solutions. - **Negative Values**: Since \(n^4 = (-n)^4\), all sign variations are also solutions. 3. **No Simple Formula**: No known "closed form" generates all solutions, but infinite families exist via parameterizations on elliptic curves. --- ## 5. Relation to Fermat’s Last Theorem - **FLT** says \(x^4 + y^4 = z^4\) has no nontrivial integer solutions. - **Our Equation**: Involves three fourth powers on the LHS. - **Key Point**: FLT does **not apply** directly; the equation is not covered by FLT. - **Euler's Conjecture**: More relevant, but *disproven* by Elkies. --- ## 6. Modular Arithmetic While modular arithmetic is useful for proving **nonexistence** of solutions in some Diophantine equations, it does **not preclude** solutions here. Elkies used advanced number theory, not elementary modular arithmetic, to find solutions. --- ## 7. Elliptic Curves and Wiles’ Proof - **Wiles’ Proof**: Proves FLT using modular forms and elliptic curves. - **Elkies’ Method**: Also employs elliptic curves, but to **construct** solutions to \(x^4 + y^4 + z^4 = w^4\), not to rule them out. - **Summary**: Both use elliptic curves, but for opposite purposes (nonexistence vs. existence). --- ## 8. Computational Complexity Class ### Is this NP-Complete? - **Definition**: An NP-complete problem is a decision problem where a "yes" answer can be verified in polynomial time, and all NP problems can be reduced to it in polynomial time. - **This Problem**: Given integers, decide if \(x^4 + y^4 + z^4 = w^4\) has a solution. - For *fixed* bounds, this is a **finite search** (in NP). - In the **general case**, finding *all* solutions is **undecidable** (Hilbert's 10th problem proved that no algorithm can decide arbitrary Diophantine equations). - **Conclusion**: The general problem is **undecidable**, not NP-complete. For fixed bounds, it is in NP, but not known to be NP-complete. --- ## 9. Summary Table | Solution Type | Existence? | How Many? | |----------------------|--------------------|-----------------------| | Trivial (all 0) | Yes | 1 | | Nontrivial integers | Yes | Infinitely many | | Positive integers | Yes | Infinitely many | --- ## 10. References - Elkies, N. D. (1988). ["On A^4 + B^4 + C^4 = D^4"](https://doi.org/10.2307/2008027). Math. Computation. - Wiles, A. (1995). ["Modular Elliptic Curves and Fermat’s Last Theorem"](https://www.ams.org/journals/annals/1995-141-03/S0003-486X-1995-1324136-2/S0003-486X-1995-1324136-2.pdf). Annals of Mathematics. - [Wikipedia: Euler's Sum of Powers Conjecture](https://en.wikipedia.org/wiki/Euler%27s_sum_of_powers_conjecture) - [Wikipedia: Fermat's Last Theorem](https://en.wikipedia.org/wiki/Fermat%27s_Last_Theorem) - [Wikipedia: Hilbert’s Tenth Problem](https://en.wikipedia.org/wiki/Hilbert%27s_tenth_problem) --- ## 11. Conclusion - **All-zero** and **infinitely many nontrivial integer solutions** exist to \(x^4 + y^4 + z^4 = w^4\). - This is due to the existence of infinite families of solutions, as shown by Elkies using elliptic curves. - The problem is **undecidable** in general (not NP-complete), per Hilbert’s 10th Problem. - The problem is related to, but not covered by, Fermat’s Last Theorem, and its solution involves deep connections to elliptic curves.