Professional Documents
Culture Documents
Bài tập Kiến thức chuẩn bị
Bài tập Kiến thức chuẩn bị
PROOF We prove only part 1. The remaining parts are left as ex-
ercises (Exercise 55). Let a ∈ A. Then (γ(βα))(a) = γ((βα)(a)) =
γ(β(α(a))). On the other hand, ((γβ)α)(a) = (γβ)(α(a)) =
γ(β(α(a))). So, γ(βα) = (γβ)α.
It is useful to note that if α is one-to-one and onto, the function
α−1 described in part 4 of Theorem 0.8 has the property that if
α(s) = t, then α−1 (t) = s. That is, the image of t under α−1 is the
unique element s that maps to t under α. In effect, α−1 “undoes”
what α does.
Exercises
I was interviewed in the Israeli Radio for five minutes and I said that more
than 2000 years ago, Euclid proved that there are infinitely many primes.
Immediately the host interrupted me and asked: “Are there still infinitely
many primes?”
Noga Alon
1. For n = 5, 8, 12, 20, and 25, find all positive integers less
than n and relatively prime to n.
22 Integers and Equivalence Relations
2. Determine
a. gcd(2,10) lcm(2,10)
b. gcd(20,8) lcm(20,8)
c. gcd(12,40) lcm(12,40)
d. gcd(21,50) lcm(21,50)
e. gcd(p2 q 2 , pq 3 ) lcm(p2 q 2 , pq 3 ) where p and q are distinct
primes
3. Determine 51 mod 13, 342 mod 85, 62 mod 15, 10 mod 15,
(82·73) mod 7, (51+68) mod 7, (35·24) mod 11, and (47+68)
mod 11.
4. Find integers s and t such that 1 = 7 · s + 11 · t. Show that
s and t are not unique.
5. Prove that every integer that is a common multiple of every
member of a finite set of integers is a multiple of the least
common multiple of those integers.
6. Prove that for any three consecutive integers n, n + 1, n + 2
one must be divisible by 3.
7. Show that if a and b are positive integers, then ab =
lcm(a, b) · gcd(a, b).
8. Suppose a and b are integers that divide the integer c. If a
and b are relatively prime, show that ab divides c. Show, by
example, that if a and b are not relatively prime, then ab
need not divide c.
9. If a and b are integers and n is a positive integer, prove that
a mod n = b mod n if and only if n divides a − b.
10. Let d = gcd(a, b). If a = da′ and b = db′ , show that
gcd(a′ , b′ ) = 1.
11. Let n be a fixed positive integer greater than 1. If a mod
n = a′ and b mod n = b′ , prove that (a+b) mod n = (a′ +b′ )
mod n and (ab) mod n = (a′ b′ ) mod n. (This exercise is
referred to in Chapters 6, 8, 10, and 15.)
12. Let a and b be positive integers and let d = gcd(a, b) and
m = lcm(a, b). If t divides both a and b, prove that t divides
d. If s is a multiple of both a and b, prove that s is a multiple
of m.
13. Let n and a be positive integers and let d = gcd(a, n). Show
that the equation ax mod n = 1 has a solution if and only
0 | Preliminaries 23
Computer Exercises
Computer exercises for this chapter are available at the website:
http://www.d.umn.edu/∼jgallian