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 "2017 USAMO Problems"

(Created page with "LIIIIIT")
 
m
 
(7 intermediate revisions by 4 users not shown)
Line 1: Line 1:
−
LIIIIIT
+
==Day 1==
 +
 
 +
Note: For any geometry problem whose statement begins with an asterisk (<math>*</math>), the first page of the solution must be a large, in-scale, clearly labeled diagram. Failure to meet this requirement will result in an automatic 1-point deduction.
 +
 
 +
===Problem 1===
 +
Prove that there are infinitely many distinct pairs <math>(a,b)</math> of relatively prime positive integers <math>a > 1</math> and <math>b > 1</math> such that <math>a^b + b^a</math> is divisible by <math>a + b.</math>
 +
 
 +
[[2017 USAMO Problems/Problem 1|Solution]]
 +
 
 +
===Problem 2===
 +
Let <math>m_1, m_2, \ldots, m_n</math> be a collection of <math>n</math> positive integers, not necessarily distinct. For any sequence of integers <math>A = (a_1, \ldots, a_n)</math> and any permutation <math>w = w_1, \ldots, w_n</math> of <math>m_1, \ldots, m_n</math>, define an <math>A</math>-inversion of <math>w</math> to be a pair of entries <math>w_i, w_j</math> with <math>i < j</math> for which one of the following conditions holds:
 +
<cmath>a_i \ge w_i > w_j,</cmath>
 +
<cmath>w_j > a_i \ge w_i,</cmath> or
 +
<cmath>w_i > w_j > a_i.</cmath>
 +
Show that, for any two sequences of integers <math>A = (a_1, \ldots, a_n)</math> and <math>B = (b_1, \ldots, b_n)</math>, and for any positive integer <math>k</math>, the number of permutations of <math>m_1, \ldots, m_n</math> having exactly <math>k</math> <math>A</math>-inversions is equal to the number of permutations of <math>m_1, \ldots, m_n</math> having exactly <math>k</math> <math>B</math>-inversions.
 +
 
 +
[[2017 USAMO Problems/Problem 2|Solution]]
 +
 
 +
===Problem 3===
 +
(<math>*</math>) Let <math>ABC</math> be a scalene triangle with circumcircle <math>\Omega</math> and incenter <math>I</math>. Ray <math>AI</math> meets <math>\overline{BC}</math> at <math>D</math> and meets <math>\Omega</math> again at <math>M</math>; the circle with diameter <math>\overline{DM}</math> cuts <math>\Omega</math> again at <math>K</math>. Lines <math>MK</math> and <math>BC</math> meet at <math>S</math>, and <math>N</math> is the midpoint of <math>\overline{IS}</math>. The circumcircles of  <math>\triangle KID</math> and <math>\triangle MAN</math> intersect at points <math>L_1</math> and <math>L_2</math>. Prove that <math>\Omega</math> passes through the midpoint of either <math>\overline{IL_1}</math> or <math>\overline{IL_2}</math>.
 +
 
 +
[[2017 USAMO Problems/Problem 3|Solution]]
 +
 
 +
==Day 2==
 +
 
 +
Note: For any geometry problem whose statement begins with an asterisk (<math>*</math>), the first page of the solution must be a large, in-scale, clearly labeled diagram. Failure to meet this requirement will result in an automatic 1-point deduction.
 +
 
 +
===Problem 4===
 +
Let <math>P_1</math>, <math>P_2</math>, <math>\dots</math>, <math>P_{2n}</math> be <math>2n</math> distinct points on the unit circle <math>x^2+y^2=1</math>, other than <math>(1,0)</math>. Each point is colored either red or blue, with exactly <math>n</math> red points and <math>n</math> blue points. Let <math>R_1</math>, <math>R_2</math>, <math>\dots</math>, <math>R_n</math> be any ordering of the red points. Let <math>B_1</math> be the nearest blue point to <math>R_1</math> traveling counterclockwise around the circle starting from <math>R_1</math>. Then let <math>B_2</math> be the nearest of the remaining blue points to <math>R_2</math> travelling counterclockwise around the circle from <math>R_2</math>, and so on, until we have labeled all of the blue points <math>B_1, \dots, B_n</math>. Show that the number of counterclockwise arcs of the form <math>R_i \to B_i</math> that contain the point <math>(1,0)</math> is independent of the way we chose the ordering <math>R_1, \dots, R_n</math> of the red points.
 +
 
 +
[[2017 USAJMO Problems/Problem 6|Solution]]
 +
 
 +
===Problem 5===
 +
Let <math>\mathbf{Z}</math> denote the set of all integers. Find all real numbers <math>c > 0</math> such that there exists a labeling of the lattice points <math> ( x, y ) \in \mathbf{Z}^2</math> with positive integers for which:
 +
only finitely many distinct labels occur, and
 +
