Fibonacci in Matrix world

A Fibonacci sequence is representing as F n F_n .

F 1 = 1 ; F 2 = 1 ; F 3 = 2 ; F 4 = 3 F_1=1;F_2=1;F_3=2;F_4=3 …… and so on.

A is a 2 × 2 2\times 2 idempotent matrix ( A 2 = A ) (A^2=A) given as-

A = [ F k F k 1 0 0 ] [ F k F k 2 F k + 1 F k 1 ] A=\begin{bmatrix}F_k & F_{k-1}\\0 & 0\end{bmatrix} \cdot \begin{bmatrix}F_k & -F_{k-2}\\-F_{k+1} & F_{k-1}\end{bmatrix}

How many values of k is possible less than 100?


This is an original problem and belongs to my set Raju bhai's creations


The answer is 49.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Rajath Rao
Dec 6, 2017

Given,

A = [ F k F k 1 0 0 ] [ F k F k 2 F k + 1 F k 1 ] A=\begin{bmatrix}F_k & F_{k-1}\\0 & 0\end{bmatrix} \cdot \begin{bmatrix}F_k & -F_{k-2}\\-F_{k+1} & F_{k-1}\end{bmatrix}

A = [ F k 2 F k 1 F k + 1 F k 1 2 F k 2 F k 0 0 ] A=\begin{bmatrix}F_k^2-F_{k-1}\cdot F_{k+1} & F_{k-1}^2-F_{k-2}\cdot F_k\\0 & 0 \end{bmatrix}

Now, we will consider a property of Fibonacci sequence-

F n 2 F n 1 F n + 1 = ( 1 ) n + 1 F_n^2-F_{n-1}\cdot F_{n+1}=(-1)^{n+1}

Therefore, A = [ ( 1 ) k + 1 ( 1 ) k 0 0 ] A=\begin{bmatrix}(-1)^{k+1} & (-1)^{k}\\ 0 & 0 \end{bmatrix}

Trace of A= t r ( A ) = ( 1 ) k + 1 tr(A)=(-1)^{k+1}

Determinant of A= A = 0 |A|=0


A property of 2 × 2 2\times 2 matrix-

A 2 t r ( A ) A + A I = 0 A^2-tr(A)\cdot A+|A|\cdot I=0

A 2 = ( 1 ) k + 1 A \implies A^2=(-1)^{k+1}A

Given, A 2 = A A^2=A , by comparing,

( 1 ) k + 1 = 1 (-1)^{k+1}=1

k + 1 e v e n k+1 \rightarrow even

k o d d k \rightarrow odd


Number of odd natural numbers less than 100 is 50.

But k 1 k \ne 1 as F 0 F_0 is not specified.

So, answer is 49 \boxed{49}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...