MathDB
A 28

Source:

May 25, 2007
number theorygreatest common divisorfloor functionfunctionalgebraDivisibility Theory

Problem Statement

Prove that the expression gcd⁡(m,n)n(nm)\frac{\gcd(m, n)}{n}{n \choose m} is an integer for all pairs of positive integers (m,n)(m, n) with n≥m≥1n \ge m \ge 1.
Back to ProblemsView on AoPS