Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2006 USAMO Problems/Problem 1"
Line 1: Line 1:
 
== Problem ==
 
== Problem ==
  
−
Let <math>\displaystyle p</math> be a prime number and let <math>\displaystyle s</math> be an integer with <math> \displaystyle 0 < s < p </math>. Prove that there exist integers <math>\displaystyle m</math> and <math>\displaystyle n</math> with <math>\displaystyle 0 < m < n < p</math> and
+
Let <math>p</math> be a prime number and let <math>s</math> be an integer with <math>0 < s < p </math>. Prove that there exist integers <math>m</math> and <math>n</math> with <math>0 < m < n < p</math> and
  
 
<center>
 
<center>
Line 7: Line 7:
 
</center>
 
</center>
  
−
if and only if <math>\displaystyle s </math> is not a divisor of <math>\displaystyle p-1 </math>.
+
if and only if <math>s </math> is not a divisor of <math>p-1 </math>.
  
−
Note: For <math> \displaystyle x</math> a real number, let <math>\lfloor x \rfloor</math> denote the greatest integer less than or equal to <math>x</math>, and let <math>\{x\} = x - \lfloor x \rfloor</math> denote the fractional part of <math> \displaystyle x </math>.
+
Note: For <math>x</math> a real number, let <math>\lfloor x \rfloor</math> denote the greatest integer less than or equal to <math>x</math>, and let <math>\{x\} = x - \lfloor x \rfloor</math> denote the fractional part of <math>x </math>.
  
 
== Solution ==
 
== Solution ==
  
−
{{solution}}
+
We proceed by contradiction.  Assume that <math>s|(p-1)</math>.  Then for some positive integer <math>k</math>, <math>sk=p-1</math>.  The conditions given are equivalent to stating that <math>sm \mod p < sn \mod p< s\mod p</math>.
 +
Now consider the following array modulo p:
 +
 
 +
<math>\mbox{row 1}\qquad s\qquad 2s\qquad \hdots\qquad ks\\
 +
\mbox{row 2}\qquad s-1\qquad 2s-1\qquad \hdots\qquad ks-1\\
 +
\vdots\\
 +
\mbox{row s}\qquad 1\qquad s+1\qquad \hdots\qquad (k-1)s+1</math>
 +
 
 +
Obviously, there are <math>s</math> rows and <math>k</math> columns. The first entry of each row is simply <math>((r-1)k+1)s\mod p</math>.  Since we wish for <math>sm \mod p \mbox{and} sn\mod p</math> to both be in the first column, while also satisfying the given conditions, we can easily see that <math>sm</math> must be in a row <math>m_r</math> with <math>m_r>n_r</math>, where <math>n_r</math> denotes the row <math>sn \mod p</math> is in.  However, since the values of each entry decreases while <math>((r-1)k+1)s</math> keeps increasing, we can see that the condition can never be satisfied and thus, <math>s\not|(p-1)</math>
 +
 
 +
To prove the other direction, let <math>sj+r=p-1</math> for positive integers <math>j</math> and <math>r</math> with <math>j</math> being the largest integer such that <math>sj<p-1</math> and <math>r<s</math>. Since <math>s\not|(p-1)</math>, <math>1<s<p-1</math>.
 +
 
 +
Note that for <math>0<l<j</math>, <math>ls\ge s\mod p</math>.  Thus, the first integer multiplied by s modulo p that will be less than s is <math>j+1.</math>  <math>(j+1)s\equiv s-r-1\mod p</math>.  Since <math>\lbrace s,2s,\hdots,js,(j+1)s,\hdots,xs,\hdots,(p-1)s \rbrace</math> is a complete residue system mod p with the exception of the 0 term, we can find an <math>x>j+1</math> such that <math>xs \equiv s-1 \mod p</math>.
 +
 
 +
Thus, choose <math>m=j+1</math> and <math>n=x</math> to complete the proof.
  
 
== Resources ==
 
== Resources ==

Revision as of 20:24, 13 April 2008

Problem

Let $p$ be a prime number and let $s$ be an integer with $0 < s < p$. Prove that there exist integers $m$ and $n$ with $0 < m < n < p$ and

$\left\{ \frac{sm}{p} \right\} < \left\{ \frac{sn}{p} \right\} < \frac{s}{p}$

if and only if $s$ is not a divisor of $p-1$.

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

Solution

We proceed by contradiction. Assume that $s|(p-1)$. Then for some positive integer $k$, $sk=p-1$. The conditions given are equivalent to stating that $sm \mod p < sn \mod p< s\mod p$. Now consider the following array modulo p:

$\mbox{row 1}\qquad s\qquad 2s\qquad \hdots\qquad ks\\ \mbox{row 2}\qquad s-1\qquad 2s-1\qquad \hdots\qquad ks-1\\ \vdots\\ \mbox{row s}\qquad 1\qquad s+1\qquad \hdots\qquad (k-1)s+1$

Obviously, there are $s$ rows and $k$ columns. The first entry of each row is simply $((r-1)k+1)s\mod p$. Since we wish for $sm \mod p \mbox{and} sn\mod p$ to both be in the first column, while also satisfying the given conditions, we can easily see that $sm$ must be in a row $m_r$ with $m_r>n_r$, where $n_r$ denotes the row $sn \mod p$ is in. However, since the values of each entry decreases while $((r-1)k+1)s$ keeps increasing, we can see that the condition can never be satisfied and thus, $s\not|(p-1)$

To prove the other direction, let $sj+r=p-1$ for positive integers $j$ and $r$ with $j$ being the largest integer such that $sj<p-1$ and $r<s$. Since $s\not|(p-1)$, $1<s<p-1$.

Note that for $0<l<j$, $ls\ge s\mod p$. Thus, the first integer multiplied by s modulo p that will be less than s is $j+1.$ $(j+1)s\equiv s-r-1\mod p$. Since $\lbrace s,2s,\hdots,js,(j+1)s,\hdots,xs,\hdots,(p-1)s \rbrace$ is a complete residue system mod p with the exception of the 0 term, we can find an $x>j+1$ such that $xs \equiv s-1 \mod p$.

Thus, choose $m=j+1$ and $n=x$ to complete the proof.

Resources

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2006_USAMO_Problems/Problem_1&oldid=24700"