Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

number theory senior

Problem

Let and Find a positive integer with six or fewer digits such that is the multiplicative inverse of modulo 1,000,000.
Solution
We notice that both and are factors of 999,999. Specifically and Taken modulo 1,000,000 these equations read We are set if we multiply these equations: so is the multiplicative inverse to modulo 1,000,000.
Final answer
63