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

Home > Numbers
Two to the Tee (Posted on 2005-07-29) Difficulty: 3 of 5
Prove that 2T-3U=1 has only two integer solutions: T=1 and U=0, and T=2 and U=1.

See The Solution Submitted by Old Original Oskar!    
Rating: 4.0000 (4 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
another small observation | Comment 3 of 5 |
Odd T > 1 is clearly impossible. For odd T, 2^T  = -1 mod 3 (-1^T = -1 when T is odd.) But 3^U = 0 mod three for all U > 0, and -1 mod 3 - 0 mod 3 can never = 1 (mod 3).

The exception here is that 3^0 = 1 mod 3, and so there can be a solution when T is odd and U = 0 : which is one of the two solutions given -- T=1,U=0.

I don't know if even T are subject  to a similar treatment or not...


  Posted by Paul on 2005-07-29 21:13:27
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:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information