0% found this document useful (0 votes)
34 views15 pages

Asm 111830

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
0% found this document useful (0 votes)
34 views15 pages

Asm 111830

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/ 15

HOLIDAYS HOMEWORK (2024-25)

CLASS: XII
MATHEMATICS

1. MATHS LAB ACTIVITIES


Maths lab activities are to be completed in Maths Lab Manual.
2. Ch-1 Relation and Functions s to be done in assignment note book.

Activity-1

OBJECTIVE
To verify that the relation 𝑅 in the set L of all lines in a plane, defined by

R = {(𝑙, 𝑚): 𝑙 ⊥ 𝑚} is symmetric but neither reflexive nor transitive.

MATRIEL REQUIRED

A piece of plywood, some pieces of wires, nails, white paper, glue etc.
METHOD OF CONSTRUCTION

Take a piece of plywood and paste a white paper on it. Draw few lines on white paper, such that some of
them are parallel, some are perpendicular to each other and some are inclined as shown in Figure.

DEMONSTRATION

1 Let the wires represent the lines 𝑙1 , 𝑙2 , … , 𝑙8.

2 𝑙1 is perpendicular to each of the lines 𝑙2 , 𝑙3 , 𝑙4 . [see Fig. 1]

Sarvottam International School/2024-25 Page-1


3 𝑙6 is perpendicular to 𝑙7 .

4 𝑙2 is parallel to 𝑙3 , 𝑙3 is parallel to 𝑙4 and 𝑙5 is parallel to 𝑙8 .

5 (𝑙1 , 𝑙2 ), (𝑙1 , 𝑙3 ), (𝑙1 , 𝑙4 ), (𝑙6 , 𝑙7 ) ∈ R

OBSERVATION

1. In Fig. 1, no line is perpendicular to itself, so the relation R = {(𝑙, 𝑚): 𝑙 ⊥ 𝑚} is not reflexive.
2. In Fig. 1, 𝑙1 ⊥ 𝑙2 and 𝑙2 ⊥ 𝑙1

∴ (𝑙1 , 𝑙2 ) ∈ R ⇒ (𝑙2 , 𝑙1 ) ∈ R

Similarly, 𝑙3 ⊥ 𝑙1 . Is 𝑙1 ⊥ 𝑙3 ?
∴ (𝑙3 , 𝑙1 ) ∈ R ⇒ (𝑙1 , 𝑙3 ) ∈ R
Also, 𝑙6 ⊥ 𝑙7. Is 𝑙7 ⊥ 𝑙6 ?
∴ (𝑙6 , 𝑙7 ) ∈ R ⇒ (𝑙7 , 𝑙6 ) ∈ R
∴ The relation R is symmetric.

3. In Fig. 1, 𝑙2 ⊥ 𝑙1 and 𝑙1 ⊥ 𝑙3 but 𝑙2 is not ⊥ 𝑙3.


i.e., (𝑙2 , 𝑙1 ) ∈ R and (𝑙1 , 𝑙3 ) ∈ R ⇒ (𝑙2 , 𝑙3 ) ∉ R
∴ The relation R is not transitive.

APPLICATION

This activity can be used to check whether a given relation is an equivalence relation or not.

Activity-2

OBJECTIVE
To demonstrate a function which is not one-one but is onto.

MATRIEL REQUIRED

Cardboard, nails, strings, adhesive and plastic strips.

METHOD OF CONSTRUCTION

1 Paste a plastic strip on the left hand side of the cardboard and fix three nails on it as shown in the
Fig.3.1. Name the nails on the strip as 1, 2 and 3.

2 Paste another strip on the right hand side of the cardboard and fix two nails in the plastic strip as
shown in Fig.3.2. Name the nails on the strip as 𝑎 and 𝑏.

Sarvottam International School/2024-25 Page-2


Join nails on the left strip to the nails on the right strip as shown in Fig. 3.3.

DEMONSTRATION

1 Take the set X = {1,2,3}

2 Take the set Y = {𝑎, 𝑏}

Join (correspondence) elements of 𝑋 to the elements of 𝑌 as shown in Fig. 3.3

OBSERVATION

1. The image of the element 1 of 𝑋 in 𝑌 is a.


The image of the element 2 of X in Y is b.

The image of the element 3 of X in Y is b.

So, Fig. 3.3 represents a function.

2. The given function is not one-one, as 2 and 3 of X has same image in Y.

Sarvottam International School/2024-25 Page-3


3. The pre-image of each element of Y in X ____exist. So, the function is __onto.

APPLICATION

