olymmath

Putnam 2000 B2

  • Session B

Prove that the expression gcd(m,n)n(nm)\frac{gcd(m,n)}{n}\binom{n}{m} is an integer for all pairs of integers n≥m≥1n\geq m\geq 1.

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Manjul Bhargava, 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).

Locator putnam/2000/b2 · Tag STW01578T8 · Edit this page on GitHub · Keys: j next, k previous