MathDB

3

Part of 2011 CentroAmerican

Problems(1)

Slipping integers

Source: Centroamerican 2011, Problem 3

6/22/2011
A slip on an integer n≥2n\geq 2 is an operation that consists in choosing a prime divisor pp of nn and replacing nn by n+p2p.\frac{n+p^2}{p}.
Starting with an arbitrary integer n≥5n\geq 5, we successively apply the slip operation on it. Show that one eventually reaches 55, no matter the slips applied.
inequalitiesnumber theory proposednumber theory