Review MAT102

Download as pdf or txt
Download as pdf or txt
You are on page 1of 6

MAT102H5 - Introduction to Mathematical Proofs

Practice for the final Exam

This is only for more practice. The exam questions are not
similar or the same pattern. Some of the questions here will
be answered during the exam jam on Tuesday, April 11 .

1

1. If x is a real number such that x ≥ 0, prove that 2x ≤ 1 + x2 .

2. Find all real values of c, for them the equation cx2 + x − c = 0


(c 6= 0) has two distinct solutions.

3. Find all real numbers c for them the equation x2 − (c + 1)x + 1 = 0


has no real answer.

4. (a) Prove for any non-negative real numbers A and B we have


(A + B)2 ≥ A2 + B 2 .
(b) If x, y and z are three non-neagtive real numbers and x+y ≥ 5,
2
show that (x+y+z)
2 ≥ 5z.

5. If A, B and C are three sets, prove that A × (B ∪ C) = (A × B) ∪


(A × C).

6. The set R2 = R×R with the following addition and multiplication


is a field.

(a, b) + (c, d) = (a + c, b + d)
(a, b).(c, d) = (ac − bd, ad + bc)

Prove that the multiplication identity is (1, 0). Also prove that
the multiplicative inverse of (1, 1) is ( 21 , − 21 ).

2
7. Let f and g be the following two functions.
(
f :Z→Z×N
f (n) = (−n, n2 + 1)

and
(
g :Z×N→Q
n
g(n, m) = m

Find the formula for the composition g ◦ f and show that g ◦ f is


injective.

8. Write the negation of the following without using ¬ , , ≮ and ;


. You do not need to explain.

(∀x ∈ R)(∀y ∈ R)[((x + y ≤ 7) ∧ (xy = x)) ⇒ (x < 7)]

9. If P is false, Q is false, and R is true, is the statement [P ∧(¬Q)] ⇒


(R ∨ Q) true or false? Justify your answer.

10. Show that for any two real numbers x and y, we have 2xy ≤
2 2 3 2
3 x + 2 y . Note that there is no assumption that x or y are non-
negative.


11. Consider the set F = {a+b 5 where a, b ∈ Q} , with the following
addition and multiplication:
√ √ √
(a + b 5) + (c + d 5) = (a + c) + (b + d) 5

3
√ √ √
(a + b 5).(c + d 5) = (ac + 5bd) + (ad + bc) 5

Prove that the additive identity is 0, and the multiplicative iden-


tity is 1.

12. Express the following statement using only logic symbols: “ Every
integer is a sum of two integers”. You do not need to explain.

13. Write the negation of the following statement without using the
negation symbol ¬. You do not need to explain.

(∀x ∈ R)(∃y ∈ R)[(x + y)2 = x2 + y 2 ]

14. Use contrapositive to prove the following statement.


Let x ∈ R. If x3 + 5x = 40, then x < 3.

15. Let f : R → R and g : R → R be two functions. If f is strictly


increasing and g is strictly decreasing, what can we say about f ◦g
? Is it strictly increasing or strictly decreasing or neither?

16. True or false? Justify your answer.


Let f : A ∪ B → C be a function. If A ∩ B = ∅, and the restriction
of f to A is injective, also the restriction of f on B is injective,
then f : A ∪ B → C is an injective function.

17. Let (xn ) be a sequence given by the following recursion formula:


x1 = 3 , x2 = 7 and xn+1 = 5xn − 6xn−1 for n ≥ 2 .
Prove that for all n ∈ N, xn = 2n + 3n−1 .

4
18. Prove that for any even number n ∈ N, 23n−1 + 5.3n is divisible by
11.

19. Use Euclidean Algorithm to compute the GCD of 24 and 54 + 247 .


Also express the GCD as an integer linear combination of the two
numbers.

20. Let f : R \ {0} → (−∞, −2] ∪ [2, ∞) defined by f (x) = x + x1 ,


show that f is surjective. Is f injective? Why?

21. True or false? Justify your answer.


Let A and B be two distinct sets. If A and B are uncountable and
infinite, then (A \ B) ∪ (B \ A) is uncountable and infinite too.

22. True or false? Justify your answer.


Let A and B be two sets. P(A × B) = P(A) × P(B).

23. Consider the equivalence class relation congruence mod 7, on the


set of integers.
(a) Describe the equivalence class of 33.
(b) How many different equivalence classes are there in the rela-
tion?
(c) Which a ∈ Z satisfy the condition [a] = [15]? Explain.

24. What is the unit (ie. the rightmost) digit of 937 ?

25. (a) Let f : A → B be an arbitrary function. Prove that the

5
relation:
x ∼ y if and only if f (x) = f (y) on set A, is an equivalence
relation.
(b) Prove that f is injective if and only if any class under the
above equivalence relation has only one element.
(c) If f : R → [−1, 1] with f (x) = sin(x), describe the equivalence
class of 0, [0] under the above relation.

26. For each one of the following sets, decide if the set is countable,
uncountable or finite.
(a) Q × Q
(b) R \ { n+1
n : n ∈ Z, n 6= 0}
(c) P(Q)
(d) N ∪ (−∞, 9]

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy