Академический Документы
Профессиональный Документы
Культура Документы
(b) Find (B ∪ A) ∩ C.
Solution: The only element of C which is not in B ∪ A is 31, so
(B ∪ A) ∩ C = {−3, 2, 4, 9}.
(c) Find (B \ A) ∩ C (where X \ Y denotes the set of elements of X
which are not in Y ).
Solution: B \ A = {−5, −4, −2, −1, 1, 2, 4, 5}, so (B \ A) ∩ C =
{2, 4}.
2. Let A, B and C be subsets of a set X. Prove that
(A ∪ B) ∩ C = (A ∩ C) ∪ (B ∩ C).
(A ∪ B) ∩ C ⊆ (A ∩ C) ∪ (B ∩ C).
(A ∪ B) ∩ C ⊇ (A ∩ C) ∪ (B ∩ C).
Combining the two inclusions shows the two sets are equal.
3. Decide which of the following assertions are true for all x, y, z ∈ R. If
false, give a counterexample.
(a) If x2 ≤ y 2 , then x ≤ y.
Solution: False, take x = 0, y = −1.
(b) 0 ≤ x ≤ y ⇒ x2 ≤ y 2 .
Solution: True.
1
(c) x − z ≥ y − z if and only if x ≥ y.
Solution: True.
(d) x ≥ 2 ⇔ x2 ≥ 2x.
Solution: False, take x = −1.
4. Prove by induction that the sum of the first n odd positive squares is
1 3
3 (4n − n), i.e., that
1
1 + 9 + 25 + · · · + (2n − 1)2 = (4n3 − n).
3
Solution: Let P (n) be the equation we need to prove. Then P (1) is
obviously true since 1 = 13 (4 · 13 − 1). Suppose now that n ≥ 1 and
P (n) is true, and we will show that P (n + 1) is true. Adding (2n + 1)2
(the next odd square) to both sides of P (n) gives
1
1 + 9 + 25 + · · · + (2n + 1)2 = 3
3 (4n − n) + (2n + 1)
2
4 3 1 2
= 3 n − 3 n + 4n + 4n + 1
4 3 2 11
= 3 n + 4n + 3 n + 1.
2
6. Use the Euclidean algorithm to find gcd(1066, 2009) and express it in
the form 1066m + 2009n with m, n ∈ Z.
Solution: The Euclidean algorithm gives:
S = { n1 a1 + n2 a2 + · · · + nk ak | n1 , n2 . . . , nk ∈ Z }.
3
have
r = ai − qm
= ai − q(n1 a1 + n2 a2 + · · · + nk ak )
= (−qn1 )a1 + (−qn2 )a2 + · · · + (1 − qni )ai + · · · + (−qnk )ak .
m = n1 a1 + n2 a2 + · · · + nk ak = d(n1 c1 + n2 c2 + · · · + nk ck )