The sequence $(p_n)_{n\in\mathbb N}$ is defined by $p_1=2$ and, for $n\ge2$, $p_n$ is the largest prime factor of $p_1p_2\cdots p_{n-1}+1$. Show that $p_n\ne5$ for all $n$.
Source: Croatian MO 2004 2nd Grade P3
Tags: number theory
The sequence $(p_n)_{n\in\mathbb N}$ is defined by $p_1=2$ and, for $n\ge2$, $p_n$ is the largest prime factor of $p_1p_2\cdots p_{n-1}+1$. Show that $p_n\ne5$ for all $n$.