Introduction to Number Theory
Divisibility, primes, modular arithmetic and the Euclidean algorithm, examined for their own sake after being used only as counting tools.
Discrete Mathematics: An Open Introduction, Introduction to Number Theory
9 exercises
Exercise 1
Suppose , , and are integers. Prove that if , then .
Exercise 3
Write out the remainder classes for .
Exercise 5
Let , , , and be integers. Prove that if and , then .
Exercise 6
Find the remainder of when divided by
2.
5.
7.
9.
Exercise 8
Determine which of the following congruences have solutions, and find any solutions (between 0 and the modulus) by trial and error.
- .
- .
- .
Exercise 10
Solve the following congruence . That is, describe the general solution.
Exercise 12
Solve the congruence: .
Exercise 14
I'm thinking of a number. If you multiply my number by 7, add 5, and divide the result by 11, you will be left with a remainder of 2. What remainder would you get if you divided my original number by 11?
Exercise 15
Solve the following linear Diophantine equation, using modular arithmetic (describe the general solutions). .
Adapted from Discrete Mathematics: An Open Introduction © 2013–2019 Oscar Levin. Licensed under CC BY-SA 4.0. Source: Discrete Mathematics: An Open Introduction. Imported at revision 1e2e26b.