A Fibonacci sequence is representing as F n .
F 1 = 1 ; F 2 = 1 ; F 3 = 2 ; F 4 = 3 …… and so on.
A is a 2 × 2 idempotent matrix ( A 2 = A ) given as-
A = [ F k 0 F k − 1 0 ] ⋅ [ F k − F k + 1 − F k − 2 F k − 1 ]
How many values of k is possible less than 100?
This is an original problem and belongs to my set Raju bhai's creations
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.
Problem Loading...
Note Loading...
Set Loading...
Given,
A = [ F k 0 F k − 1 0 ] ⋅ [ F k − F k + 1 − F k − 2 F k − 1 ]
A = [ F k 2 − F k − 1 ⋅ F k + 1 0 F k − 1 2 − F k − 2 ⋅ F k 0 ]
Now, we will consider a property of Fibonacci sequence-
F n 2 − F n − 1 ⋅ F n + 1 = ( − 1 ) n + 1
Therefore, A = [ ( − 1 ) k + 1 0 ( − 1 ) k 0 ]
Trace of A= t r ( A ) = ( − 1 ) k + 1
Determinant of A= ∣ A ∣ = 0
A property of 2 × 2 matrix-
A 2 − t r ( A ) ⋅ A + ∣ A ∣ ⋅ I = 0
⟹ A 2 = ( − 1 ) k + 1 A
Given, A 2 = A , by comparing,
( − 1 ) k + 1 = 1
k + 1 → e v e n
k → o d d
Number of odd natural numbers less than 100 is 50.
But k = 1 as F 0 is not specified.
So, answer is 4 9