Fibonacci Power!

How many values of kk are there such that FkF_k is of the form 2n2^n?

Note that both kk and nn are non-negative integers.

Also F0=0,F1=1F_0=0,F_1=1 and Fm=Fm1+Fm2F_m=F_{m-1}+F_{m-2}

×

Problem Loading...

Note Loading...

Set Loading...