olymmath

Putnam 2008 A3

  • Session A

Start with a finite sequence a1,a2,…,ana_1, a_2, \dots, a_n of positive integers. If possible, choose two indices j<kj < k such that aja_j does not divide aka_k, and replace aja_j and aka_k by gcd(aj,ak)\mathrm{gcd}(a_j, a_k) and lcm(aj,ak)\mathrm{lcm}(a_j, a_k), 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.

Locator putnam/2008/a3 · Tag T420F4ZY6R · Edit this page on GitHub · Keys: j next, k previous