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

Home > Numbers
Integer Rep (Posted on 2005-11-24) Difficulty: 2 of 5
Show that for any integer n there exists integers i, j, and k such that

n = i2 + j2 - 5k2

L.E. Dickson

See The Solution Submitted by Bractals    
Rating: 3.5000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Solution (thanks) Comment 2 of 2 |
(In reply to Solution by Gamer)

So, what you are saying is that n comes in two possible flavors -- even or odd.

If n is even, choose k such that k=(n-2)/2; choose i such that i=(n-4)/2; and choose j such that j=n-1.

If n is odd, choose k, i, and j such that k=(n-1)/2; i=(n+1)/2; and once again, j=n-1.

Good job!  When I first looked at this problem, it seemed daunting.  But your solution made it clear to me.  Thanks.


  Posted by Mindy Rodriguez on 2005-11-25 13:08:32
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