This activity can be used to demonstrate the concept of one-one and onto function.

Activity-3

OBJECTIVE

To find analytically the limit of a function 𝑓(𝑥) at 𝑥 = 𝑐 and also to check the continuity of the function at
that point.

MATRIEL REQUIRED

Paper, pencil, calculator

METHOD OF CONSTRUCTION

𝑥 2 −16
, 𝑥≠4
1 Consider the function given by 𝑓(𝑥) = { 𝑥−4 }
8, 𝑥=4

2 Take some points on the left and some points on the right side of 𝑐(= 4) which are very near to 𝑐.

3 Find the corresponding values of 𝑓(𝑥) for each of the points considered in step 2 above.

4 Record the values of points on the left and right side of 𝑐 as 𝑥 and the corresponding values of 𝑓(𝑥)
in a form of a table.

DEMONSTRATION

1 The values of 𝑥 and 𝑓(𝑥) are recorded as follows:


Table 1 : For points on the left of 𝑐(= 4).

𝑥 3.9 3.99 3.999 3.9999 3.99999 3.999999 3.9999999

𝑓(𝑥) 7.9 7.99 7.999 7.9999 7.99999 7.999999 7.9999999

2. Table 2: For points on the right of 𝑐(= 4).

𝑥 4.1 4.01 4.001 4.0001 4.00001 4.000001 4.0000001

𝑓(𝑥) 8.1 8.01 8.001 8.0001 8.00001 8.000001 8.0000001

Sarvottam International School/2024-25 Page-4


OBSERVATION

1 The value of 𝑓(𝑥) is approaching to 8, as 𝑥 → 4 from the left.

2 The value of 𝑓(𝑥) is approaching to 8, as 𝑥 → 4 from the right.

3 So, lim𝑥→4− 𝑓(𝑥) = 8 and lim𝑥→4+ 𝑓(𝑥) = 8

4 Therefore, lim𝑥→4 𝑓(𝑥) = 8 , 𝑓(4) = 8

5 Is lim𝑥→4 𝑓(𝑥) = 𝑓(4) = 8

6 Since 𝑓(𝑐) ≠ lim𝑥→𝑐 𝑓(𝑥), so, the function is continuous at 𝑥 = 4.

APPLICATION

This activity is useful in understanding the concept of limit and continuity of a function at a point.

ASSIGNMENT

Class: XII (Mathematics)


Ch-1 Relation and Functions

 Relation: Let 𝐴 and 𝐵 be two sets. Then a relation 𝑅 from set 𝐴 to set 𝐵 is a subset of 𝐴 × 𝐵.
 Types of Relations:
 Empty Relation: A relation R on a set A is said to an empty relation iff 𝑅 = 𝜙 i.e. (𝑎, 𝑏) ∉ 𝑅∀𝑎, 𝑏 ∈ 𝐴 i.e.
no element of A will be related to any other element of A.
 Universal Relation: A relation R on a set A is said to be a universal relation iff 𝑅 = 𝐴 × 𝐴 i.e. (𝑎, 𝑏) ∈
𝑅, ∀a, b ∈ A i.e. each element of A is related to every other element of A.
 Reflexive Relation: A relation R on a set A is said to be reflexive, If (𝑎, 𝑎) ∈ 𝑅 for all 𝑎 ∈ 𝐴
 Symmetric Relation: A relation R on a set A is said to be symmetric, If (𝑎, 𝑏) ∈ 𝑅 ⇒ (𝑏, 𝑎) ∈ 𝑅 for all
𝑎, 𝑏 ∈ 𝐴
 Transitive Relation: A relation R on a set A is said to be Transitive, If (𝑎, 𝑏) ∈ 𝑅, (𝑏, 𝑐) ∈ 𝑅 ⇒ (𝑎, 𝑐) ∈ 𝑅
for all 𝑎, 𝑏, 𝑐 ∈ 𝐴
 Equivalence Relation: A relation R in a set A is said to be an Equivalence Relation if R is reflexive,
symmetric and transitive.
 Equivalence Class: Let 𝑅 be an equivalence relation on a set 𝐴 and let 𝑎 ∈ 𝐴. Then, we define the
equivalence class of 𝑎 as [𝑎] = {𝑏 ∈ 𝐴: 𝑏 is related to 𝑎} = {𝑏 ∈ 𝐴: (𝑎, 𝑏) ∈ 𝑅}
 Function
 Let 𝐴 and 𝐵 be two non-empty sets. Then a function ' 𝑓 ' from set 𝐴 to set 𝐵 is a rule which associates
