Home > Numbers > Sequences
Pseudo-FIBO (Posted on 2014-04-14) |
|
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 ?
Comments: (
You must be logged in to post comments.)
|
|
Please log in:
Forums (0)
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
Chatterbox:
|