Difference between revisions of "2006 USAMO Problems"

m (Removed extra parenthesis)
m (Fixed level of Resources section, added link to subsequent USAMO in box)
Line 35: Line 35:
 
[[2006 USAMO Problems/Problem 6 | Solution]]
 
[[2006 USAMO Problems/Problem 6 | Solution]]
  
== Resources ==
+
= Resources =
 
*[[USAMO Problems and Solutions]]
 
*[[USAMO Problems and Solutions]]
 
*[http://www.artofproblemsolving.com/Forum/resources.php?c=182&cid=27&year=2006 USAMO 2006 Problems on the Resources Page]
 
*[http://www.artofproblemsolving.com/Forum/resources.php?c=182&cid=27&year=2006 USAMO 2006 Problems on the Resources Page]
Line 41: Line 41:
 
*[http://www.unl.edu/amc/e-exams/e8-usamo/e8-1-usamoarchive/2006-ua/2006usamoS.pdf USAMO 2006 Solutions Document]
 
*[http://www.unl.edu/amc/e-exams/e8-usamo/e8-1-usamoarchive/2006-ua/2006usamoS.pdf USAMO 2006 Solutions Document]
  
{{USAMO newbox|year=2006|before=[[2005 USAMO]]|after=2007 USAMO}}
+
{{USAMO newbox|year=2006|before=[[2005 USAMO]]|after=[[2007 USAMO]]}}

Revision as of 15:27, 16 April 2009

Day 1

Problem 1

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\lbrace\frac{sm}{p}\right\rbrace<\left\lbrace\frac{sn}{p}\right\rbrace<\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 $\lbrace x\rbrace=x-\lfloor x\rfloor$ denote the fractional part of $x$.

Solution

Problem 2

For a given positive integer $k$ find, in terms of $k$, the minimum value of $N$ for which there is a set of $2k+1$ distinct positive integers that has sum greater than $N$ but every subset of size $k$ has sum at most $N/2$.

Solution

Problem 3

For integral $m$, let $p(m)$ be the greatest prime divisor of $m$. By convention, we set $p(\pm1)=1$ and $p(0)=\infty$. Find all polynomials $f$ with integer coefficients such that the sequence $\lbrace p(f(n^2))-2n\rbrace_{n\ge0}$ is bounded above. (In particular, this requires $f(n^2)\neq0$ for $n\ge0$.)

Solution

Day 2

Problem 4

Find all positive integers $n$ such that there are $k\ge 2$ positive rational numbers $a_1,a_2,\ldots a_k$ satisfying $a_1+a_2+\ldots+a_k=a_1\cdot a_2\cdots a_k=n$.

Solution

Problem 5

A mathematical frog jumps along the number line. The frog starts at 1, and jumps according to the following rule: if the frog is at integer $n$, then it can jump either to $n+1$ or to $n+2^{m_n+1}$ where $2^{m_n}$ is the largest power of 2 that is a factor of $n$. Show that if $k\ge2$ is a positive integer and $i$ is a nonnegative integer, then the minimum number of jumps needed to reach $2^ik$ is greater than the minimum number of jumps needed to reach $2^i$.

Solution

Problem 6

Let $ABCD$ be a quadrilateral, and let $E$ and $F$ be points on sides $AD$ and $BC$, respectively, such that $AE/ED=BF/FC$. Ray $FE$ meets rays $BA$ and $CD$ at $S$ and $T$ respectively. Prove that the circumcircles of triangles $SAE$, $SBF$, $TCF$, and $TDE$ pass through a common point.

Solution

Resources

2006 USAMO (ProblemsResources)
Preceded by
2005 USAMO
Followed by
2007 USAMO
1 2 3 4 5 6
All USAMO Problems and Solutions
Invalid username
Login to AoPS