Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2015 USAMO Problems"

(→‎Problem 3)
m
 
(10 intermediate revisions by 8 users not shown)
Line 16: Line 16:
 
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>,
 
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>
 
<cmath>f(T_1)f(T_2) = f(T_1 \cup T_2)f(T_1 \cap T_2).</cmath>
 +
 +
[[2015 USAMO Problems/Problem 3|Solution]]
  
 
==Day 2==
 
==Day 2==
Line 21: Line 23:
 
===Problem 4===
 
===Problem 4===
  
−
Steve is piling <math>m\geq 1</math> indistinguishable stones on the squares of an <math>n\times n</math> 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 <math>(i, k), (i, l), (j, k), (j, l)</math> for some <math>1\leq i, j, k, l\leq n</math>, such that <math>i<j</math> and <math>k<l</math>. A stone move consists of either removing one stone from each of <math>(i, k)</math> and <math>(j, l)</math> and moving them to <math>(i, l)</math> and <math>(j, k)</math> respectively,j or removing one stone from each of <math>(i, l)</math> and <math>(j, k)</math> and moving them to <math>(i, k)</math> and <math>(j, l)</math> respectively.
+
Steve is piling <math>m\geq 1</math> indistinguishable stones on the squares of an <math>n\times n</math> 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 <math>(i, k), (i, l), (j, k), (j, l)</math> for some <math>1\leq i, j, k, l\leq n</math>, such that <math>i<j</math> and <math>k<l</math>. A stone move consists of either removing one stone from each of <math>(i, k)</math> and <math>(j, l)</math> and moving them to <math>(i, l)</math> and <math>(j, k)</math> respectively, or removing one stone from each of <math>(i, l)</math> and <math>(j, k)</math> and moving them to <math>(i, k)</math> and <math>(j, l)</math> respectively.
  
 
Two ways of piling the stones are equivalent if they can be obtained from one another by a sequence of stone moves.
 
Two ways of piling the stones are equivalent if they can be obtained from one another by a sequence of stone moves.
Line 30: Line 32:
  
 
===Problem 5===
 
===Problem 5===
 +
Let <math>a, b, c, d, e</math> be distinct positive integers such that <math>a^4 + b^4 = c^4 + d^4 = e^5</math>. Show that <math>ac + bd</math> is a composite number.
 +
 +
[[2015 USAMO Problems/Problem 5|Solution]]
  
 
===Problem 6===
 
===Problem 6===
 +
Consider <math>0<\lambda<1</math>, and let <math>A</math> be a multiset of positive integers. Let <math>A_n=\{a\in A: a\leq n\}</math>. Assume that for every <math>n\in\mathbb{N}</math>, the set <math>A_n</math> contains at most <math>n\lambda</math> numbers. Show that there are infinitely many <math>n\in\mathbb{N}</math> for which the sum of the elements in <math>A_n</math> is at most <math>\frac{n(n+1)}{2}\lambda</math>. (A multiset is a set-like collection of elements in which order is ignored, but repetition of elements is allowed and multiplicity of elements is significant. For example, multisets <math>\{1, 2, 3\}</math> and <math>\{2, 1, 3\}</math> are equivalent, but <math>\{1, 1, 2, 3\}</math> and <math>\{1, 2, 3\}</math> differ.)
 +
 +
[[2015 USAMO Problems/Problem 6|Solution]]
 +
 +
{{USAMO newbox|year=2015|before=[[2014 USAMO Problems]]|after=[[2016 USAMO Problems]]}}
 +
 +
 +
{{MAA Notice}}

Latest revision as of 12:49, 22 November 2023

Day 1

Problem 1

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

Solution

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).\]

Solution

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, 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

Problem 5

Let $a, b, c, d, e$ be distinct positive integers such that $a^4 + b^4 = c^4 + d^4 = e^5$. Show that $ac + bd$ is a composite number.

Solution

Problem 6

Consider $0<\lambda<1$, and let $A$ be a multiset of positive integers. Let $A_n=\{a\in A: a\leq n\}$. Assume that for every $n\in\mathbb{N}$, the set $A_n$ contains at most $n\lambda$ numbers. Show that there are infinitely many $n\in\mathbb{N}$ for which the sum of the elements in $A_n$ is at most $\frac{n(n+1)}{2}\lambda$. (A multiset is a set-like collection of elements in which order is ignored, but repetition of elements is allowed and multiplicity of elements is significant. For example, multisets $\{1, 2, 3\}$ and $\{2, 1, 3\}$ are equivalent, but $\{1, 1, 2, 3\}$ and $\{1, 2, 3\}$ differ.)

Solution

2015 USAMO (Problems • Resources)
Preceded by
2014 USAMO Problems 		Followed by
2016 USAMO Problems
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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2015_USAMO_Problems&oldid=205239"