Let be the nth Fibonacci number, where
.
Which of the following statements is true?
for all positive integers
.
for all positive integers
for some positive integers
.
for some positive integers
.
We will use the principle of mathematical induction to solve this problem.
Given that is the nth Fibonacci number, where
.
The base case is when , then
, which is less than
.
is true.
Now assume that the statement is true for some natural number k.
Consider the Fibonacci number.
We need to show that
By the definition of the Fibonacci sequence, we have:
We also know that by the induction hypothesis,
Therefore, we have:
This inequality is true for , and it implies that,
Therefore, the statement is true for all positive integers n.
Hence, for all positive integers n.
Study 40% syllabus and score up to 100% marks in JEE