elements of set 𝐴 to elements of set 𝐵 such that:

(a) All elements of set 𝐴 are associated to some elements in set B.

(b) An element of set 𝐴 is associated to a unique element in set 𝐵.

Sarvottam International School/2024-25 Page-5


 Vertical Line Test: A relation is said to be a function, if a line drawn parallel to Y axis does not intersect
graph at more than one point.
 Types of functions:
 One-One Function (or Injective Function): A function 𝑦 = 𝑓(𝑥) is said to be one one iff different pre-
images have different images or if images are same then the pre-images are also same.

i.e. 𝑓(𝑥1 ) = 𝑓(𝑥2 ) ⇒ 𝑥1 = 𝑥2 or 𝑥1 ≠ 𝑥2 ⇒ 𝑓(𝑥1 ) ≠ 𝑓(𝑥2 )

 Many-One Function: A function in which at least two pre images have same image is called as many-one
function.

 Into Function: A Function is said to be an 'into' function if there is at least one element in the co-domain
of the function such that it has no pre-image in domain.
 Onto Function (or Surjective Function): A function is said to be onto function if each element of co-
domain has a pre-image in its domain. Alternately,
A function ' 𝑓 ' will be called an onto function iff Range of f = Co-domain (𝑓)
 Bijective Function: A function which is one - one and onto both is called as bijective function.
 Horizontal Line Test: 𝑓 is one-one function if no line parallel to x-axis meets the graph in more than one
point.
 Number of functions
If A and B are finite sets containing 𝑚 and 𝑛 elements, then
 Total number of relations from the set A to set 𝐵 is 2𝑚𝑛 .
2
 Total number of relations on the set A is 2𝑚 .
 Total number of functions from the set A to set B is 𝑛𝑚 .
 Total number of one-one functions from the set A to set B is 𝑛 𝑃𝑚 if 𝑛 ≥ 𝑚, otherwise 0 .
 Total number of onto functions from set A to set B is ∑𝑛𝑟=1 (−1)𝑛−𝑟 𝑛 𝐶𝑟 𝑟 𝑚 if 𝑚 ≥ 𝑛, otherwise 0.

Sarvottam International School/2024-25 Page-6


 Total number of bijective functions from the set A to set B is m!, if 𝑚 = 𝑛, otherwise 0

If 𝐴 be any finite set having 𝑛 elements. Then,


 Number of one-one functions from A to A = 𝑛 !
 Number of onto functions from 𝐴 to 𝐴 are n !
 Number of bijective functions from 𝐴 to 𝐴 are n!

Worksheet No.-(1)
Class: XII
Submission Date: __________ Ch-1 Relation and Functions Date:

1 Let 𝐴 = {1,2,3}. Define the relations 𝑅1 , 𝑅2 and 𝑅3 on A as


(i) 𝑅1 = {(1,1), (2,1), (2,2), (3,1), (3,2), (3,3)}
(ii) 𝑅2 = {(1,1), (1,3), (2,3)}
(iii) 𝑅3 = {(1,1)}
(iv) 𝑅4 = {(1,1), (2,2), (1,2), (2,1)}
(v) 𝑅5 = {(1,1), (2,2), (3,3)}
(vi) 𝑅6 = {(1,1), (2,2), (1,2), (2,1), (3,1)}
Check above relations for Reflexive, Symmetric and Transitive.

2 Show that the relation 𝑅 in the set 𝐴 = {1,2,3} given by 𝑅 = {(1,2), (2,1)} is symmetric but neither
reflexive nor transitive.

3 Show that the relation 𝑅 in the set 𝐴 = {1,2,3} given by 𝑅 = {(1,1), (2,2), (3,3), (1,2), (2,3)} is reflexive
but neither symmetric nor transitive.

4 Let 𝐴 = {1,2,3}. Define the relations 𝑅1 , 𝑅2 , 𝑅3 and 𝑅4 on A as,


(i) 𝑅1 = {(1,1), (1,2), (2,1), (2,2)}
(ii) 𝑅2 = {(1,1), (2,2), (3,3), (1,2), (2,3), (1,3)}
(iii) 𝑅3 = {(1,1), (2,2), (3,3), (1,2), (2,1), (1,3), (3,1)}
(iv) 𝑅4 = {(1,1), (2,2), (3,3), (1,2), (2,1)}
Check whether 𝑅1 , 𝑅2 , 𝑅3 and 𝑅4 are equivalence relations or not

5 Give an examples of a relation R on 𝐴 = {𝑎, 𝑏, 𝑐} which is


