Question 1000100
Question 1000100
1. f : R → R: f(x) = x3 is [1]
c) symmetric, transitive but not reflexive d) reflexive, transitive but not symmetric
3. The relation R = {1, 1), (2, 2), (3, 3)} on the set {1, 2, 3) is [1]
c) transitive d) reflexive
5. Which of the following functions from Z into Z are bijections? [1]
a) f (x) = x3 b) f (x) = 2x + 1
c) f (x) = x + 2 d) f (x) = x2 + 1
6. Show that the function f: R → R, defined as f(x) = x2 , is neither one-one nor onto. [2]
x−3
. .Is f one – one and [2]
onto.
11. Show that the relation in the set R of real no. defined R = {(a, b) : a<b2}, is neither reflexive nor symmetric nor [3]
transitive.
12. If A = {1, 2, 3, ... , 9} and R is the relation in A × A defined by (a, b) R (c, d), if a + d = b + c for (a, b), (c, d) in [3]
A × A. Prove that R is an equivalence relation. Also, obtain the equivalence class [(2, 5)].
x
is one-one and onto, where R+ is the set of all non- [3]
zero real numbers. Is the result true, if the domain R+ is replaced by N with co-domain being same as R+?
1/2
15. Show that the relation R = {(a, b): a > b} on N is transitive but neither reflexive nor symmetric. [3]
16. Show that the relation R in the set A = {1, 2, 3, 4, 5} given by R = {(a, b) : |a - b| is even}, is an equivalence [5]
relation. Show that all the elements of {1, 3, 5} are related to each other and all the elements of {2, 4} are related
to each other. But no element of {1, 3, 5} is related to any element of {2, 4}.
17. Let R be a relation on N × N , defined by (a, b) R (c, d) ⇔ a + d = b + c for all (a, b), (c, d) ∈ N × N . Show [5]
that R is an equivalence relation.
18. Show that the function f : R - {3} → R - {1} given by f(x) is a bijection. [5]
x−2
=
x−3
19. Let f : W → W be defined as f(n) = n - 1, if n is odd and f(n) = n + 1, if n is even. Show that f is invertible. Find [5]
the inverse of f. Here, W is the set of all whole numbers.
2/2