FnF_nFn is the Fibonacci sequence F0=F1=1F_0 = F_1 = 1F0=F1=1 , Fn+2=Fn+1+FnF_{n+2} = F_{n+1} + F_nFn+2=Fn+1+F . Find all pairs m>k≥0m > k \geq 0m>k≥0 such that the sequence x0,x1,x2,...x_0, x_1, x_2, ...x0,x1,x2,... defined by x0=FkFmx_0 = \frac{F_k}{F_m}x0=FmF and xn+1=2xn−11−xnx_{n+1} = \frac{2x_n - 1}{1 - x_n}xn+1=1−xn for xn≠1x_n \not = 1xn=1 , or 111 if xn=1x_n = 1xn=1 , contains the number 111