(i) Neither reflexive nor symmetric but transitive.
(ii) Neither symmetric nor transitive but reflexive.
(iii) Neither transitive nor reflexive but symmetric.

6 Let 𝑇 be the set of all triangles drawn in a plane with 𝑅 as a relation in 𝑇 given by 𝑅 = {(𝑇1 , 𝑇2 ): 𝑇1 ≅ 𝑇2 }.
Show that 𝑅 is an equivalence relation.

Sarvottam International School/2024-25 Page-7


7 Let 𝐿 be the set of all lines in a plane and 𝑅 be the relation on 𝐿 defined as 𝑅 = {(𝑙, 𝑚): 𝑙 is perpendicular
to 𝑚}. Check whether 𝑅 is reflexive, symmetric or transitive.

8 Let 𝐴 = {2,3,4,5,6,7,8,9}. Let 𝑅 be the relation on 𝐴 defined by {(𝑥, 𝑦): 𝑥 ∈ 𝐴, 𝑦 ∈ 𝐴 and 𝑥 divides 𝑦}.
State whether or not 𝑅 is (a) reflexive (b) symmetric (c) transitive.
9 Let 𝐴 = {2,4,6,8} and 𝑅 be the relation 'is greater than' on the set 𝐴. Write 𝑅 as a set of ordered pairs. Is
this relation (i) reflexive (ii) symmetric (iii) equivalence? Justify your answer.

10 Let 𝑆 be the set of all points in a plane and 𝑅 be a relation on the set 𝑆 given by = {(𝑎, 𝑏) : distance
between points 𝑎 and 𝑏 be less than 5 units }. Show that 𝑅 is reflective and symmetric but not transitive.

Worksheet No.-(2)
Class: XII
Submission Date: __________ Ch-1 Relation and Functions Date:

1. Show that the relation 𝑅 = {(𝑎, 𝑏): 𝑎 − 𝑏 = even integer ∀𝑎, 𝑏 ∈ 𝑍} i.e., 𝑎𝑅𝑏 ⇔ 𝑎 − 𝑏 = even integer, is
an equivalence relation.

2. Show that the relation R on the set I of all integers defined by 𝑅 = {(𝑎, 𝑏): 𝑎 − 𝑏 is divisible by 3 , 𝑎, 𝑏 ∈
𝐼} is an equivalence relation.

3. Let 𝐼 be the set of all integers, 𝑚 be a positive integer an 𝑅 be the relation on 𝐼 defined by 𝑅 =
{(𝑥, 𝑦): 𝑥, 𝑦 ∈ 𝐼, 𝑥 − 𝑦 is divisible by 𝑚}, prove that 𝑅 is an equivalence relation.

4. Show that the relation R in the set 𝐴 = {𝑥 ∈ 𝑊, 0 ≤ 𝑥 ≤ 17} given by


𝑅 = {(𝑎, 𝑏): |𝑎 − 𝑏| is a multiple of 5}
is equivalence relations. Find the equivalence class of 2.

5. Let a relation 𝑅1 on the set 𝑅 of real numbers be defined by 𝑎𝑅1 𝑏 ⇔ 1 + 𝑎𝑏 > 0 for all 𝑎, 𝑏 ∈ 𝑅. Show
that 𝑅1 is reflexive and symmetric but not transitive.

6. Let 𝑁 be the set of natural numbers and 𝑅 be a relation on 𝑁 × 𝑁 defined by, (𝑎, 𝑏)𝑅(𝑐, 𝑑) ⇒ 𝑎 + 𝑑 =
𝑏 + 𝑐 for all (𝑎, 𝑏) and (𝑐, 𝑑) ∈ 𝑁 × 𝑁. Prove that 𝑅 is an equivalence relation on 𝑁 × 𝑁.
7. Let 𝑁 be the set of natural numbers and 𝑅 be the relation on 𝑁 × 𝑁 defined by (𝑎, 𝑏)𝑅(𝑐, 𝑑) iff 𝑎𝑑 = 𝑏𝑐
for all 𝑎, 𝑏, 𝑐, 𝑑 ∈ 𝑁. Show that 𝑅 is an equivalence relation.

10 Let 𝑁 be the set of all natural numbers and 𝑅 be the relation on 𝑁 × 𝑁 defined by (𝑎, 𝑏)𝑅(𝑐, 𝑑) iff
𝑎𝑑(𝑏 + 𝑐) = 𝑏𝑐(𝑎 + 𝑑). Check whether 𝑅 is an equivalence relation.

Sarvottam International School/2024-25 Page-8


