USAMO GuideUSAMOGuide
Back to Problems
PrevNext
1800
Order Mod 1000
Editorial
number theorymodular arithmeticmultiplicative ordertotientChinese remainder theorem
Find the smallest positive integer nn such that 7n≡1(mod1000)7^n \equiv 1 \pmod{1000}.

Sign in to submit your answer