All Tracks>Math> Number Theory> Basic Number Theory-1> Problem
Calculations with Modulo
★★★★★

3.8

5 votes
multiplicative inverse, gcd, Modular arithmetic, Greatest common divisor, Easy, Modular exponentiation, Mathematics, Greatest common divisor, Number theory
The Editorial is locked. In order to qualify for points, you need to solve the problem without unlocking the editorial.
Are you sure you want to unlock the tab?
Unlock it

?