Lemma

Number Theory · Chapter 4 of 11

Modular arithmetic

6 curated · 0 from open sources · 196.6 million generated

← GCD & LCMCongruences →
AllEasyMediumDeep

Practice

196.6 million

Endless problems made on demand, each with an exactly computed answer. Every click is a new one.

Powers modulo nMedium · 196.6 million variations

Curated

6
#TitleDifficultySourceTags
61One more than a common multipleRemaindersMediumLemmaLeast common multipleRemainders
583Fermat's little theoremModular arithmeticMediumLemmaModular arithmetic
584Wilson's theoremModular arithmeticMediumClassicalModular arithmetic
1368Remainders with 39 and 56Modular arithmeticMediumHall & KnightModular arithmeticChinese remainder theorem
1785General form of remaindersModular arithmeticMediumHall & KnightChinese remainder theoremModular arithmetic
1786Smallest integers with given remaindersModular arithmeticMediumHall & KnightChinese remainder theoremModular arithmetic