Proof Writing & Problem SolvingEasy
Proof Writing & Problem Solving · Easy problem
Start with 720. Each step replaces the current number by one of its divisors that is smaller than it, and the process stops at 1. Descent guarantees the process stops. What is the LARGEST possible number of steps?