Extension of Fermat's theorem?

Click For Summary
SUMMARY

The forum discussion centers on the extension of Fermat's Last Theorem, specifically exploring the equation x1^n + x2^n + ... + xk^n = z^n for integers, where n > k. It is established that there are no solutions for k=2, while solutions exist for k=1. The conversation references known results, including Euler's Sum of Powers Conjecture and the existence of solutions for the case a^5 + b^5 + c^5 + d^5 = e^5. Participants share links to resources that provide further insights into these mathematical concepts.

PREREQUISITES
  • Understanding of Fermat's Last Theorem
  • Familiarity with Diophantine equations
  • Knowledge of Euler's Sum of Powers Conjecture
  • Basic concepts of number theory
NEXT STEPS
  • Research Euler's Sum of Powers Conjecture in detail
  • Explore the implications of Diophantine equations
  • Investigate the solutions for a^5 + b^5 + c^5 + d^5 = e^5
  • Study the generalizations of Fermat's Last Theorem
USEFUL FOR

Mathematicians, number theorists, and students interested in advanced mathematical concepts, particularly those exploring the boundaries of Fermat's Last Theorem and related conjectures.

ACG
Messages
46
Reaction score
0
Hi! I assume you all know Fermat's last theorem. Well, has anyone considered the following extension to it? Assuming we're just using integers:

We know that x1^n + x2^n = y^n has no solution for n > 2. However, what about this?

For which values of k does x1^n+x2^n+...+xk^n = z^n have solutions for n > k?

We know it's true for 1 ((-1)^2 = 1^2) and not true for 2. What about other numbers?

Thanks in advance,

ACG
 
Mathematics news on Phys.org
Every number is the sum of 4 squares. That is one known result.
 
Hi!

That's cool -- I'd wondered about that myself :)

However, that won't help here: the sum of four objects case would have to be a^5+b^5+c^5+d^5 = e^5.

ACG
 
ACG said:
Hi! I assume you all know Fermat's last theorem. Well, has anyone considered the following extension to it? Assuming we're just using integers:

We know that x1^n + x2^n = y^n has no solution for n > 2. However, what about this?

For which values of k does x1^n+x2^n+...+xk^n = z^n have solutions for n > k?

We know it's true for 1 ((-1)^2 = 1^2) and not true for 2. What about other numbers?

Thanks in advance,

ACG

Yes, I have (considered that, and also wrote a short program to try and find a counter-example).
Have you been able to find anymore details about this one (like, has it been proved, disproved, etc.)?
Thanks.
 
like, has it been proved, disproved, etc.
Alphanumeric has already posted links that contain counter examples. For example they show several solutions to a^5 + b^5 + c^5 + d^5 = e^5
 
uart said:
Alphanumeric has already posted links that contain counter examples. For example they show several solutions to a^5 + b^5 + c^5 + d^5 = e^5

thanks
 

Similar threads

  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 105 ·
4
Replies
105
Views
8K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
Replies
20
Views
4K
Replies
3
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K