MLP Relations and functions Questions 2024

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

ELHI

Minimum Learning Plan for Examination (2024 - 25)-1


CLASS – XII
SUBJECT : - Mathematics (Code : 041)
Name: ………………………………

Topic : Relations and Functions

1. Show by examples that the relation 𝑅 in, defined by 𝑅 = {(𝑎, 𝑏): 𝑎 ≤ 𝑏3 } is neither reflexive nor
transitive.

2. How many equivalence relations on the set {1, 2, 3} containing (1, 2) and (2, 1) are there in all? Justify
your answer.

3. Check whether the relation R in the set R of real numbers, defined by


𝑅 = {(𝑎, 𝑏): 1 + 𝑎𝑏 > 0}, is reflexive, symmetric or transitive.

4. Show that the relation S in the set 𝐴 = {𝑥 ∈ 𝑍: 0 ≤ 𝑥 ≤ 12} given by


𝑆 = {(𝑎, 𝑏) ∶ 𝑎, 𝑏 ∈ 𝑍, |𝑎 – 𝑏| 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 3} is an equivalence relation.

5. Let N denote the set of all-natural numbers and R be the relation on 𝑁 × 𝑁 defined by (𝑎, 𝑏)𝑅(𝑐, 𝑑)
if 𝑎𝑑(𝑏 + 𝑐 ) = 𝑏𝑐(𝑎 + 𝑑). Show that R is an equivalence relation.

𝑛+1
, 𝑖𝑓 𝑛 𝑖𝑠 𝑜𝑑𝑑
6. Let 𝑓 ∶ 𝑁 → 𝑁 be defined by 𝑓 (𝑛) = { 𝑛2 for all 𝑛 ∈ 𝑁.Find whether the function 𝑓 is One-
, 𝑖𝑓 𝑛 𝑖𝑠 𝑒𝑣𝑒𝑛
2
one and onto .

7. Prove that the function 𝑓: [0, ∞) → 𝑅 given by 𝑓 (𝑥 ) = 9𝑥 2 + 6𝑥 – 5 is One-one and onto .

𝑥
8. Show that the function 𝑓: 𝑅 → {𝑥 ∈ 𝑅: −1 < 𝑥 < 1} defined by 𝑓(𝑥) = 1+|𝑥| , 𝑥 ∈ 𝑅 is one-one and
onto function.

9. Let T be the set of all triangles in a plane with R as relation in T given by


𝑅 = {(𝑇1 , 𝑇2 ) ∶ 𝑇1 ≅ 𝑇2}. Show that R is an equivalence relation.

10. Show that the relation R defined by (𝑎, 𝑏)𝑅(𝑐, 𝑑 )𝑖𝑓𝑓 𝑎 + 𝑑 = 𝑏 + 𝑐 on 𝐴 × 𝐴,


where𝐴 = {1, 2, 3, … … ,10} is an equivalence relation. Hence, write the equivalence class [(3,4)];
𝑎, 𝑏, 𝑐, 𝑑 ∈ 𝐴.

Page 1 of 1

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