Problem

TxO Math Bowl 2024 - Individuals A - Problem 12

Let F_n be defined recursively such that F_n = F_{n-1} + F_{n-2} (the Fibonacci sequence), and F_1 = F_2 = 1.

Now define S_n such that:

S_n = \sum_{i=1}^{n} F_i^2

Find the least n such that 100 \mid S_n.


Show/Hide Problem Tags

Problem Tags: Algebra Number theory

Want to contribute problems and receive full credit? Click here to add your problem!
Please report any issues to us in our Discord server
Go to previous contest problem (SHIFT + Left Arrow) Go to next contest problem (SHIFT + Right Arrow)