Question 78
An integer $n \geqslant 2$ is written on the board. Each day, someone chooses a prime divisor $p$ of the integer $n$ written on the board, erases it and writes $n+\frac{n}{p}$ in its place. Show that $p=3$ is chosen infinitely many times.