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

(→‎Problem 2)
(→‎Problem 3)
Line 18: Line 18:
 
For a given integer <math>n\ge 2,</math> let <math>\{a_1,a_2,…,a_m\}</math> be the set of positive integers less than <math>n</math> that are relatively prime to <math>n.</math> Prove that if every prime that divides <math>m</math> also divides <math>n,</math> then <math>a_1^k+a_2^k + \dots + a_m^k</math> is divisible by <math>m</math> for every positive integer <math>k.</math>
 
For a given integer <math>n\ge 2,</math> let <math>\{a_1,a_2,…,a_m\}</math> be the set of positive integers less than <math>n</math> that are relatively prime to <math>n.</math> Prove that if every prime that divides <math>m</math> also divides <math>n,</math> then <math>a_1^k+a_2^k + \dots + a_m^k</math> is divisible by <math>m</math> for every positive integer <math>k.</math>
  
−
[[2018 USAJMO Problems/Problem 3|Solution]]
+
[[2018 USAMO Problems/Problem 3|Solution]]
  
 
==Day 2==
 
==Day 2==

Revision as of 10:45, 21 April 2018

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

Let $a,b,c$ be positive real numbers such that $a+b+c=4\sqrt[3]{abc}$. Prove that \[2(ab+bc+ca)+4\min(a^2,b^2,c^2)\ge a^2+b^2+c^2.\]

Solution

Problem 2

Find all functions $f:(0,\infty) \rightarrow (0,\infty)$ such that

\[f\left(x+\frac{1}{y}\right)+f\left(y+\frac{1}{z}\right) + f\left(z+\frac{1}{x}\right) = 1\] for all $x,y,z >0$ with $xyz =1.$

Solution

Problem 3

For a given integer $n\ge 2,$ let $\{a_1,a_2,…,a_m\}$ be the set of positive integers less than $n$ that are relatively prime to $n.$ Prove that if every prime that divides $m$ also divides $n,$ then $a_1^k+a_2^k + \dots + a_m^k$ is divisible by $m$ for every positive integer $k.$

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$ be a prime, and let $a_1, \dots, a_p$ be integers. Show that there exists an integer $k$ such that the numbers \[a_1 + k, a_2 + 2k, \dots, a_p + pk\]produce at least $\tfrac{1}{2} p$ distinct remainders upon division by $p$.

Solution

Problem 5

In convex cyclic quadrilateral $ABCD,$ we know that lines $AC$ and $BD$ intersect at $E,$ lines $AB$ and $CD$ intersect at $F,$ and lines $BC$ and $DA$ intersect at $G.$ Suppose that the circumcircle of $\triangle ABE$ intersects line $CB$ at $B$ and $P$, and the circumcircle of $\triangle ADE$ intersects line $CD$ at $D$ and $Q$, where $C,B,P,G$ and $C,Q,D,F$ are collinear in that order. Prove that if lines $FP$ and $GQ$ intersect at $M$, then $\angle MAC = 90^{\circ}.$

Solution

Problem 6

Let $a_n$ be the number of permutations $(x_1, x_2, \dots, x_n)$ of the numbers $(1,2,\dots, n)$ such that the $n$ ratios $\frac{x_k}{k}$ for $1\le k\le n$ are all distinct. Prove that $a_n$ is odd for all $n\ge 1.$

Solution

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