Scribd
Upload
21 views5 pages

ADE 12 Relations and Functions WS

The document is a Grade 12 Mathematics worksheet focusing on relations and functions, containing various problems related to reflexivity, transitivity, and equivalence relations. It includes tasks such as proving properties of functions, determining the range of functions, and analyzing specific relations. Additionally, it presents assertions and reasons regarding equivalence relations and mappings between sets.

Uploaded by

akshar.pandey.me
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views5 pages

ADE 12 Relations and Functions WS

The document is a Grade 12 Mathematics worksheet focusing on relations and functions, containing various problems related to reflexivity, transitivity, and equivalence relations. It includes tasks such as proving properties of functions, determining the range of functions, and analyzing specific relations. Additionally, it presents assertions and reasons regarding equivalence relations and mappings between sets.

Uploaded by

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

Meccademia Education Institute

Grade 12: Mathematics Worksheet


Topic- Relations and Functions

1 Let 𝐴𝐴 = {𝑎𝑎, 𝑏𝑏, 𝑐𝑐} and the relation R be defined on A as follows :


𝑅𝑅 = {(𝑎𝑎, 𝑎𝑎), (𝑏𝑏, 𝑐𝑐), (𝑎𝑎, 𝑏𝑏)}.Then, write minimum number of ordered
pairs to be added in R to make R reflexive and transitive.
2 Let the function 𝑓𝑓: 𝑅𝑅 → 𝑅𝑅 be defined by 𝑓𝑓 (𝑥𝑥) = 𝑐𝑐𝑐𝑐𝑐𝑐 𝑥𝑥, ∀ 𝑥𝑥 ∈ 𝑅𝑅.
Show that 𝑓𝑓 is neither one-one nor onto.
1
3 Let 𝑓𝑓: 𝑅𝑅 → 𝑅𝑅 be the function defined by 𝑓𝑓(𝑥𝑥) = ∀ 𝑥𝑥 ∈
(2 – 𝑐𝑐𝑐𝑐𝑐𝑐 𝑥𝑥)
𝑅𝑅. Then, find the range of f. Let n be a fixed positive integer.
4 Let n be a fixed positive integer. Define a relation R in Z as follows: ∀
𝑎𝑎, 𝑏𝑏 ∈ 𝑍𝑍, 𝑎𝑎𝑎𝑎𝑎𝑎 if and only if a – b is divisible by n. Show that R is an
equivalance relation.
5 x–2
Let 𝐴𝐴 = 𝑅𝑅 − {3}, 𝐵𝐵 = 𝑅𝑅 − {1}. 𝐿𝐿𝐿𝐿𝐿𝐿 𝑓𝑓: 𝐴𝐴 → 𝐵𝐵 be defined by 𝑓𝑓(𝑥𝑥) =
x–3
∀ x ∈ A. Then show that 𝑓𝑓 is bijective.
6 Let 𝐴𝐴 = {1, 2, 3, … 9} and R be the relation in A ×A defined by
(𝑎𝑎, 𝑏𝑏) 𝑅𝑅 (𝑐𝑐, 𝑑𝑑) if 𝑎𝑎 + 𝑑𝑑 = 𝑏𝑏 + 𝑐𝑐 𝑓𝑓𝑓𝑓𝑓𝑓 (𝑎𝑎, 𝑏𝑏), (𝑐𝑐, 𝑑𝑑) in 𝐴𝐴 × 𝐴𝐴. Prove that
𝑅𝑅 is an equivalence relation and obtain the equivalent class [(2, 5)].
7 Check whether the relation 𝑅𝑅 on 𝑅𝑅 defined as 𝑅𝑅 = {(𝒂𝒂, 𝒃𝒃): 𝒂𝒂 ≤ 𝒃𝒃3 } is
reflexive, symmetric or transitive.
8 Let 𝑅𝑅 be a relation on the set A of ordered pair of integers defined by
(𝑥𝑥, 𝑦𝑦)𝑅𝑅(𝑢𝑢, 𝑣𝑣) 𝑖𝑖𝑖𝑖 𝑥𝑥𝑥𝑥 = 𝑦𝑦𝑦𝑦. Show that 𝑅𝑅 is an equivalence relation.
9 Test whether the following relation R1, R2, and R3 are (i) reflexive (ii)
symmetric and (iii) transitive:
(i) R2 on Z defined by (a, b) ∈ R2 ⇔ |a – b| ≤ 5
(ii) R3 on R defined by (a, b) ∈ R3 ⇔ a2 – 4ab + 3b2 = 0.

10 Prove that the function f: N → N, defined by f(x) = x2 + x + 1, is one-one


but not onto
11 Set A has 3 elements and the set B has 4 elements. Then the number of
injective functions that can be defined from set A to set B is
12 Assertion (A): Given set A = {1, 2, 3, ... 9} and relation R in set A × A
defined by (a, b) R (c, d) if a + d = b + c, be an equivalence relation. The
ordered pair (1, 3) belongs to equivalence class related to
[(5, 3)]

