Scribd
Upload
19 views3 pages

CHAPTER-1-Relations & Functions

Uploaded by

ankitnwp1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
19 views3 pages

CHAPTER-1-Relations & Functions

Uploaded by

ankitnwp1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Chap 1: Relations and Functions

1. Check whether the relation R on R defined by is reflexive,


symmetric or transitive.
2. Let R be a relation defined on the set of natural numbers N as

. Find the domain and range of R. Also, verify


whether R is
i. Reflexive,
ii. Symmetric
iii. Transitive.
3. Show that the relation R on the set A = {1, 2, 3, 4, 5}, given by

is an equivalence 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}.

4. Show that the relation R on the set given by

is an equivalence relation. Find the set of all elements


related to 1 i.e. equivalence class [1].
5. Prove that the relation R on the set defined by
is an equivalence relation. Also,
find the equivalence classes [(2, 3)] and [(1, 3)].
6. Let A = {1, 2, 3,…, 9} and R be the relation on defined by (a, b) R (c, d) if
. Prove that R is an equivalence relation and also
obtain the equivalence class [(2, 5)].
7. Let N denote the set of all natural numbers and R be the relation on defined by
. Check whether R is an equivalence relation on
.
8. Let R be the equivalence relation in the set A = {0, 1, 2, 3, 4, 5} given by
R = {(a, b): 2 divides (a-b)}. Write the equivalence class [0].

9. Show that the relation R defined by is an


equivalence relation.
10. Prove that the relation R on Z defined by is divisible by 5 is an
equivalence relation on Z.

11. If is a relation on N, then write the range of R


12. State the reason for the relation R on the set {1, 2, 3} given by R ={(1, 2), (2, 1)} not to
be transitive.
13. Let be a relation. Find the range of R.

14. Show that the function given by f(x) = ax + b, where is a


bijection.

15. Let be a function. Define a relation R on X given by .


Show that R is an equivalence relation on X.

16. Show that defined by is many-one onto function.

17. Let be defined by . Show that f is a


bijection
18. Let be a function defined as . Show that
is a bijection
19. Consider given by . Show that f is both 1-1 and onto.

20. Let . Consider the function defined by .


Show that f is one-one and onto.
21. If defined by is invertible.

22. What is the range of the function ?


23. Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let f = {(1, 4), (2, 5), (3, 6)} be a function from A to B.
State whether f is one-one or not.
x−3
24. Let A = R – {5} and B = R – {1} .Consider the function defined by f(x) = x−5 .

Show that f is one-one and onto

25. Check whether the relation S in the set of real numbers R defined by S = { (a, b) :
where a – b + √ 2 is an irrational number } is reflexive , symmetric or transitive.
26. Prove that the greatest integer function f : R →R , given by f(x) = [x], is neither one-
one nor onto.
27. Let R be the relation defined in the set A = {1, 2, 3, 4, 5, 6, 7} by R = {(a, b) : both a and
b are either odd or even}. Show that R is an equivalence relation. Hence, find the
elements of equivalence class [1].
28. Let W denote the set of words in the English dictionary. Define the relation R by
R = {(x, y) ∊ W X W such that x and y have at least one letter in common}. Show that this
relation R is reflexive and symmetric, but not transitive.
********************

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