MathDB
2022 Team P13

Source:

February 28, 2022
team

Problem Statement

Let FnF_n denote the nnth Fibonacci number, with F0=0,F1=1F_0=0, F_1=1 and Fn=Fn−1+Fn−2F_{n}=F_{n-1}+F_{n-2} for n≥2n \geq 2. There exists a unique two digit prime pp such that for all nn, p∣Fn+100+Fnp | F_{n+100} + F_n. Find pp. Proposed by Sam Rosenstrauch
Back to ProblemsView on AoPS