Reason (R): Any ordered pair of A × A belongs to equivalence class


[(5, 3)] if (x, y) R (5, 3) ∀ (x, y) ∈ A × A.

13 Assertion (A): Let R be the relation on the set of integers Z given by R


= {(a, b) : 2 divides (a - b)} is an equivalence relation.

Reason (R): A relation R in a set A is said to be an equivalence relation


if R is reflexive, symmetric and transitive.

14 Let f : N → N be defined by
𝑛𝑛+1
𝑖𝑖𝑖𝑖 𝑛𝑛 𝑖𝑖𝑖𝑖 𝑜𝑜𝑜𝑜𝑜𝑜
f(x) = � 𝑛𝑛2
𝑖𝑖𝑖𝑖 𝑛𝑛 𝑖𝑖𝑖𝑖 𝑒𝑒𝑒𝑒𝑒𝑒𝑒𝑒
2
For all n ∈ N, state whether the function f is bijective. Justify your
answer.
15 Show that the modulus function f : R → R given by f (x) = |x|, is neither
one-one nor onto, where |x| is x, if x is positive or 0 and
|x| is –x, if x is negative.
16 Show that the function f :R→ {x ∈ R : −1 < 𝑥𝑥 < 1} defined by f( x) =
𝑥𝑥
,x ∈ R is one-one and onto function.
1+|𝑥𝑥|
17 Students of Grade 9, planned to plant saplings along straight lines,
parallel to each other to one side of the playground ensuring that they
had enough play area. Let us assume that they planted one of the rows
of the saplings along the line y = x – 4.

Let L be the set of all lines which are parallel on the ground and R be a
relation on L.

(i) Let relation R be defined by R = {(L1, L2): L1 || L2 where L1, L2 ∈


L}.What is the type of relation R?
(ii) (a) Check whether the function f : R → R defined by f(x) = x – 4 is
bijective or not.
18 Let N denote the set of all natural numbers and R be the relation on N
× N defined by (a, b) R (c, d) if ad (b + c) = bc(a + d). Show that R is an
equivalence relation.
19 A general election of Lok Sabha is a gigantic exercise. About 911
million people were eligible to vote and voter turnout was about 67%,
the highest ever Let I be the set of all citizens of India who were
eligible to exercise their voting right in general election held in2024 .

A relation ‘R’ is defined on I as follows: R = {(V1, V2) : V1, V2 ∈ I and


both use their voting right in general election – 2024}
(i) Two neighbours X and Y ∈ I. X exercised his voting right while Y did
not cast her vote in general election-2024. Check whether X is related
to Y or not.
(ii) Mr. ‘X’ and his wife ‘W’ both exercised their voting right in general
election-2024. Show that (X, W) ∈ R and (W, X) ∈ R.
(iii) Three friends F1, F2 and F3 exercised their voting right in general
election-2024. Show that (F1, F2) ∈ R, (F2, F3) ∈ R and
(F1, F3) ∈ R.
OR
(iii) Show that the relation R defined on set I is an equivalence
relation.
20 An organization conducted bike race under two different categories-
Boys and Girls. There were 28 participants in all. Among all of them,
finally three from category 1 and two from category 2 were selected
for the final race. Ravi forms two sets B and G with these participants
for his college project. Let B = {b1, b2, b3} and G = {g1, g2}, where B
represents the set of Boys selected and G the set of Girls selected for
the final race.
Based on the above information, answer the following questions:
(i) How many relations are possible from B to G ? (1)
(ii) Among all the possible relations from B to G, how many functions
can be formed from B to G ? (1)
(iii) Let R : B → B be defined by R = {(x, y) : x and y are students of the
same sex}. Check if R is an equivalence relation. (2)
OR
(iii) A function f : B → G be defined by

21 If set A contains 5 elements and the set B contains 6 elements, then


the number of one-one and onto mappings from A to B is
(a) 720 (b) 120 (c) 0 (d) none of
these

22 Let A = {1, 2, 3} and consider the relation R = {1, 1), (2, 2), (3, 3), (1,
2), (2, 3), (1,3)}. Then R is

(a) reflexive but not symmetric (b) reflexive but not transitive
(c) symmetric and transitive (d) neither symmetric, nor
transitive

23 Set A has 3 elements, and set B has 4 elements. Then the number of
injective mappings that can be defined from A to B is
(a) 144 (b) 12 (c) 24 (d) 64
24 The maximum number of equivalence relations on the set A ={1, 2, 3}
are
(a) 1 (b) 2 (c) 3 (d) 5

25 If R = {(x, y) : x + 2y = 8} is a relation on N, then range of R is

(a) {3} (b) {1, 2, 3} (c) {1, 2, 3, .... 8} (d) {1, 2}

You might also like