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

Home > Numbers > Sequences
Pseudo-FIBO (Posted on 2014-04-14) Difficulty: 4 of 5

a. If the pseudo-Fibonacci numbers are defined by u(1) = 1 , u(2) = 4, u(n)= u(n-1)+u(n-2) show that u(1) = 1, u(2) = 4, and u(4) = 9 are the only squares in the series.

b. How many ordered integer pairs (a,b) both non-negative (a<b) exist, such that a pseudo-Fibo series based upon any of those pairs (i.e. u(1)=a, u(2)=b... etc) will contain 520 as a member generated by that pair ?

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Some ThoughtsPart a; possible solutionbroll2014-04-15 14:10:49
Hints/Tipsre: 'generated'........... att: All solversAdy TZIDON2014-04-15 11:19:27
'generated'Jer2014-04-15 00:06:58
Striking a blow for equalitySteve Herman2014-04-14 20:49:14
Solutioncomputer solution part bCharlie2014-04-14 16:06:52
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2021 by Animus Pactum Consulting. All rights reserved. Privacy Information