All about
flooble
|
fun stuff
|
Get a free chatterbox
|
Free JavaScript
|
Avatars
perplexus
dot
info
Home
>
Numbers
Close to Fermat (
Posted on 2007-04-06
)
Show that if a
n
+b
n
= 2
m
, and a, b, m, and n are positive integers (n>1), then a=b.
See The Solution
Submitted by
Federico Kereki
Rating:
5.0000
(1 votes)
Comments: (
Back to comment list
| You must be logged in to post comments.
)
Begin
| Comment 1 of 4
If a and b are distinct. Then 2^m=a^n+b^n>2*min(a,b)^n>=2^(n+1), then m>n+1
Posted by
Gamer
on 2007-04-06 23:10:22
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:
blackjack
flooble's webmaster puzzle
Copyright © 2002 - 2024 by
Animus Pactum Consulting
. All rights reserved.
Privacy Information