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

Home > Numbers
Greatest value (Posted on 2007-02-02) Difficulty: 3 of 5
Determine analytically the maximum of a²+b² if a and b belong to the set {1,2...10000} and satisfy |a²-ab-b²|=1.

See The Solution Submitted by atheron    
Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution a solution | Comment 1 of 2

If a^2-ab-b^2=1, then b=(-a+sqrt(5a^2-4))/2. So 5a^2-4 must be a perfect square. --> a=2, 5, 13, 34, ... --> the sequence a(n)=3a(n-1) - a(n-2) where a(1)=2 and a(2)=5. So the largest a<10001 is a=4181 --> b=2584 --> a^2 +b^2 = 24,157,817. <br>

If a^2-ab-b^2=-1, then b=(-a+sqrt(5a^2+4))/2. --> a=1, 3, 8, 21, ... --> a(n)=3a(n-1) - a(n-2) where a(1)=1 and a(2)=3. So the largest a<10001 is a=6765 --> b=4181 --> a^2 + b^2 = 63,245,986. <br>

So maximum value is 63,245,986.


  Posted by Dennis on 2007-02-02 13:36:57
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