olymmath

RMM 2009 Problem 1

  • Day 1

For ai∈Z+a_i \in \mathbb{Z}^ + , i=1,…,ki = 1, \ldots, k , and n=∑i=1kain = \sum^k_{i = 1} a_i , let d=gcd⁡(a1,…,ak)d = \gcd(a_1, \ldots, a_k) denote the greatest common divisor of a1,…,aka_1, \ldots, a_k . Prove that dn⋅n!∏i=1k(ai!)\frac {d} {n} \cdot \frac {n!}{\prod\limits^k_{i = 1} (a_i!)} is an integer.

Dan Schwarz, Romania

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 rmm/2009/p1 · Tag 5XQWFSGCVK · Edit this page on GitHub · Keys: j next, k previous