for each label <math>i</math>, the distance between any two points labeled <math>i</math> is at least <math>c^i</math>.
 +
 
 +
[[2017 USAMO Problems/Problem 5|Solution]]
 +
 
 +
===Problem 6===
 +
Find the minimum possible value of <cmath>\frac{a}{b^3+4}+\frac{b}{c^3+4}+\frac{c}{d^3+4}+\frac{d}{a^3+4}</cmath>given that <math>a</math>, <math>b</math>, <math>c</math>, <math>d</math> are nonnegative real numbers such that <math>a+b+c+d=4</math>.
 +
 
 +
[[2017 USAMO Problems/Problem 6|Solution]]
 +
 
 +
{{MAA Notice}}
 +
 
 +
{{USAMO newbox|year=2017|before=[[2016 USAMO Problems]]|after=[[2018 USAMO Problems]]}}

Latest revision as of 12:49, 22 November 2023

Day 1

Note: For any geometry problem whose statement begins with an asterisk ($*$), the first page of the solution must be a large, in-scale, clearly labeled diagram. Failure to meet this requirement will result in an automatic 1-point deduction.

Problem 1

Prove that there are infinitely many distinct pairs $(a,b)$ of relatively prime positive integers $a > 1$ and $b > 1$ such that $a^b + b^a$ is divisible by $a + b.$

Solution

Problem 2

Let $m_1, m_2, \ldots, m_n$ be a collection of $n$ positive integers, not necessarily distinct. For any sequence of integers $A = (a_1, \ldots, a_n)$ and any permutation $w = w_1, \ldots, w_n$ of $m_1, \ldots, m_n$, define an $A$-inversion of $w$ to be a pair of entries $w_i, w_j$ with $i < j$ for which one of the following conditions holds: \[a_i \ge w_i > w_j,\] \[w_j > a_i \ge w_i,\] or \[w_i > w_j > a_i.\] Show that, for any two sequences of integers $A = (a_1, \ldots, a_n)$ and $B = (b_1, \ldots, b_n)$, and for any positive integer $k$, the number of permutations of $m_1, \ldots, m_n$ having exactly $k$ $A$-inversions is equal to the number of permutations of $m_1, \ldots, m_n$ having exactly $k$ $B$-inversions.

Solution

Problem 3

($*$) Let $ABC$ be a scalene triangle with circumcircle $\Omega$ and incenter $I$. Ray $AI$ meets $\overline{BC}$ at $D$ and meets $\Omega$ again at $M$; the circle with diameter $\overline{DM}$ cuts $\Omega$ again at $K$. Lines $MK$ and $BC$ meet at $S$, and $N$ is the midpoint of $\overline{IS}$. The circumcircles of $\triangle KID$ and $\triangle MAN$ intersect at points $L_1$ and $L_2$. Prove that $\Omega$ passes through the midpoint of either $\overline{IL_1}$ or $\overline{IL_2}$.

Solution

Day 2

Note: For any geometry problem whose statement begins with an asterisk ($*$), the first page of the solution must be a large, in-scale, clearly labeled diagram. Failure to meet this requirement will result in an automatic 1-point deduction.

Problem 4

Let $P_1$, $P_2$, $\dots$, $P_{2n}$ be $2n$ distinct points on the unit circle $x^2+y^2=1$, other than $(1,0)$. Each point is colored either red or blue, with exactly $n$ red points and $n$ blue points. Let $R_1$, $R_2$, $\dots$, $R_n$ be any ordering of the red points. Let $B_1$ be the nearest blue point to $R_1$ traveling counterclockwise around the circle starting from $R_1$. Then let $B_2$ be the nearest of the remaining blue points to $R_2$ travelling counterclockwise around the circle from $R_2$, and so on, until we have labeled all of the blue points $B_1, \dots, B_n$. Show that the number of counterclockwise arcs of the form $R_i \to B_i$ that contain the point $(1,0)$ is independent of the way we chose the ordering $R_1, \dots, R_n$ of the red points.

Solution

Problem 5

Let $\mathbf{Z}$ denote the set of all integers. Find all real numbers $c > 0$ such that there exists a labeling of the lattice points $( x, y ) \in \mathbf{Z}^2$ with positive integers for which: only finitely many distinct labels occur, and for each label $i$, the distance between any two points labeled $i$ is at least $c^i$.

Solution

Problem 6

Find the minimum possible value of \[\frac{a}{b^3+4}+\frac{b}{c^3+4}+\frac{c}{d^3+4}+\frac{d}{a^3+4}\]given that $a$, $b$, $c$, $d$ are nonnegative real numbers such that $a+b+c+d=4$.

Solution

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

2017 USAMO (Problems • Resources)
Preceded by
2016 USAMO Problems 		Followed by
2018 USAMO Problems
1 • 2 • 3 • 4 • 5 • 6
All USAMO Problems and Solutions
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2017_USAMO_Problems&oldid=205237"