Difference between revisions of "2018 USAMO Problems/Problem 3"

(Created page with "==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...")
 
(Solution: add boilerplate)
Line 4: Line 4:
  
 
==Solution==
 
==Solution==
 +
{{Solution}}
 +
 +
{{MAA Notice}}
 +
 +
{{USAMO newbox|year=2018|num-b=2|num-a=4}}

Revision as of 09:39, 27 August 2023

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

This problem needs a solution. If you have a solution for it, please help us out by adding it.

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

2018 USAMO (ProblemsResources)
Preceded by
Problem 2
Followed by
Problem 4
1 2 3 4 5 6
All USAMO Problems and Solutions