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) Difficulty: 3 of 5
Show that if an+bn= 2m, 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.)
solution | Comment 3 of 4 |

Divide the equation by the power of 2 that a and b share.

If the right-hand side of the reduced equation = 2, then (a,b,n,m) = (2,2,n,n+1) is a solution of the original equation.

Assume the right-hand side of the reduced equation >=4.  Then the 2 terms of the left-hand side can't both be even, since we've factored out common powers of 2, and one can't be odd and the other even, since that would yield a odd sum, so they're both odd.  But then their sum = 2mod4, which is impossible. 

 


  Posted by xdog on 2007-04-09 08:27:10
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 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information