Question 16

Number Theory Level pending

Let A = 111111 A=111111 and let B = 142857. B=142857. Find the smallest positive integer N N such that N N is the multiplicative inverse of A B mod 1 , 000 , 000. AB\text{ mod }1,000,000.


The answer is 63.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Michael Diao
Jun 25, 2014

Notice that 7 B = 999 , 999 1 ( m o d 1 , 000 , 000 ) 7B=999,999 \equiv -1 \pmod{1,000,000} . Thus, by modular arithmetic,

999 , 999 × 7 B 111 , 111 \frac{999,999\times 7B}{111,111}

is what we desire.

The expression turns out to cancel nicely, and we are left with

63 . \boxed{63}.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...