You are on page 1of 1

1. (a) Prove that for every x, y ∈ R, if x + y ≥ 100 then x ≥ 50 or y ≥ 50.

(b) Let x, y ∈ Z.Prove that if a divides b and a divides c then a divides bx + cy.

(c) Let a, b, c, d ∈ Z+ . Prove that if a divides b and c divides d then ac divides bd.

(d) Let a, b and c be positive integers. Prove that if a divides bc then a divides b or
a divides c.

2. Use the principle of mathematical induction to prove the following statements


(a) ni=1 (2i − 1)2 = n(2n−1)(2n=1)
P
3
.

(b) 22n+1 + 1 is divisible by 3.6


0 0
(c) If A1 , A2 , ..., An are subsets of the universal set U , then ( ni=1 Ai ) = ni=1 Ai ,
T S
0
where Ai denotes the complement of the set Ai .

3. (a) Determine gcd(a, b) and express it as a linear combination of a and b, where a = 231 and
b = 1820.

(b) Obtain the congruence classes of integer modulo 5 that is a ≡ b(mod 5), a, b ∈ Z.

4. (a) For each of these relations on the set {1, 2, 3, 4}. Decide whether it is reflexive, symmetric
and transitive. Justify your claims.
R1 = {(2, 2), (2, 3), (2, 4), (3, 2), (3, 3), (3, 4)}
R2 = {(1, 2), (1, 2), (2, 1), (2, 2), (3, 3), (4, 4)}
R3 = {(2, 4), (4, 2)}
R4 = {(1, 3), (1, 4), (2, 3), (2, 4), (3, 1), (3, 4)}

(b) Let R be the relation on the set of ordered pairs of positive integers such that (a, b)R(c, d)
if and only if a + d = b + c. Show that R is an equivalence relation on the positive integers.

5. (a) Prove that following statements, where A, B and C are sets.


0 0 0 0 0
(i) [(A ∩ B) ∪ (A ∩ C)] = (A ∩ B ) ∪ (A ∩ C ).
(ii) (A\B) ∩ (A\C) = A\(B ∪ C).
(iii) (A ⊕ B) = (B ⊕ A).

(b) Show that compound statement [(p ⇒ q) ⇒ r] is logically equivalent to the compound
statement [(p ∨ r) ∧ (q ⇒ r)].
x2 −2
6. (a) Let f : R → R be a function defined by f (x) = x
.
(i) Find the Domain and Range of the function f .
(ii) Show that the function defined above is injective (one-to-one).
(iii) Using the range obatined in (i), find the inverse f −1 of the function.

(b) For each of the following determine the value(s) of the integer n > 1 for which the given
congruence is true
(i) 28 ≡ 6(mod n).
(ii) 68 ≡ 37(mod n).

You might also like