Mock USAMO by probability1.01 dropped problems

Problem 1

Let $n>1$ be a fixed positive integer, and let $a_1,a_2,\ldots,a_n$ be distinct positive integers. We define $S_k=a_1^k+a_2^k+\cdots+a_n^k$. Prove that there are no distinct positive integers $p,q,r$ for which $S_p,S_q,S_r$ is a geometric sequence.

Reason: The result is somewhat interesting, but no clever or surprising steps are used to solve the problem. Solution

Problem 2

In triangle $ABC$, $AB \not= AC$, let the incircle touch $BC$, $CA$, and $AB$ at $D$, $E$, and $F$ respectively. Let $P$ be a point on $AD$ on the opposite side of $EF$ from $D$. If $EP$ and $AB$ meet at $M$, and $FP$ and $AC$ meet at $N$, prove that $MN$, $EF$, and $BC$ concur.

Reason: The whole incircle business seemed rather artificial. Besides, it wasn't that difficult.

Mock usamo.png


Problem 3

In triangle $ABC$, let $P$ be an interior point. Suppose the circumcircles of $APB$ and $APC$ intersect $BC$ again at $M$ and $N$ respectively. Prove that $PB\cdot AC=PC\cdot AB$ iff $\angle BAM= \angle CAN$.

Reason: This is really easy with inversion. It's also quite hard without ideas from inversion (try to find a way!). Too bad, it was a pretty nice problem otherwise.


Problem 4

Let $ABCD$ be a cyclic quadrilateral. Prove that \[\frac{|AB-CD|}{AB+CD}+\frac{|AD-BC|}{AD+BC}=\frac{|AC-BD|}{AC+BD}.\]

Reason: This problem was interesting but too simple.


Problem 5

Let a sequence $\{a_n\}$ be defined by $a_1=1$ and $a_{n+1}=2a_n+\sqrt{3a_n^2-2}$. Prove that all numbers in the sequence are integers.

Reason: This was actually a pretty good problem, but it was vying for the number 1 or number 4 spot with lots of other problems. Plus, bubala made this one.


Problem 6

In the game of Laser Gun, two players move along the $x$-axis, and a mirror lies along the segment connecting $(0,1)$ and $(2006,1)$. A number of opaque computer-controlled tiles of width 1 unit can slide back and forth along the mirror. Each player tries to shoot a laser at himself by reflecting it off of the mirror, thus scoring a point. The computer moves its opaque tiles to try to block the shots. If the players each move at twice the speed of each tile, then what is the minimum number of tiles needed to ensure that neither player can ever score a point?

Reason: The wording is way too confusing, and the whole shooting yourself thing didn’t do Laser Gun justice. However, if you do actually understand this problem, it's rather interesting.


Invalid username
Login to AoPS