Difference between revisions of "1997 USAMO Problems"

Revision as of 07:57, 1 July 2011

Problem 1

Let $p_1,p_2,p_3,...$ be the prime numbers listed in increasing order, and let $x_0$ be a real number between $0$ and $1$ . For positive integer $k$ , define

$x_{k}=\begin{cases}0&\text{ if }x_{k-1}=0\\ \left\{\frac{p_{k}}{x_{k-1}}\right\}&\text{ if }x_{k-1}\ne0\end{cases}$

where $\{x\}$ denotes the fractional part of $x$ . (The fractional part of $x$ is given by $x-\lfloor{x}\rfloor$ where $\lfloor{x}\rfloor$ is the greatest integer less than or equal to $x$ .) Find, with proof, all $x_0$ satisfying $0<x_0<1$ for which the sequence $x_0,x_1,x_2,...$ eventually becomes $0$ .

Solution

Problem 2

Let $ABC$ be a triangle, and draw isosceles triangles $BCD, CAE, ABF$ externally to $ABC$ , with $BC, CA, AB$ as their respective bases. Prove that the lines through $A,B,C$ perpendicular to the lines $\overleftrightarrow{EF},\overleftrightarrow{FD},\overleftrightarrow{DE}$ , respectively, are concurrent.

Problem 3

Prove that for any integer $n$ , there exists a unique polynomial $Q$ with coefficients in $\{0,1,...,9\}$ such that $Q(-2)=Q(-5)=n$ .

@@ Line 10: / Line 10: @@
 == Problem 2 ==
 Let <math>ABC</math> be a triangle, and draw isosceles triangles <math>BCD, CAE, ABF</math> externally to <math>ABC</math>, with <math>BC, CA, AB</math> as their respective bases. Prove that the lines through <math>A,B,C</math> perpendicular to the lines <math>\overleftrightarrow{EF},\overleftrightarrow{FD},\overleftrightarrow{DE}</math>, respectively, are concurrent.
+== Problem 3 ==
+Prove that for any integer <math>n</math>, there exists a unique polynomial <math>Q</math> with coefficients in <math>\{0,1,...,9\}</math> such that <math>Q(-2)=Q(-5)=n</math>.

Page

Toolbox

Search

Difference between revisions of "1997 USAMO Problems"

Revision as of 07:57, 1 July 2011

Problem 1

Problem 2

Problem 3