2006 USAMO Problems/Problem 1
Revision as of 19:24, 1 September 2006 by Boy Soprano II (talk | contribs)
Problem
Let be a prime number and let be an integer with . Prove that there exist integers and with and
if and only if is not a divisor of .
Note: For a real number, let denote the greatest integer less than or equal to , and let denote the fractional part of .
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.