Worksheet No.-(3)
Class: XII
Submission Date: __________ Ch-1 Relation and Functions Date

1 A relation R on set A = {1,2,3,4,5} is defined as R = {(x, y): |x 2 − y 2 | < 8}. Check whether the relation R
is reflexive, symmetric and transitive.
2 A relation R is defined on N × N (where N is the set of natural numbers) as :
(a, b)R(c, d) ⇔ a − c = b − d Show that 𝑅 is an equivalence relation.

3 Let 𝐴 = {1,2,3}. Find the number of relations of A Containing (1,2) and (1,3) which are reflextive and
symmetric but not transitive

4 Let 𝐴 = {1,2,3}. Find the number of relations on A containing (1,2) and (2,3) which are reflexive and
transitive but not symmetric.

5 Let 𝐴 = {1,2,3}. Find the number of equivalence relations on A containing (1,2).

6 If 𝑅1 and 𝑅2 are equivalence relations in a set 𝐴, show that 𝑅1 ∩ 𝑅2 is also an equivalence relation.

7 Let 𝐴 = {1,2,3}. Find the smallest equivalence relations on set A.

8 Let 𝐴 = {1,2,3}. Find the largest equivalence relations on set A

Worksheet No.-(4)
Class: XII
Submission Date: __________ Ch-1 Relation and Functions Date:

1. Let 𝐴 = {1,2,3,4} and 𝐵 = {1,4,7,8}. Find which of the following functions from 𝐴 to 𝐵 are one one and
onto :
(i) 𝑓: 𝐴 → 𝐵 defined as 𝑓(1) = 1, 𝑓(2) = 4, 𝑓(3) = 4, 𝑓(4) = 8
(ii) 𝑓: 𝐴 → 𝐵 defined as 𝑓(1) = 4, 𝑓(2) = 7, 𝑓(3) = 1, 𝑓(4) = 8

2. Let 𝐴 = {1,2,3,4} and 𝐵 = {5,6,7,8}. Let 𝑓: 𝐴 → 𝐵 be defined by 𝑓 = {(1,5), (2,6), (3,7), (4,8)}. Show
that 𝑓 is one-one and onto.

3. Which of the following functions are one-one?

(i) 𝑓: 𝑅 → 𝑅, defined by 𝑓(𝑥) = 4, 𝑥 ∈ 𝑅 (ii) 𝑓: 𝑅 → 𝑅, defined by 𝑓(𝑥) = 6𝑥 − 1, 𝑥 ∈ 𝑅


(iii) 𝑓: 𝑅 → 𝑅, defined by 𝑓(𝑥) = 𝑥 2 + 7, 𝑥 ∈ 𝑅 (iv) 𝑓: 𝑅 → 𝑅, defined by 𝑓(𝑥) = 𝑥 3 , 𝑥 ∈ 𝑅
2𝑥+1
(v) 𝑓: 𝑅 − {7} → 𝑅, defined by 𝑓(𝑥) = , 𝑥 ∈ 𝑅 − {7}
𝑥−7

4. Classify the following functions as one-one, onto or bijection


(a) 𝑓: 𝑁 → 𝑁 defined by 𝑓(𝑥) = 2𝑥
(b) 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 2𝑥
(c) 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 2𝑥

5. Classify the following functions as one-one, onto or bijection :


(b) 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 𝑥 2 + 1

Sarvottam International School/2024-25 Page-9


(a) 𝑓: 𝑁 → 𝑁 defined by 𝑓(𝑥) = 𝑥 2 + 1
(c) 𝑓: 𝑍 → 𝑍 defined by 𝑓(𝑥) = 𝑥 2 + 1

6. Classify the following functions as one-one, onto or bijection


(a) 𝑓: ℕ → ℕ defined by 𝑓(𝑥) = 𝑥 3 + 1
(b) 𝑓: ℝ → ℝ defined by 𝑓(𝑥) = 𝑥 3 + 1
(c) 𝑓: ℤ → ℤ defined by 𝑓(𝑥) = 𝑥 3 + 1

7. Classify the following functions as one-one, onto or bijection, Justify your answer.

(i) 𝑓: 𝑍 → 𝑍 given by 𝑓(𝑥) = 𝑥 2 + 1 for all 𝑥 ∈ 𝑍


(ii) 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 5𝑥 − 7
(iii) 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 3 + 2𝑥 2
(iv) 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = |𝑥|, 𝑥 ∈ 𝑅
(v) 𝑓: 𝑅 → 𝑅 given by 𝑓(𝑥) = 𝑥 3 + 2 for all 𝑥 ∈ 𝑅

