Elementary Number Theory
Divisibility, Euclid's division lemma, and greatest common divisor and least common multiple, worked out on explicit integer pairs such as gcd(42, 231).
A Complete Introduction to Abstract Algebra, Elementary Number Theory
18 exercises
Exercise 1
Express in the form , where and are positive integers with .
Exercise 2
Find .
Exercise 3
Find .
Exercise 4
Suppose and . Let .
-
Find .
-
Hence find .
-
Find two integers and such that .
Exercise 5
Express 44100 as a product of primes.
Exercise 6
Let and .
-
State the value of .
-
Find an where and .
-
If , what is ?
Exercise 7
Explain why .
Exercise 8
Find the last two digits of .
Exercise 9
Find the multiplicative inverse of 123 modulo 5.
Problem 1
Find the positive integer such that and .
Problem 2
Let and be positive integers. If , express in terms of .
Problem 3
Prove that for all non-negative integers .
Problem 4
Show that for all positive integers .
Problem 5
Prove that for all positive integers .
Problem 6
Find all even perfect squares that are not multiples of 4.
Problem 7
Find the last 3 digits of .
Problem 8
Let be an integer.
-
Prove that if is positive, then .
-
Prove that .
Problem 9
Prove 1.31 by using Bézout’s lemma (1.15).
Adapted from A Complete Introduction to Abstract Algebra © 2022–2026 Kan Onn Kit. Licensed under CC BY-SA 4.0. Source: A Complete Introduction to Abstract Algebra. Imported at revision a559e8b.