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
)
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.
)
solution
| Comment 1 of 4
let A=B=2^(n-2) and C=2^(n-1)
then we have
A^n+B^n=
[2^(n-2)]^n+[2^(n-2)]^n
2*[2^(n-2)]^n
2*2^(n*(n-2))
2*2^(n^2-2n)
2^(n^2-2n+1)
2^((n-1)^2)
[2^(n-1)]^(n-1)=C^(n-1)
Posted by
Daniel
on 2015-05-11 13:20:55
Please log in:
Login:
Password:
Remember me:
Sign up!
|
Forgot password
Search:
Search body:
Forums (1)
Newest Problems
Random Problem
FAQ
|
About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
blackjack
flooble's webmaster puzzle
Copyright © 2002 - 2024 by
Animus Pactum Consulting
. All rights reserved.
Privacy Information