8. Classify the following as one-one, onto or bijection


(b) 𝑓: ℝ → ℝ defined by 𝑓(𝑥) = 𝑥 2 + 𝑥
(a) 𝑓: ℕ → ℕ defined by 𝑓(𝑥) = 𝑥 2 + 𝑥
(c) 𝑓: ℤ → ℤ defined by 𝑓(𝑥) = 𝑥 2 + 𝑥

Worksheet No.-(5)
Class: XII
Submission Date: __________ Ch-1 Relation and Functions Date:

1. A function 𝑓 is defined from 𝑅 → 𝑅 as 𝑓(𝑥) = 𝑎𝑥 + 𝑏, such that 𝑓(1) = 1 and 𝑓(2) = 3. Find function
𝑓(𝑥). Hence, check whether function 𝑓(𝑥) is one-one and onto or not.
𝑥−1
2. Show that function 𝑓: ℝ → {2} → ℝ − {1} given by 𝑓(𝑥) = 𝑥−2 is a bijection

3. Consider 𝑓: 𝑅+ → [4, ∞) given by 𝑓(𝑥) = 𝑥 2 + 4. Show that 𝑓 is bijective.

4. Show that the function 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = cos(5𝑥 + 2) is neither one-one nor onto?

5. Let 𝑓: 𝑅 → 𝑅 be defined by 𝑓(𝑥) = 𝑥 + |𝑥|. Determine whether or not 𝑓 is onto.

2𝑥
6. Show that a function 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 1+𝑥 2 is neither one-one nor onto. Further, find set 𝐴 so
that the given function 𝑓: 𝑅 → 𝐴 becomes an onto function.

7. Consider 𝑓: 𝑅 + → [−5, ∞) given by 𝑓(𝑥) = 9𝑥 2 + 6𝑥 − 5. Show that 𝑓 is bijective.

8. Let 𝑓: 𝑁 → 𝑅 be a function defined as 𝑓(𝑥) = 4𝑥 2 + 12𝑥 + 15. Show that 𝑓: 𝑁 → Range (𝑓) is bijective.
𝑥
9. Show that the function 𝑓: ℝ → {𝑥 ∈ ℝ: −1 < 𝑥 < 1} defined by 𝑓(𝑥) = 1+|𝑥| is one-one and onto function

