Number Theory · Chapter 4 of 11
Modular arithmetic
12 curated · 6 from open sources · 196.6 million generated
Practice
196.6 millionEndless problems made on demand, each with an exactly computed answer. Every click is a new one.
Curated
12| # | Title | Difficulty | Source | Tags | |
|---|---|---|---|---|---|
| 579 | A big power mod fiveModular arithmetic | Easy | Lemma | ||
| 580 | A linear congruenceModular arithmetic | Easy | Lemma | ||
| 581 | Two remainders at onceModular arithmetic | Easy | Lemma | ||
| 582 | Last digit of a power of threeModular arithmetic | Easy | Lemma | ||
| 585 | Squares mod sevenModular arithmetic | Easy | Lemma | ||
| 61 | One more than a common multipleRemainders | Medium | Lemma | ||
| 583 | Fermat's little theoremModular arithmetic | Medium | Lemma | ||
| 584 | Wilson's theoremModular arithmetic | Medium | Classical | ||
| 1368 | Remainders with 39 and 56Modular arithmetic | Medium | Hall & Knight | ||
| 1785 | General form of remaindersModular arithmetic | Medium | Hall & Knight | ||
| 1786 | Smallest integers with given remaindersModular arithmetic | Medium | Hall & Knight | ||
| 59 | A giant power, tamedModular arithmetic | Deep | Lemma |
From open sources
6Showing everything, including problems with no answer to check, a missing figure, or a near-copy elsewhere. Show only complete problems
| # | Title | Difficulty | |
|---|---|---|---|
| 128015 | Clock Arithmetic · Example 1 | Easy | |
| 128016 | Clock Arithmetic · Example 2 | Easy | |
| 128018 | Clock Arithmetic · Example 4 | Easy | |
| 128019 | Clock Arithmetic · Example 5 | Easy | |
| 128020 | Clock Arithmetic · Example 6 | Easy | |
| 128017 | Clock Arithmetic · Example 3 | Easy |