perplexus.info :: Just Math : Near Fermat Formulation

Near Fermat Formulation (Posted on 2015-05-11)

Prove that the equation:
A^N + B^N = C^N-1
has an infinity of positive integer solutions for every integer value of N ≥ 2

See The Solution Submitted by K Sengupta

Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

re: solution

| Comment 2 of 4 |

(In reply to solution by Daniel)

That's a good start.

But it only proves the case of A = B = 2^(n-2) and C=2^(n-2).

Can you extend it to what the problem requests, namely, an infinity of integer solutions, A, B, and C?

Posted by JayDeeKay on 2015-05-11 17:51:48

Please log in:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info