olymmath

VTRMC 2018 Problem 4

    Let m,nm, n be integers such that n≥m≥1n \geq m \geq 1 . Prove that gcd(m,n)n(nm)\frac{\text{gcd} (m,n)}{n} \binom{n}{m} is an integer. Here gcd\text{gcd} denotes greatest common divisor and (nm)=n!m!(n−m)!\binom{n}{m} = \frac{n!}{m!(n-m)!} denotes the binomial coefficient.

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator vtrmc/2018/p4 · Tag FQC1X2D3DY · Edit this page on GitHub · Keys: j next, k previous