# Fibonacci Numbers - out of curiousity

This are some fibonacci numbers:

0,1,1,2,3,5,...

Such that

with seed values

Find the greatest integer n that satisfy the below equation.
p.s : That should be a + instead of -

#### Attachments

• eqn.jpg
8.2 KB · Views: 619
Last edited by a moderator:

Shouldn't those more appropriately be called the Pingala numbers?

hmm.. would you tell me moer about it?
I was just trying to apply what i've learned in introductory number theory , linear algebra and calculus into fibonacci numbers...

I seem to remember somebody telling me that Fibonacci published his "Liber Abaci" in 1202, but that his famous sequence was actually plagiarised form the Indian mathematician Pingala (as was common at that time).

Oh. I didn't know that . I was always been told that the sequence of numbers are called fibonacci numbers. =x Thanks btw

Mark44
Mentor
This are some fibonacci numbers:

0,1,1,2,3,5,...

Such that

with seed values

Find the greatest integer n that satisfy the below equation.
p.s : That should be a + instead of -
What's the equation? The attachment is still waiting to be approved.

Last edited by a moderator:
$$\lfloor\frac{(\frac{(F_{m}}{F_{m-1})^{k}}{2\times\frac{(F_{m}}{F_{m-1})-1}+\frac{1}{2}\rfloor = F_{k}$$

Fn=($\phi$n-(1-$\phi$)n)/$\sqrt{}$5

If Fn=$\left\lfloor$(4/9)(13/8)n-1/2$\right\rfloor$ then 9(Fn-1/2)/4>(13/8)n. Since 13/8>$\phi$, the right hand side increases faster, and the right hand side for n=10 is already greater than the left hand side. 8 and 9 are the only integer solutions.