𝑥 + 1, if 𝑥 is odd
10. Show that 𝑓: 𝑁 → 𝑁 defined by 𝑓(𝑥) = { is bijective.
𝑥 − 1, if 𝑥 is even
𝑛−1
, if 𝑛 is odd
2
11. A function 𝑓: 𝑁 → 𝑍 is defined by 𝑓(𝑛) = { 𝑛 Show that this function is a bijection.
− , if 𝑛 is even
2

Sarvottam International School/2024-25 Page-10


12. Show that the function 𝑓: 𝑅 → 𝑅 defined by 𝑓(𝑥) = 𝑥 3 + 3𝑥 for all 𝑥 ∈ 𝑅 is bijective.

Worksheet No.-(6)
Class: XII
Submission Date: __________ Ch-1 Relation and Functions Date:

1. If 𝐴 = {1,2,3} and 𝐵 = {3,5}, then find the number of functions from 𝐴 to 𝐵.

2. If 𝐴 = {𝑎, 𝑏, 𝑐} and 𝐵 = {1,2,3,4}, then find the number of functions from 𝐴 to 𝐵.

3. Find the number of one-one functions from the set {1,2,3,4} to itself.

4. If 𝐴 = {1,2,3} and 𝐵 = {𝑝, 𝑞}, then find the number of one-one function from 𝐴 to 𝐵.

5. If 𝐴 = {𝑎, 𝑏} and 𝐵 = {1,3,5}, the find the number of one-one functions from 𝐴 to 𝐵.

6. If 𝐴 = {1,2,3} and 𝐵 = {3,4,5,8}, then find the number of one-one functions from 𝐴 to 𝐵.

7. If 𝐴 = {𝑎, 𝑏} and 𝐵 = {1,2,3}, then find the number of onto functions from 𝐴 to 𝐵.

8. If 𝐴 = {𝑎, 𝑏, 𝑐} and 𝐵 = {𝑝, 𝑞}, then find the number of onto function from 𝐴 to 𝐵.

9. If n(A)= 4, n(B)=3, find the number of onto and Into functions fro A to B.

Worksheet No.-(7)
Class: XII
Submission Date: __________ Ch-1 Relation and Functions Date:

MCQ
1 The relation R = {(1,2)} on A = {1,2,3} is
(a) Reflexive only (b) Symmetric only (c) Transitive only (d) Equivalence

2 In the set A = {1,2,3,4,5}, a relation R is defined by R = {(𝑥, 𝑦): 𝑥, 𝑦 ∈ A and 𝑥 < 𝑦}. Then R is
(a) Reflexive (b) Symmetric (c) Transitive (d) None of these

3 Let A = {1,2,3,4} and R = {(1,1), (2,2), (3,3), (4,4), (1,2), (2,1)} be defined on set A Then the
equivalence classes of [1] is
(a) (1,2) (b) [1,2] (c) {1,2} (d) None of these

4 Let A = {1,2}. Then number of reflexive relations defined on A is


(a) 4 (b) 8 (c) 16 (d) 0

5 Let us define a relation R in 𝐑 (set of real numbers), as 𝑎R𝑏 if 𝑎 ≥ 𝑏. Then R is

(a) an equivalence relation (b) reflexive, transitive but not symmetric

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

6 𝑓: 𝑅 → 𝑅: 𝑓(𝑥) = 𝑥 2 is
(a) one-one and onto (b) one-one and into (c) many-one and onto (d) many-one and into

Sarvottam International School/2024-25 Page-11


7 𝑓: 𝑅 → 𝑅: 𝑓(𝑥) = 𝑥 3 is
(a) one-one and onto (b) one-one and into (c) many-one and onto (d) many-one and into
8 A function 𝑓: 𝑅+ → 𝑅 (where 𝑅+ is the set of all non-negative real numbers) defined by 𝑓(𝑥) = 4𝑥 + 3 is :
(A) one-one but not onto (B) onto but not one-one
(C) both one-one and onto (D) neither one-one nor onto
𝑥−2
9 Let 𝐴 = 𝑅 − {3} and 𝐵 = 𝑅 − {1}. Then, 𝑓: 𝐴 → 𝐵: 𝑓(𝑥) = 𝑥−3 is
(a) one-one and into (b) one-one and onto (c) many-one and into (d) many-one and onto
10 Let 𝑅+ denote the set of all non-negative real numbers. Then the function 𝑓: 𝑅+ → 𝑅+ defined as 𝑓(𝑥) =
𝑥 2 + 1 is :
(A) one-one but not onto (B) onto but not one-one
(C) both one-one and onto (D) neither one-one nor onto

11 Let 𝑓: 𝑅+ → [−5, ∞) be defined as 𝑓(𝑥) = 9𝑥 2 + 6𝑥 − 5, where 𝑅+ is the set of all non-negative real
numbers. Then, 𝑓 is :
(A) one-one (B) onto (C) bijective (D) neither one-one nor onto
1
(𝑛 + 1), when 𝑛 is odd
12 Let 𝑓: 𝑁 → 𝑁: 𝑓(𝑛) = {2𝑛 Then, 𝑓 is
, when 𝑛 is even
2
(a) one-one and into (b) one-one and onto (c) many-one and into (d) many-one and onto
13 Set A has 3 elements and the set B has 4 elements. Then the number of injective mappings that can be
defined from 𝐴 to 𝐵 is
(A) 144 (B) 12 (C) 24 (D) 64

14 A function f: ℝ → ℝ defined as f(𝑥) = 𝑥 2 − 4𝑥 + 5 is :


(A) injective but not surjective. (B) surjective but not injective.
(C) both injective and surjective. (D) neither injective nor surjective.

15 Number of bijective functions on a set of 10 elements, is


(a) 5 ! (b) 10 ! (c) 15 ! (d) 8 !
In the following questions, a statement of Assertion (A) is followed by a statement of Reason (R).
Choose the correct answer out of the following choices.
(a) Both A and R are true and R is the correct explanation of A.
(b) Both 𝐀 and 𝐑 are true and 𝐑 is not the correct explanation of 𝐀.
(c) 𝐀 is true but 𝐑 is false.
(d) 𝐀 is false but 𝐑 is true.
16 Assertion (A): The relation R = {(a, b): a ≤ b2 } on the set R of real nos. is not reflexive.
Reason (R): A relation on a set 𝐴 is reflexive if (𝑎, 𝑎) ∈ 𝑅∀𝑎 ∈ 𝐴.
17 Assertion (A): Let a relation R on the set R of real numbers be defined as (a, b) ∈ R ⇔ 1 + ab > 0∀a, b ∈
ℝ, is transitive relation.
Reason (R): A relation on a set 𝐴 is transitive if (𝑎, 𝑏) and (𝑏, 𝑐) ∈ 𝑅 implies (𝑎, 𝑐) ∈ 𝑅 for all a, b, c ∈ A.
1
18 Assertion (A): If 𝑅 be the relation defined on 𝑄 (set of rational numbers) as 𝑎𝑅𝑏 ⇔ |𝑎 − 𝑏| ≤ 2, then R is

not a symmetric relation.


Reason (R): A relation on a set 𝐴 is symmetric if (𝑎, 𝑏) ∈ 𝑅 implies (𝑏, 𝑎) ∈ 𝑅 for all 𝑎, 𝑏 ∈ 𝐴.

Sarvottam International School/2024-25 Page-12


19 Assertion (A): A reflexive relation may or may not be an identity relation.
Reason (R): A relation 𝑅 on 𝐴 is identity relation iff 𝑅 = {(𝑎, 𝑏): 𝑎 ∈ 𝐴, 𝑏 ∈ 𝐴 and 𝑎 = 𝑏}.

CASE STUDY 1
Sheetal and Deepak are playing Ludo at home during Covid-19. While rolling the dice, Sheetal's sister
Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let 𝐴
be the set of players while 𝐵 be the set all possible outcomes.
𝐴 = {𝑆, 𝐷}, 𝐵 = {1,2,3,4,5,6}

(i) Let 𝑅: 𝐵 → 𝐵 be defined by R = {(𝑥, 𝑦): 𝑦 is divisible by 𝑥}, Check relation for Reflexive, Syymetric and
Transitive.
(ii) Raji wants to know the number of functions from A to B. How many number of functions are possible?
(iii) Raji wants to know the number of relations possible from A to B. How many numbers of relations are
possible?

CASE STUDY 2:
An organization conducted bike race under 2 different categories-boys and girls. Totally there were 250
participants. Among all of them finally three from Category 1 and two from Category 2 were selected for
the final race. Ravi forms two sets 𝐵 and 𝐺 with these participants for his college project.

Let 𝐵 = {𝑏1 , 𝑏2 , 𝑏3 } 𝐺 = {𝑔1 , 𝑔2 } where 𝐵 represents the set of boys selected and 𝐺 the set of girls who
were selected for the final race.

Ravi decides to explore these sets for various types of relations and functions

(i) Ravi wishes to form all the relations possible from B to G. How many such relations are possible?
(ii) Let R: B → B be defined by R = {(𝑥, 𝑦): 𝑥 and y are students of same sex }, Then Check relation for
Reflexive, Syymetric and Transitive.
(iii) Ravi wants to find the number of injective functions from B to 𝐺. How many numbers of injective
functions are possible?

Sarvottam International School/2024-25 Page-13


CASE STUDY 3:
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 𝑦 = 𝑥 − 4. Let 𝐿 be the set of all lines which are parallel on the ground and R be a
relation on L.

Answer the following using the above information.

(i) Let relation R be defined by R = {(𝐿1, 𝐿2): 𝐿1 ∥ 𝐿2 where L1 , L2 ∈ L} then Check relation for Reflexive,
Syymetric and Transitive.
(ii) Let R = {(𝐿1, 𝐿2): 𝐿1 ⊥ 𝐿2 where L1, L2 € L} , then Check relation for Reflexive, Syymetric and
Transitive.
(iii)Let 𝑅 = {(𝐿1 , 𝐿2 ): 𝐿1 is parallel to 𝐿2 and 𝐿1 : 𝑦 = 𝑥 − 4} then write equation of 𝐿2 related to 𝐿1

CASE STUDY 4:
Students of a school are taken to a railway museum to learn about railways heritage and its history.

An exhibit in the museum depicted many rail lines on the track near the railway station. Let 𝐿 be the set of
all rail lines on the railway track and R be the relation on L defined by

R = {(𝑙1 , 𝑙2 ): 𝑙1 is parallel to 𝑙2 }

On the basis of the above information, answer the following questions:

(i) Find whether the relation R is symmetric or not.

(ii) Find whether the relation R is transitive or not.

(iii) If one of the rail lines on the railway track is represented by the equation 𝑦 = 3𝑥 + 2, then find the set
of rail lines in R related to it. OR

(b) Let S be the relation defined by S = {(𝑙1 , 𝑙2 ): 𝑙1 is perpendicular to 𝑙2 } check whether the relation 𝑆 is
symmetric and transitive.

Sarvottam International School/2024-25 Page-14


Sarvottam International School/2024-25 Page-15

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