olymmath

APMO 2002 Problem 1

  • Paper

Let a1,a2,a3,…,ana_{1}, a_{2}, a_{3}, \ldots, a_{n} be a sequence of non-negative integers, where nn is a positive integer.

Let

An=a1+a2+⋯+annA_{n}=\frac{a_{1}+a_{2}+\cdots+a_{n}}{n}

Prove that

a1!a2!…an!≥(⌊An⌋!)na_{1}!a_{2}!\ldots a_{n}!\geq\left(\left\lfloor A_{n}\right\rfloor!\right)^{n}

where ⌊An⌋\left\lfloor A_{n}\right\rfloor is the greatest integer less than or equal to AnA_{n}, and a!=1×2×⋯×aa!=1 \times 2 \times \cdots \times a for a≥1a \geq 1 (and 0!=10!=1 ). When does equality hold?

Dataset text NuminaMath olympiads. 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 apmo/2002/p1 · Tag WD5PKWDKDG · Edit this page on GitHub · Keys: j next, k previous