OIM 1987 Problem 1

The sequence $(p_n)$ is defined as follows: $p_1=2$ and for all $n$ greater than or equal to $2$ , $p_n$ is the largest prime divisor of the expression $p_1p_2p_3\ldots p_{n-1}+1$ . Prove that every $p_n$ is different from $5$ .