Brute forces perhaps

I guess you all familiar with the Fibonacci sequence.

For those who haven't known this term yet, the Fibonacci sequence is a sequence of numbers which F(0)=0F(0)=0, F(1)=1F(1)=1 and for n2n \ge 2, F(n)=F(n1)+F(n2)F(n)=F(n-1)+F(n-2).

So, here's my question:

If F(x)F(x) is the largest prime Fibonacci number where x200x \le 200, find logxF(x)\left\lfloor \log _{ x }{ F(x) } \right\rfloor .

This problem belongs to this set
×

Problem Loading...

Note Loading...

Set Loading...