Problem

Source: 2016 Taiwan TST Round 2

Tags: number theory, Fibonacci sequence



Let $\left< F_n\right>$ be the Fibonacci sequence, that is, $F_0=0$, $F_1=1$, and $F_{n+2}=F_{n+1}+F_{n}$ holds for all nonnegative integers $n$. Find all pairs $(a,b)$ of positive integers with $a < b$ such that $F_n-2na^n$ is divisible by $b$ for all positive integers $n$.