olymmath

USAMO 1999 Problem 3

  • Day 1

Let p>2p > 2 be a prime and let a,b,c,da,b,c,d be integers not divisible by pp , such that {rap}+{rbp}+{rcp}+{rdp}=2\left\{ \dfrac{ra}{p} \right\} + \left\{ \dfrac{rb}{p} \right\} + \left\{ \dfrac{rc}{p} \right\} + \left\{ \dfrac{rd}{p} \right\} = 2 for any integer rr not divisible by pp . Prove that at least two of the numbers a+ba+b , a+ca+c , a+da+d , b+cb+c , b+db+d , c+dc+d are divisible by pp . (Note: {x}=x−⌊x⌋\{x\} = x - \lfloor x \rfloor denotes the fractional part of xx .)

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/1999/p3 · Tag ESWE2Y07NG · Edit this page on GitHub · Keys: j next, k previous