Y by HWenslawski, Didier, megarnie, PRMOisTheHardestExam, Aryan-23
Initially, some positive integer greater than 1 is written on the board. Every second one erases number
written on the board at this moment and writes number
where
is some prime divisor of
and this process lasts indefinitely. Prove that number
was chosen as a prime number
infinitely many times.
Proposed by Mykhailo Shtandenko






Proposed by Mykhailo Shtandenko