olymmath

USAMO 2006 Problem 1

  • Day 1

Let pp be a prime number and let ss be an integer with 0<s<p.0 < s < p. Prove that there exist integers mm and nn with 0<m<n<p0 < m < n < p and

{smp}<{snp}<sp\left \{\frac{sm}{p} \right\} < \left \{\frac{sn}{p} \right \} < \frac{s}{p}

if and only if ss is not a divisor of p−1p-1 .

Note: For xx a real number, let ⌊x⌋\lfloor x \rfloor denote the greatest integer less than or equal to xx , and let {x}=x−⌊x⌋\{x\} = x - \lfloor x \rfloor denote the fractional part of x.

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

Locator usamo/2006/p1 · Tag NN6ZW8M8WA · Edit this page on GitHub · Keys: j next, k previous