Difference between revisions of "2018 USAMO Problems"
(→Problem 2) |
(→Problem 3) |
||
Line 15: | Line 15: | ||
Solution | Solution | ||
− | ==Problem 3== | + | ===Problem 3=== |
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> | ||
Solution | Solution | ||
− | |||
==Day 2== | ==Day 2== |
Revision as of 10:41, 21 April 2018
Contents
[hide]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 be positive real numbers such that . Prove that
Solution
Problem 2
Find all functions such that
for all with
Solution
Problem 3
For a given integer let be the set of positive integers less than that are relatively prime to Prove that if every prime that divides also divides then is divisible by for every positive integer
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 be a prime, and let be integers. Show that there exists an integer such that the numbers produce at least distinct remainders upon division by .
Solution
Problem 5
In convex cyclic quadrilateral we know that lines and intersect at lines and intersect at and lines and intersect at Suppose that the circumcircle of intersects line at and , and the circumcircle of intersects line at and , where and are collinear in that order. Prove that if lines and intersect at , then
Solution
Problem 6
Let be the number of permutations of the numbers such that the ratios for are all distinct. Prove that is odd for all
Solution