Difference between revisions of "2015 USAMO Problems"

Revision as of 21:47, 12 May 2015

Day 1

Problem 1

Solve in integers the equation $x^2+xy+y^2 = \left(\frac{x+y}{3}+1\right)^3.$

Problem 2

Quadrilateral $APBQ$ is inscribed in circle $\omega$ with $\angle P = \angle Q = 90^{\circ}$ and $AP = AQ < BP$ . Let $X$ be a variable point on segment $\overline{PQ}$ . Line $AX$ meets $\omega$ again at $S$ (other than $A$ ). Point $T$ lies on arc $AQB$ of $\omega$ such that $\overline{XT}$ is perpendicular to $\overline{AX}$ . Let $M$ denote the midpoint of chord $\overline{ST}$ . As $X$ varies on segment $\overline{PQ}$ , show that $M$ moves along a circle.

Solution

Problem 3

Let $S = \{1, 2, ..., n\}$ , where $n \ge 1$ . Each of the $2^n$ subsets of $S$ is to be colored red or blue. (The subset itself is assigned a color and not its individual elements.) For any set $T \subseteq S$ , we then write $f(T)$ for the number of subsets of T that are blue.

Determine the number of colorings that satisfy the following condition: for any subsets $T_1$ and $T_2$ of $S$ , $f(T_1)f(T_2) = f(T_1 \cup T_2)f(T_1 \cap T_2).$

Day 2

Problem 4

Steve is piling $m\geq 1$ indistinguishable stones on the squares of an $n\times n$ grid. Each square can have an arbitrarily high pile of stones. After he finished piling his stones in some manner, he can then perform stone moves, defined as follows. Consider any four grid squares, which are corners of a rectangle, i.e. in positions $(i, k), (i, l), (j, k), (j, l)$ for some $1\leq i, j, k, l\leq n$ , such that $i<j$ and $k<l$ . A stone move consists of either removing one stone from each of $(i, k)$ and $(j, l)$ and moving them to $(i, l)$ and $(j, k)$ respectively,j or removing one stone from each of $(i, l)$ and $(j, k)$ and moving them to $(i, k)$ and $(j, l)$ respectively.

Two ways of piling the stones are equivalent if they can be obtained from one another by a sequence of stone moves.

How many different non-equivalent ways can Steve pile the stones on the grid?

Solution

@@ Line 12: / Line 12: @@
 ===Problem 3===
+Let <math>S = \{1, 2, ..., n\}</math>, where <math>n \ge 1</math>. Each of the <math>2^n</math> subsets of <math>S</math> is to be colored red or blue. (The subset itself is assigned a color and not its individual elements.) For any set <math>T \subseteq S</math>, we then write <math>f(T)</math> for the number of subsets of T that are blue.
+Determine the number of colorings that satisfy the following condition: for any subsets <math>T_1</math> and <math>T_2</math> of <math>S</math>,
+<cmath>f(T_1)f(T_2) = f(T_1 \cup T_2)f(T_1 \cap T_2).</cmath>
 ==Day 2==

Page

Toolbox

Search