Given a positive integer , we subtract from it its greatest proper divisor (different from ), then do the same with the new number and repeat the operation until is obtained. Find how many subtractions are there if the process starts with .
Solution
Since is a prime, the greatest proper divisor of is and the first number obtained is . Note that if a number is even then the operation gives . So the next number is . The greatest proper divisor of is , hence
.
Now, as it is an even number, . Its greatest proper divisor is , then and .
We see that operations transform to so it takes another to reach , and so on. In order to end with , the process takes up operations.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.