← All problems

🇺🇸 USA USAAIO 2025, Round 1

Linear Recurrences and Spectral Decomposition

Solve a Fibonacci-type recurrence via eigendecomposition and implement it in NumPy.

Read the statement
Statement
English
To hand in
Written answers
Data type
✍️ Written questions
Estimated difficulty
★★☆☆☆
Solution
See a solution ↗ · best opened after you have tried

Get ready on the platform

The chapters of the learning path that prepare for this problem.

These chapters are picked from the solution: showing them may hint at the approach.

›How to tackle it
  1. Read everything first. Note what each question asks and how it is marked.
  2. Work on paper. Justify every step: at an olympiad, the reasoning earns the points.
  3. Then compare. Open the solution only once you have an answer, and compare your reasoning with it.

The statement, data and solutions belong to their authors; we only link to them.

Are you the author or organiser? Ask for a correction or removal