All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Near Fermat Formulation (Posted on 2015-05-11) Difficulty: 3 of 5
Prove that the equation:
AN + BN = CN-1
has an infinity of positive integer solutions for every integer value of N ≥ 2

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Question 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:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
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:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information