Putnam 2008 A3
- Session A
Start with a finite sequence of positive integers. If possible, choose two indices such that does not divide , and replace and by and , respectively. Prove that if this process is repeated, it must eventually stop and the final sequence does not depend on the choices made. (Note: gcd means greatest common divisor and lcm means least common multiple.)
Curated text Kedlaya Putnam archive. Quoted with source.
Solutions
Human solution Solution 1 by Kiran Kedlaya and Lenny Ng
The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).
Similar problems
These problems have the most words in common with this statement.