Number Theory Trial 1 - P2

Contributed by: bruhmoment

All Submissions
Best Submissions

Difficulty: 9

This problem is tagged with ntt, ntt1.

Find the smallest positive integer $n$ that satisfies $7^n \equiv 1 \pmod{1000}$.

Please login or sign up to submit and check if your answer is correct.

Advertisement


flag Report Content
You should report content if:
  • It may be offensive.
  • There is something wrong with it (statement or difficulty value)
  • It isn't original.
Thanks for keeping the Math Contest Repository a clean and safe environment!

Join the MCR: Sign up or log in to check your answers. Access 1400+ problems from UWaterloo, MAA, & more, participate in our weekly challenges, and take part in our monthly contests to compete with hundreds of others.