Latest revision as of 08:24, 14 May 2021

Day 1

Problem 1

(Zuming Feng) Determine all composite positive integers $n$ for which it is possible to arrange all divisors of $n$ that are greater than 1 in a circle so that no two adjacent divisors are relatively prime.

Solution

Problem 2

(Răzvan Gelca) Prove that the system $\begin{align*} x^6+x^3+x^3y+y & = 147^{157} \\ x^3+x^3y+y^2+y+z^9 & = 157^{147} \end{align*}$ has no solutions in integers $x$ , $y$ , and $z$ .

Solution

Problem 3

(Zuming Feng) Let $ABC$ be an acute-angled triangle, and let $P$ and $Q$ be two points on side $BC$ . Construct point $C_1$ in such a way that convex quadrilateral $APBC_1$ is cyclic, $QC_1 \parallel CA$ , and $C_1$ and $Q$ lie on opposite sides of line $AB$ . Construct point $B_1$ in such a way that convex quadrilateral $APCB_1$ is cyclic, $QB_1 \parallel BA$ , and $B_1$ and $Q$ lie on opposite sides of line $AC$ . Prove that points $B_1, C_1,P$ , and $Q$ lie on a circle.

Solution

Day 2

Problem 4

Legs $L_1,L_2,L_3,L_4$ of a square table each have length $n$ , where $n$ is a positive integer. For how many ordered 4-tuples $\left(k_1,k_2,k_3,k_4\right)$ of nonnegative integers can we cut a piece of length $k_i$ from the end of leg $L_i\ (i=1,2,3,4)$ and still have a stable table?

(The table is stable if it can be placed so that all four of the leg ends touch the floor. Note that a cut leg of length 0 is permitted.)

Solution

Problem 5

Let $n$ be an integer greater than 1. Suppose $2n$ points are given in the plane, no three of which are collinear. Suppose $n$ of the given $2n$ points are colored blue and the other $n$ colored red. A line in the plane is called a balancing line if it passes through one blue and one red point and, for each side of the line, the number of blue points on that side is equal to the number of red points on the same side.

Prove that there exist at least two balancing lines.

Solution

Problem 6

For $m$ a positive integer, let $s(m)$ be the sum of the digits of $m$ . For $n\ge 2$ , let $f(n)$ be the minimal $k$ for which there exists a set $S$ of $n$ positive integers such that $s\left(\sum_{x\in X} x\right) = k$ for any nonempty subset $X\subset S$ . Prove that there are constants $0 < C_1 < C_2$ with $C_1 \log_{10} n \le f(n) \le C_2 \log_{10} n.$

Solution

Resources

2005 USAMO (Problems • Resources)
Preceded by 2004 USAMO	Followed by 2006 USAMO
1 • 2 • 3 • 4 • 5 • 6
All USAMO Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.

@@ Line 51: / Line 51: @@
 * [http://www.unl.edu/amc/e-exams/e8-usamo/e8-1-usamoarchive/2005-ua/Solutions/05SOL.pdf 2005 USAMO Solutions]
 * [http://www.artofproblemsolving.com/Forum/resources.php?c=182&cid=27&year=2005 USAMO Problems on the Resources page]
-{{USAMO newbox|year=2005|before=[[2004 USAMO]]|after=2006 USAMO}}
+{{USAMO newbox|year=2005|before=[[2004 USAMO]]|after=[[2006 USAMO]]}}
+{{MAA Notice}}

Page

Toolbox

Search

Difference between revisions of "2005 USAMO Problems"

Latest revision as of 08:24, 14 May 2021

Contents

Day 1

Problem 1

Problem 2

Problem 3

Day 2

Problem 4

Problem 5

Problem 6

Resources