UGC NET Questions (Paper – 1)

Statement A correctly defines a common version of the Fibonacci sequence using a recurrence relation. C is true because the ratio of consecutive Fibonacci numbers tends toward the golden ratio as n increases. D is also correct, as Fibonacci-type recurrences are used to model branching patterns such as rabbit populations or tree growth in idealised models. B is false since Fibonacci terms are not simply double the previous term, and E is false because Fibonacci patterns frequently appear in exam puzzles and series problems. Thus A, C and D only are correct.

Option A:
Option A is incomplete because it includes only A and C and omits D, which highlights the important application of Fibonacci recurrences to growth processes, a point often emphasised in conceptual questions.

Option B:
Option B is incorrect since it lists only C and D and leaves out A, failing to define the sequence explicitly, and it does not address the incorrect claims about doubling or exam usage. It therefore does not capture the full set of correct statements.

Option C:
Option C is correct because it unites the standard definition, the limiting ratio property and an application-related statement, while excluding the false claims in B and E. This matches the way Fibonacci numbers are treated in NET mathematical reasoning.

Option D:
Option D is wrong as it includes B, which mistakenly describes the terms as doubling, along with A, C and D. The presence of this incorrect description makes the entire combination unacceptable.