NCERT Solutions Class 12 Maths Chapter 1 Relation and Function: Exercise PDFs, Weightage & Important Formulae

NCERT Maths 12th 2023 ( Maths Ncert Solutions class 12th )

nitesh singh
Updated on Jan 22, 2025 16:43 IST

By nitesh singh, Senior Executive

Class 12 Chapter 1 Relation and Function NCERT Solutions: Shiksha provides a complete solution of NCERT Class 12 Maths Chapter 1 Relation and Function on this page. NCERT Maths Chapter 1 Relation and Function is one of the most important and complex topics in Class 12 Mathematics. Shiksha brings detailed Relation and Function NCERT Solutions in lucid language with strong conceptual fundamentals for students.

Students can also download the NCERT class 12 Maths chapter 1 solutions pdf below on this page. Relation and function Class 12 Solutions PDF will be very beneficial for board students as well as competitive exams such as JEE Main, BITSAT, etc... aspirants. Students must check NCERT Class 12 Maths Chapter 1 solutions to get a strong conceptual understanding and get better scores in board exams. Students must check the Class 11 Chapter 2 Relation and Function solutions to get better conceptual clarity of the concepts.

The Relation and Function chapter includes many important topics such as Types of relations, ordered pairs, Types of functions, range, domain and others. A relation R from a set A to a set B is a subset of the Cartesian Product A × B obtained by describing a relationship between the first element x and the second element y of the ordered pairs in A × B. A function can be defined as a relation f from set A to set B where every element of set A has only one image in set B. Students can check exercise-wise Class 12 Maths NCERT solutions of all chapters on Shiksha. Check below for more information;

Related Important Math Chapter Solutions
Class 11 Chapter 1 Set Solutions Class 11 Chapter 2 Relation and Function Solutions Class 12 Chapter 2 Inverse Trigonometric Function Solution
Q&A Icon
Commonly asked questions

Q:   Is Class 12 Math Relation and Function chapter important for Board Exams?

A: 

Yes, Class 12 Math Relation and Function chapter is important for rither CBSE Board Exams or State Boards. The Relation and Function chapter have weightage of 6-8 marks in the CBSE board exam. Moreover Relation and function chapter forms the foundation for many other advanced topicssuch as  types of relations, functions, domain, range, composition of functions, and invertibility.  Relation and function is also important to understand complex JEE Mains topics such as calculus and inverse trigonometry.  For more information check below;

Class 12 Math Relation and Function NCERT Solutions

Thumbs Up IconUpvote Thumbs Down Icon

Q:   What are the key concepts discussed in the Relation and Function Class 12 Math?

A: 

Candidates must be aware of the important concepts discussed in the chapter and their application in other mathematics chapters. Students can check several fundamental and advanced topics discussed in the Relation and Function chapter.

  • Basic Concepts: Definations, Sets cross product, Relation, Function, Domain, Range
  • Types of Relations: Reflexive, Symmetric, Transitive, and Equivalence relations
  • Types of functions: one-one, many-one, onto and into functions
  • Other Important Functions: Modulus function, identity function, inverse function, and invertibility
  • Operations on Functions: Commutativity, Associativity, Existence of identity, and inverse of Function

Students must check complete NCERT solution of Relation and Function by clicking on the below given link;

Class 12 Math Relation and Function NCERT Solutions

Thumbs Up IconUpvote Thumbs Down Icon

Q:   What is weightage of Relation and Function in JEE Main?

A: 

Class 12 Math Relation and Function chapter have moderate weightage in the JEE Mains exam. Relation and function combined with sets comprises of 4-8 marks weight in the JEE Mains Exam. However, Students should know there is no fixed weightge of relation and fucntions chapter. Questions may be asked directly from relation and function or its applications can be used in forming the question. This makes Rleation and function a very important chapter to understand the basics of ITF and calculus also. JEE Aspirants can check the Class 12 Math Relation and Function Solution to undersatnd the basics of the chapter before starting their preparation. Check the lionk below;

Class 12 Math Relation and Function NCERT Solutions

Thumbs Up IconUpvote Thumbs Down Icon

Q:   Will Class 12 Math Relation and Function NCERT Solutions be enough to prepare for the CBSE Boards exams?

A: 

Yes, Class 12 Math Relations and Functions includes all the key topics as per requirements for CBSE Board Exams. Relations and Functions has several exercises with plenty of practice problems to help students understand the concepts better. We have designed solutions in a simple and clear manner to build confidence and prepare students effectively for their CBSE exams

However, Students shouls also focus on understanding types of relations and functions, their graphs, and real-life applications with the help of other questions outside NCERT if possible. Practicing NCERT problems and previous years' questions asked in CBSE boards will make concepts easier and that will improve accuracy in exams. Check the NCERT Solutions below;

Class 12 Math Relations and Fuction NCERT Solution

Thumbs Up IconUpvote Thumbs Down Icon
Table of content
  • Class 12 Math Chapter 1 Relation and Function: Key Topics, Weightage & Important Formulae
  • Class 12 Math Chapter 1 Relation and Function Solution PDF
  • Class 12 Math Chapter 1 Relation and Function Exercise -wise solutions
  • Class 12 Math Chapter 1 Relation and Function Exercise 1.1 Solutions
  • Class 12 Math Chapter 1 Relation and Function Exercise 1.2 Solutions
  • Class 12 Math Chapter 1 Relation and Function Old NCERT Solutions
  • Class 12 Math important reference books and preparation Tips
View More
Maths Ncert Solutions class 12th Logo

Class 12 Math Chapter 1 Relation and Function: Key Topics, Weightage & Important Formulae

The Relation and Function chapter carries up to 8 marks weightage in the Board exams. This chapter is also important to understand complex JEE Mains topics such as calculus and inverse trigonometry. Several key topics are discussed in the exercises;  

  • Types of relations: Reflexive, Symmetric, Transitive, and Equivalence relations 
  • Types of functions: one-one, many-one, onto and into functions 
  • Other Important Functions: Modulus function, identity function, inverse function, and invertibility
  • Binary Operations: Commutativity, Associativity, Existence of identity, and inverse of Function

Read more: Most scoring topics in Mathematics for JEE Main

Check out Dropped topics of Relation and Function- 1.4 Composition of Functions and Invertible Function, Page 13-14 Full Pages, Page 15 Examples 24 and 25, Page 16-25 Full Pages, Page 26 Question 12 and 13, Page 27-28 Examples 45 and 49, Page 29-31 Ques. 1–3, 6–7, 9, 11–14, 18–19, Page 31-32 Summary points 11-13 and 15-19.

Relation and Function Important Formulae for CBSE and Competitive Exams

Relations

  • Domain of a Relation: The set of all first elements (x) in the ordered pairs of a relation :

    Domain of  R = { x     ( x , y ) R } .
  • Range of a Relation: The set of all second elements (y) in the ordered pairs of a relation :

    Range of  R = { y     ( x , y ) R } .
  • The inverse of a Relation: If is a relation from set to set , then the inverse R 1 R^{-1} is a relation from set to set :

    R 1 = { ( y , x )     ( x , y ) R } .
  • Types of Relations

    • Reflexive Relation: is reflexive if ( a , a ) R (a, a) \in R a A a \in A
    • Symmetric Relation: is symmetric if ( a , b ) R ( b , a ) R (a, b) \in R \Rightarrow (b, a) \in R
    • Transitive Relation: is transitive if ( a , b ) R  and  ( b , c ) R ( a , c ) R (a, b) \in R \text{ and } (b, c) \in R \Rightarrow (a, c) \in R
    • Equivalence Relation: is an equivalence relation if it is reflexive, symmetric, and transitive.

Functions

  • Function Definition: A function f : A B f: A \to B maps every element of to exactly one element of :

    f ( a ) = b ,   a A .
  • Domain and Range of a Function

    • Domain: Set of all permissible inputs x x of f ( x ) f(x)
    • Range: Set of all possible outputs ().
  • Types of Functions

    • One-One (Injective): f ( a 1 ) = f ( a 2 ) a 1 = a 2 f(a_1) = f(a_2) \Rightarrow a_1 = a_2
    • Onto (Surjective): Every y B y \in B has a pre-image x A x \in A
    • Bijective: f f is both one-one and onto.
  • Composition of Functions: If f : A B f: A \to B and g : B C g: B \to C

    ( g f ) ( x ) = g ( f ( x ) ) .
  • Inverse of a Function: A function f f is invertible if it is bijective:

    f 1 ( y ) = x  such that  f ( x ) = y .
  • Binary Operation: A binary operation * on A A

    : A × A A .
  • Modulo Function

    f ( x ) = x m o d n (remainder when  x  is divided by  n ) .
  • Greatest Integer Function

    f ( x ) = x (greatest integer less than or equal to  x ) .
Maths Ncert Solutions class 12th Logo

Class 12 Math Chapter 1 Relation and Function Solution PDF

Students can find the solutions of all the exercises of relation and function in one place. This Relation and Function NCERT solution PDF will be really beneficial for all categories of students whether boards or competitive exams. access the PDF below;

Class 12 Math Chapter 1 Relation and Function Solution: Free PDF Download

Maths Ncert Solutions class 12th Logo

Class 12 Math Chapter 1 Relation and Function Exercise -wise solutions

The class 12 Relation and Function chapter deals with many important topics, such as the type of relation, symmetric and asymmetric relations, functions, bijective functions, and surjective functions. Students will get problems related to different concepts and properties of relations and functions in the exercises.  Candidates can check the exercise-wise chapter 1 math solutions below;

Maths Ncert Solutions class 12th Logo

Class 12 Math Chapter 1 Relation and Function Exercise 1.1 Solutions

Chapter 1 Relation and Function Exercise 1.1 focuses on problems based on identifying reflexive, symmetric, and transitive relations & checking whether the relation is an equivalence relation or not. Class 12 Math Relation and Function Exercise 1.1 consists of 16 Questions (14 Short Answers, 2 MCQ). Students can check the complete the exercise 1.1 solutions below;

Relation and Function exercise 1.1 solutions

Q1. Determine whether each of the following relations are reflexive, symmetric and transitive:

(i)Relation R in the set A = {1, 2, 3…13, 14} defined as

R = {(x, y): 3x − y = 0}

(ii) Relation R in the set N of natural numbers defined as

R = {(x, y): y = x + 5 and x < 4}

(iii) Relation R in the set A = {1, 2, 3, 4, 5, 6} as

R = {(x, y): y is divisible by x}

(iv) Relation R in the set Z of all integers defined as

R = {(x, y): x − y is as integer}

(v) Relation R in the set A of human beings in a town at a particular time given by

(a) R = {(x, y): x and y work at the same place}

(b) R = {(x, y): x and y live in the same locality}

(c) R = {(x, y): x is exactly 7 cm taller than y}

(d) R = {(x, y): x is wife of y}

(e) R = {(x, y): x is father of y}

A.1. (i) We have,  R = { ( x , y ) : 3 x y = 0 }  a relation in set A=  { 1 , 2 , 3 . . . . . . . . . . 1 4 }

For  x A , y = 3 x  or  y x  i.e.,

( x , x )  does not exist in R

 R is not reflexive.

For  ( x , y ) R , y = 3 x

Then  ( y , x ) x 3 y

So  ( y , x ) R

 R is not symmetric

For  ( x , y ) R  and  ( y , z ) R  . We have

y = 3 x  and  z = 3 y

Then  z = 3 ( 3 x ) = 9 x

i.e.,  ( x , z ) R

 R is not Transitive

(ii) We have,

R=  { ( x , y ) : y = x + 5 & x < 4 }  is a relation in N

{ ( 1 , 1 + 5 ) , ( 2 , 2 + 5 ) , ( 3 , 3 + 5 ) }

{ ( 1 , 6 ) , ( 2 , 7 ) , ( 3 , 8 ) }

Clearly, R is not reflexive as  ( x , x ) R  and  x < 4 & x N

Also, R is not symmetric as  ( 1 , 6 ) R  but  ( 6 , 1 ) R

And for  ( x , y ) R ( y , z ) R  . Hence, R is not Transitive.

(iii) R=  { ( x , y ) ; y  is divisible by x  }  is a relation in set

A=  { 1 , 2 , 3 , 4 , 5 , 6 }

So, R=  { ( 1 , 1 ) , ( 1 , 2 ) , ( 1 , 3 ) , ( 1 , 4 ) , ( 1 , 5 ) , ( 1 , 6 ) , ( 2 , 2 ) , ( 2 , 4 ) , ( 2 , 6 ) , ( 3 , 3 ) , ( 3 , 6 ) , ( 4 , 4 ) , ( 5 , 5 ) , ( 6 , 6 ) }

Hence, R is reflexive because  ( 1 , 1 ) , ( 2 , 2 ) , ( 3 , 3 ) , ( 4 , 4 ) , ( 5 , 5 ) , ( 6 , 6 ) R  i.e.,  ( x , x ) R

R is not symmetric as  ( 1 , 2 ) R  but  ( 2 , 1 ) R

And for  x , y , z A  and  ( x , y ) R & ( y , z ) R

y z = n  and  z y = m  where  n & m N

Then,  z = m y = m ( n x ) = m n . x

z x = m . n , m , m n N

Hence,  ( x , z ) R

 R is transitive

(iv) R=  { ( x , y ) : x y  is an integer  }  is a relation in set Z

For  x Z

x x = 0  is an integer

So,  ( x , x ) R  i.e., R is reflexive

For  x , y Z  and  ( x , y ) R

x y  is an integer

( y x )  is an integer

( y x )  is an integer

So,  ( y , x ) R  i.e., R is symmetric

For  x , y , z R  and  ( x , y ) R & ( y , z ) R  We have,

x y  is an integer

y z  is an integer

So,  ( x y ) + ( y z )  is also an integer

x z  is an integer

So,  ( x , z ) R  i.e., R is transitive.

(v) (a) R=  { ( x , y ) : x  and  y  work at same place  }  in set A of human being.

For  x A  we get

x & x  work at same place

( x , x ) R  So, R is reflexive.

For  x , y A  and  ( x , y ) R  We get,

x & y  work at same place

y & x  work at same place

( y , x ) R  . So, R is symmetric.

For  x , y , z A  and  ( x , y )  and  ( y , z ) R  . We have,

x & y  work at same place

y & z  work at same place

x & z  work at same place

i.e.,  ( x , z ) R  . So, R is Transitive.

(b) R=  { ( x , y ) : x & y  live in same locality  }

For  x A  , we get,

x & x  live in same locality

( x , x ) R  So, R is reflexive.

For  x , y A  and  ( x , y ) R  we get,

x & y  live in same locality

y & x  live in same locality

i.e.,  ( y , x ) R  . So, R is symmetric.

For  x , y , z A  and  ( x , y )  &  ( y , z ) R  . Then

x , y  live in same locality

y , z  live in same locality

x , z  live in same locality

So,  ( x , z ) R  i.e., R is transitive.

(c) R=  { ( x , y ) : x  is exactly 7 cm taller than y  }

For  x A  ,

Height  ( x ) 7 +  height of  ( x )

So,  ( x , x ) R  . i.e., R is not reflexive.

For,  x , y A  and  ( x , y ) R  we have,

Height  ( x )   = 7 + h e i g h t ( y )

But  h e i g h t ( y ) 7 + h e i g h t ( x )

So,  ( y , x ) R  i.e., R is not symmetric.

For  x , y , z A  and  ( x , y ) R  and  ( y , z ) R  we have,

Height  ( x ) = 7 + h e i g h t ( y )

And  h e i g h t ( y ) = 7 + h e i g h t ( z )

So,  h e i g h t ( x ) = 7 + 7 + h e i g h t ( z ) = 1 4 + h e i g h t ( z )

i.e.,  ( x , z ) R

So, R is not transitive.

(d) R=  { ( x , y ) : x  is wife of y  }

For  x A ,

X is not wife of x.

So,  ( x , x ) R  i.e., R is not reflexive.

For  x , y A  and  ( x , y ) R  ,

X is wife of y but y is not wife of x

So,  ( y , x ) R  . i.e., R is not symmetric.

For  x , y , z A  and  ( x , y )  and  ( y , z ) R

X is wife of y

Y is wife of z

But y can never be husband & wife simultaneously

So, R is not transitive.

(e) R=  { ( x , y ) : x  is father of y  }

For  x A  ,

X is not a father of x

So,  ( x , x ) R  i.e., R is not reflexive.

For  x , y A  and  ( x , y ) R

X is father of y

Y is father of z

But x is not father of z

So,  ( x , z ) R  i.e., R is not transitive.

 

Q2. Show that the relation R in the set R of real numbers, defined as 

R = {(a, b): a ≤ b2} is neither reflexive nor symmetric nor transitive.

A.2. We have,

R=  { ( a , b ) : a b 2 }  is a relation in R.

For  a R  then is  b = a , a a 2  is not true for all real number less than 1.

Hence, R is not reflexive.

Let  ( a , b ) R  and a=1 and b=2

Then,  a b 2  =  1 2 2  =  1 4  so,  ( 1 , 2 ) R

But  ( b , a ) = ( 2 , 1 )

i.e.,  2 1 2  =  2 1  is not true

so,  ( 2 , 1 ) R

hence, R is not symmetric.

For,  ( a , b ) = ( 1 0 , 4 ) & ( b , c ) = ( 4 , 2 ) R

We have,  a = 1 0 4 2 = b 2  =>  1 0 1 6  is true

So,  ( 1 0 , 4 ) R

And  4 2 2  =>  4 4  So,  ( 4 , 2 ) R

But  1 0 2 2  =>  1 0 4  is not true.

So,  ( 1 0 , 2 ) R

Hence, R is not transitive.

 

Q3. Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as

R = {(a, b): b = a + 1} is reflexive, symmetric or transitive.

A.3. We have,

R=  { ( a , b ) : b = a + 1 }  is a relation in set  { 1 , 2 , 3 , 4 , 5 , 6 }

So, R=  { ( 1 , 2 ) , ( 2 , 3 ) , ( 3 , 4 ) , ( 4 , 5 ) , ( 5 , 6 ) , ( 6 , 7 ) }

As,  ( 1 , 1 ) R  , R is not reflexive

As,  ( 1 , 2 ) R  but  ( 2 , 1 ) R  , R is not symmetric

And as  ( 1 , 2 )  &  ( 2 , 3 ) R  but  ( 1 , 3 ) R

Hence, R is not transitive.

 

Q4. Show that the relation R in R defined as R = {(a, b): a ≤ b}, is reflexive and transitive but not symmetric.

A.4. We have, R=  { ( a , b ) : a b }  is a relation in R.

For,  a R  ,

a b  but  b a  is not possible i.e.,  ( b , a ) R

Hence, R is not symmetric.

For  ( a , b ) R & ( b , c ) R  and  a , b , c R

a b  and  b c

So,  a c

i.e.,  ( a , c ) R

 R is transitive.

 

Q5. Check whether the relation R in R defined as R = {(a, b): a ≤ b3} is reflexive, symmetric or transitive.

A.5. We have,

R=  { ( a , b ) : a b 3 }  is a relation in R.

For,  ( a , b ) R  and  a = 1 2  we can write

a a 3  =>  1 2 ( 1 2 ) 3  =>  1 2 1 8  which is not true.

So, R is not reflexive.

For  ( a , b ) = ( 1 , 2 ) R  we have,

a b 3  =>  1 2 3  =>  1 8  is true.

So,  ( 1 , 2 ) R

But  2 1 3  =>  2 1  is not true

So,  ( 2 , 1 ) R  and  ( b , a ) R

Hence, R is not symmetric.

For,  ( a , b ) = ( 1 0 , 4 )  and  ( b , c ) = ( 4 , 2 ) R

1 0 4 3  =>  1 0 6 4  is true=>  ( 1 0 , 4 ) R

4 2 3  =>  4 8  is true=>  ( 4 , 2 ) R

But  1 0 2 3  =>  1 0 8  is not true=>  ( 1 0 , 2 ) R

Hence, for  ( a , b ) , ( b , c ) R , ( a , c ) R

So, R is not transitive.

 

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

A.6. We have,

R=  { ( 1 , 2 ) , ( 2 , 1 ) }  is a relation in set  { 1 , 2 , 3 }

Then, as  ( 1 , 1 ) R  and  ( 2 , 2 ) R

So, R is not reflective

As  ( 1 , 2 ) R  and  ( 2 , 1 ) R

So, R is symmetric

And as  ( 1 , 2 ) R , ( 2 , 1 ) R  but  ( 1 , 1 ) R

So, R is not transitive.

 

Q7. Show that the relation R in the set A of all the books in a library of a college, given by R = {(x, y): x and y have same number of pages} is an equivalence relation.

A.7. We have,

R=  { ( x , y ) : x & y  have same number of pages  }  is a relation in set of A of all books in

For  ( x , y ) R & x , y A

As x=y=same no. of pages

Then,  ( x , x ) R

Hence, R is reflexive.

For  ( x , y ) R  and  x , y A

Also,  ( y , x ) R  ,  x = y

Hence, R is symmetric.

For  x , y , z A  and  ( x , y ) R  and  ( y , z ) R

x=y and y=z

x=z

i.e.,  ( x , z ) R

hence, R is also transitive

 R is an equivalence relation.

 

Q8. 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 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}.

A.8. We have,

R=  { ( a , b ) | a b |  is even  }  is a relation in set A=  { 1 , 2 , 3 , 4 , 5 }

For all  a A  ,  | a a | = 0  is even.

So,  ( a , a ) R  . Hence R is reflexive

For  a , b A  and  ( a , b ) R

| a b |  is even

| b + a |  is even  |

| ( b a ) |  is even

| b a |  is even

i.e.,  ( b , a ) R

Hence, R is symmetric.

For  a , b , c A  and  ( a , b ) R  and  ( b , c ) R

We have  | a b |  is even

and  | b c |  is even

then,  | a b | + | b c |  is even as even + even=even

| a b + b c |  is even

| a c |  is even

  ( a , c ) R

So, R is transitive.

 R is an equivalence relation

All elements of [1,3,5] are odd positive numbers and its subset are odd and their difference given an even number. Hence, they are related to each other.

Similarly, all elements of [2,4] are even positive numbers and its subset are even and their difference gives an even number. Hence, they are related to each other.

However, elements of [1,3,5] are related to elements of [2,4] since the difference of the two subsets is never even.

 

Q9. Show that each of the relation R in the set A = {x ∈  Z: 0 ≤  x ≤ 12} ,given by:

(i) R = { (a,b) : |a - b| is a multiple of 4}

(ii) R = { (a,b) : a= b} is an equivalence relation. Find the set of all elements related to 1 in each case.

A.9. We have,

A=  { x 2 , 0 x 1 2 }

The relation in set A is defined by

R= {  ( a , b ) : | a b |  is a multiple of 4}

For all  a A  ,

| a a | = 0  is a multiple of 4

So,  ( a , a ) R  i.e., R is reflexive

For  a , b A & ( a , b ) R  we have,

| a b |  is multiple of 4

| ( b a ) |  is multiple of 4

| b a |  is multiple of 4

So,  ( b , a ) R

i.e., R is symmetric

for  a , b , c A   & ( a , b ) R & ( b , c ) R

| a b |  &  | b c |  is a multiple of 4

So  | a b | + | b c |  is also a multiple of 4

| a b + b c |  is a multiple of 4

| a c |  is a multiple of 4

So,  ( a , c ) R

i.e., R is transitive

Hence, R is an equivalence relation.

Finding all set of elements related to 1

For  a A

Then,  ( a , 1 ) R  i.e.,  | a 1 |  is a multiple of 4

So, a can be 0 ≤ a ≤ 12

Only,

| 1 1 | = 0

| 5 1 | = 4  is a multiple of 4

| 9 1 | = 8

Hence, sets of elements related to A=  { 1 , 5 , 9 }

The relation in set A is defined as R=  { ( a , b ) : a = b }

For all  a A  ,

a=a is true

so,  ( a , a ) R

i.e., R is reflexive

for  a , b A & ( a , b ) R  we have,

a=b

b=a i.e.,  ( b , a ) R

so, R is symmetric

for  a , b , c A  ,  ( a , b ) R  and  ( b , c ) R  . We have,

a=b and b=c

a=c i.e.,  ( a , c ) R

 R is transitive

Hence, R is an equivalence relation

Find all sets of elements related to 1

For  a A  , we need  ( a , 1 ) R

i.e., a=1

so, set of elements related to 1 in A is {1}.

 

Q10. Given an example of a relation. Which is

(i) Symmetric but neither reflexive nor transitive.

(ii) Transitive but neither reflexive nor symmetric.

(iii) Reflexive and symmetric but not transitive.

(iv) Reflexive and transitive but not symmetric.

(v) Symmetric and transitive but not reflexive.

A.10. Let A=  { a , b , c }

(i) R= { ( a , b ) , ( b , a ) }  is a relation in set A

So,  ( a , b ) R  and  ( b , a ) R  Symmetric

( a , a ) R  not reflexive

( a , b ) R , ( b , a ) R  but  ( a , a ) R    not transitive

(ii) R= { ( a , b ) , ( b , c ) , ( a , c ) }  is a relation in set A

So,  ( a , a ) R  not reflexive

( a , b ) R  but  ( b , a ) R  not symmetric

( a , b ) R & ( b , c ) R  and also  ( a , c ) R  transitive

(iii) R= { ( a , a ) , ( b , b ) , ( c , c ) , ( a , b ) , ( b , a ) , ( a , c ) , ( c , a ) }

So,  ( a , a ) , ( b , b ) , ( c , c ) R  Reflexive

( a , b ) R ( b , a ) R  Symmetric

( a , c ) R ( c , a ) R

( b , a ) R  and  ( a , c ) R

But  ( b , c ) R  not transitive

(iv) R= { ( a , a ) , ( b , b ) , ( c , c ) , ( a , b ) , ( b , c ) , ( a , c ) }  is s relation in set A

So,  ( a , a ) , ( b , b ) , ( c , c ) R  reflexive

( a , b ) & ( b , c ) R  so,  ( a , c ) R  transitive

( a , b ) R  but  ( b , a ) R  not symmetric

(v) R= { ( a , a ) , ( a , b ) , ( b , a ) }

So,  ( b , b ) R  not reflexive

( a , b ) R  and  ( b , a ) R  symmetric

And  ( a , b ) R & ( b , a ) R

and also  ( a , a ) R  transitive

 

Q11. Show that the relation R in the set A of points in a plane given by R = {(P, Q): distance of the point P from the origin is same as the distance of the point Q from the origin}, is an equivalence relation. Further, show that the set of all point related to a point P ≠ (0, 0) is the circle passing through P with origin as centre.

A.11. The given relation in set A of points in a plane is

R=  { ( P , Q ) :  distance of point P from origin=distance of point Q from  o r i g i n }

If O is the point of origin

R=  { ( P , Q ) : P O = Q O }

Then, for  P A  we have PO=PO

So,  ( P , P ) R

i.e., P is reflexive

for,  P , Q A  and  ( P , Q ) R  we have

PO=QO

QO=PO i.e.,  ( Q , P ) R

i.e., R is symmetric

for  P , Q , S A  and  ( P , Q ) & ( Q , S ) R

PO=QO and QO=SO

PO=SO

i.e.,  ( P , S ) R

so, R is transitive

Hence, R is an equivalence relation

For a point  P ( o , o )  the set of all points related to P i.e., distance from origin to the points are equal is a circle with center at origin (o,o) by the definition of circle

 

Q12. Show that the relation R defined in the set A of all triangles as R = {(T1, T2): T1 is similar to T2}, is equivalence relation. Consider three right angle triangles T1 with sides 3, 4, 5, T2 with sides 5, 12, 13 and T3 with sides 6, 8, 10. Which triangles among T1, T2 and T3 are related?

A.12. The given relation to set A of all triangles is defined as

R=  { ( T 1 , T 2 ) : T 1  is similar to  T 2 }

For  T 1 A  ,

T 1  is always similar to  T 1

So,  ( T 1 , T 1 ) R  . Hence R is reflexive.

For  T 1 , T 2 A  and  ( T 1 , T 2 ) R  we have

T 1 T 2 ( s i m i l a r )

T 2 T 1  i.e.,  ( T 2 , T 1 ) R

so, R is symmetric.

for,  T 1 , T 2 , T 3 A  and  ( T 1 , T 2 ) R  and  ( T 2 , T 3 ) R

T 1 T 2  and  T 2 T 3

i.e.,  T 1 T 3   ( T 1 , T 3 ) R

so, R is transitive

 R is an equivalence relation.

Given, sides of  T 1  are 3,4,5

Sides of  T 2  are 5,12,13

Sides of  T 3  are 6,8,10

As  3 5 4 1 2 5 1 3  we conclude that  T 1  is not similar to  T 2

As  5 6 1 2 8 1 3 1 0  we conclude that  T 2  is not similar to  T 3

But as  3 6 = 4 8 = 5 1 0 = 1 2  we conclude that  T 1 T 3

Hence,  T 1  is related to  T 3

 

Q13. Show that the relation R defined in the set A of all polygons as R = {(P1, P2): P1 and  P2 have same number of sides}, is an equivalence relation. What is the set of all elements in A related to the right-angle triangle T with sides 3, 4 and 5?

A.13. The given relation in set A of all polygons is defined as

R=  { ( P 1 , P 2 ) : P 1  and  P 2  have same number of sides  }

Let  P 1 A  ,

As number of sides  ( P 1 )  = number of sides  ( P 1 )

( P 1 , P 1 ) R

So, R is reflexive.

Let  P 1 , P 2 A  and  ( P 1 , P 2 ) R

Then, number of sides of  P 1  = number of sides of  P 2

Number of sides of  P 2  = number of sides of  P 1

i.e.,  ( P 2 , P 1 ) R

so, R is symmetric.

Let  P 1 , P 2 , P 3 A  and  ( P 1 , P 2 )  and  ( P 2 , P 3 ) R

Then, number of sides  ( P 1 )  = number of sides  ( P 2 )

Number of sides  ( P 2 )  = number of sides  ( P 3 )

So, number of sides  ( P 1 )  = number of sides  ( P 3 )

I.e.,  ( P 1 , P 3 ) R

So, R is transitive.

Hence, R is an equivalence relation.

The set of all triangles will be the elements in A related to the right-angle triangle T with sides 3,4 and 5 as they all have three number of sides.

 

Q14. Let L be the set of all lines in XY plane and R be the relation in L defined as R = {(L1, L2): L1 is parallel to L2}. Show that R is an equivalence relation. Find the set of all lines related to the line y = 2x + 4.

A.14. The given relation in the set  L =  all lines in  X Y  plane is defined as

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

Let  L 1 A  then as  L 1  is parallel to  L 1  ,

( L 1 , L 1 ) R

So,  R  is reflexive

Let  L 1 , L 2 A  and  ( L 1 , L 1 ) R

Then,  L 1  is parallel to  L 2

L 2  is parallel to  L 1

So,  ( L 2 , L 1 ) R

i.e.,  R  is symmetric

Let  L 1 , L 2 , L 3 A  and  ( L 1 , L 2 )  and  ( L 2 , L 3 ) R

Then,  L 1 L 2  and  L 2 L 3

So,  L 1 L 3

i.e.,  ( L 1 , L 2 ) R

So,  R  is transitive

Hence,  R  is an equivalence relation

The set of lines related to  y = 2 x + 4  is given by the equation  y = 2 x + C  where  C  is some constant.

 

Q15.  Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Choose the correct answer.

(A) R is reflexive and symmetric but not transitive.

(B) R is reflexive and transitive but not symmetric.

(C) R is symmetric and transitive but not reflexive.

(D) R is an equivalence relation.

A.15. The set in  A = { 1 , 2 , 3 , 4 }

The relation in this set  A  is given by

R = { ( 1 , 2 ) , ( 2 , 2 ) , ( 1 , 1 ) , ( 4 , 4 ) , ( 1 , 3 ) , ( 3 , 3 ) , ( 3 , 2 ) }

R  is reflexive as  ( 1 , 1 ) , ( 2 , 2 ) , ( 3 , 3 ) , ( 4 , 4 ) R

As,  ( 1 , 2 ) R  but  ( 2 , 1 ) R

R  is not symmetric

For  ( 1 , 2 ) R  and  ( 2 , 2 ) R ; ( 1 , 2 ) R

And for  ( 1 , 3 ) R  and  ( 3 , 2 ) R ; ( 1 , 3 ) R

∴  R  is transitive

Hence, option (B) is correct

 

Q16. Let R be the relation in the set N given by R = {(a, b): a = b − 2, b > 6}. Choose the correct answer.

(A) (2, 4) ∈ R (B) (3, 8) ∈R (C) (6, 8) ∈R (D) (8, 7) ∈ R

A.16. The given relation in set N defined by

R = { ( a , b ) : a = b 2 , b > 6 }

For (2,4),       4>6 is not true

For (3,8),    8>6  but  3= 8-2 ⇒3=6 is not true

For (6,8),     8>6 and 6= 8-2 ⇒6=6 is true

And for (8,7), 7>6 but 8= 7-2 ⇒8=5 is not true

Hence, option (C) is correct

Maths Ncert Solutions class 12th Logo

Class 12 Math Chapter 1 Relation and Function Exercise 1.2 Solutions

Chapter 1 Relation and Function Exercise 1.2 mainly focuses on functions and their types, such as many-one, onto, and into, and one-one functions. It also deals with problems of finding the range, domain, co-domain, and other elements of functions. Class 12 Math Relation and Function Exercise 1.2 consists of 12 Questions (10 Short Answers, 2 MCQ).  students can check the complete solutions for exercise 1.2 below;

Relation and Function Exercise 1.2 Solutions

Q1. Show that the function f: R* → R* defined by f(x) = 1/x is one-one and onto, where: R* is the set of all non-zero real numbers. Is the result true, if the domain: R* is replaced by N with the co-domain being same as: R*?

A.1. The  f x  n is  f ( x ) = 1 x  , which is a  f : R *     R *  and  R *  is set of all non-zero real numbers

For,  x 1 , x 2 R * , f ( x 1 ) = f ( x 2 )

1 x 1 = 1 x 2

x 1 = x 2  So,  f  is one-one

For,  y R * ,   x = 1 f ( x ) = 1 y  such that

So,  f ( x ) = y

So, every element in the co-domain has a pre-image in  f

So,  f  is onto

If  f : N R *  such that  f ( x ) = 1 x

For,  x 1 , x 2 N ,   f ( x 1 ) = f ( x 2 )

1 x 1 = 1 x 2

x 1 = x 2  So,  f  is one-one

For,  y R *  and  f ( x ) = y  we have  x = 1 y N

Eg.,  3 R *  so  x = 1 3 N

So,  f  is not onto

 

Q2. Check the injectivity and surjectivity of the following functions:

(i) f: N → N given by f(x) = x2

(ii) f: Z → Z given by f(x) = x2

(iii) f: R → R given by f(x) = x2

(iv) f: N → N given by f(x) = x3

(v) f: Z → Z given by f(x) = x3

A.2. (i) f : N N  given by  f ( x ) = x 2

For,  x 1 , x 2 N  ,  f ( x 1 ) = f ( x 2 )

x 1 2 = x 2 2

x 1 = x 2 N

So,  f  is one-one/ injective

For  x N  , i.e.,  x = 1 , 2 , 3 . . . .

Range of  f ( x ) = { 1 2 , 2 2 , 3 2 . . . } = { 1 , 4 , 9 . . . } N

i.e., co-domain of  N

So,  f  is not onto/ subjective

(ii) f : Z Z  given by  f ( x ) = x 2

For,  x 1 , x 2 Z  ,  f ( x 1 ) = f ( x 2 )

x 1 2 = x 2 2

x 1 = ± x 2 Z

i.e.,  x 1 = x 2  and  x 1 = x 2

So,  f  is not one-one/ injective

For  x Z  ,  x = 0 , ± 1 , ± 2 , ± 3 . . . .

Range of  f ( x ) = { 0 2 , ( ± 1 ) 2 , ( ± 2 ) 2 , ( ± 3 ) 2 . . . }

{ 0 , 1 , 4 , 9 . . . . }  co-domain  Z

So,  f  is not onto/ subjective

(iii) f : R R  given by  f ( x ) = x 2

For,  x 1 , x 2 R  ,  f ( x 1 ) = f ( x 2 )

x 1 2 = x 2 2

x 1 = ± x 2

So,  f  is not injective

For  x R

Range of  f ( x ) = { x 2 , x R }  gives a set of all positive real numbers

Hence, range of  f ( x )  co-domain of  R

So,  f  is not subjective

(iv) f : N N  given by  f ( x ) = x 3

For,  x 1 , x 2 N  ,  f ( x 1 ) = f ( x 2 )

x 1 3 = x 2 3

x 1 = x 2 N

So,  f  is injective

For  x N ,

Range of  f ( x ) = { 1 3 , 2 3 , 3 3 . . . . }

{ 1 , 8 , 2 7 . . . . }  co-domain of  N

So,  f  is not subjective

(v) f : R R  given by  f ( x ) = x 3

For,  x 1 , x 2 N  ,  f ( x 1 ) = f ( x 2 )

x 1 3 = x 2 3

x 1 = x 2 N

So,  f  is injective

For  x R ,

Range of  f ( x ) = { 1 3 , 2 3 , 3 3 . . . . }

{ 1 , 8 , 2 7 . . . . }  co-domain of R

So,  f  is not subjective

 

Q3.Prove that the Greatest Integer Function f: R → R given by f(x) = [x], is neither one-one nor onto, where [x] denotes the greatest integer less than or equal to x.

A.3. The  f x n   f : R R  is given by  f ( x ) = [ x ]

Let  x 1 = 1 . 5  and  x 2 = 1 . 2 R  Then,

f ( x 1 ) = f ( 1 . 5 ) = [ 1 . 5 ] = 1

f ( x 2 ) = f ( 1 . 2 ) = [ 1 . 2 ] = 1

So,  f ( x 1 ) = f ( x 2 )  but  x 1 x 2

i.e.,  f ( 1 . 5 ) = f ( 1 . 2 )  but  1 . 5 1 . 2

So,  f  is not one-one

The range of  f ( x )  is a set of all integers,  Z  which is not a co-domain of  R

f  is not onto

 

Q4. Show that the Modulus Function f : R → R, given by f(x) = |x| is neither one-one nor onto, where is |x| if  x is positive or 0 and |-x| is -x  if  x is negative.

A.4. The  f x n   f : R R  is given by  f ( x ) = | x |

f ( x ) = ( x , i f x 0 x , i f x < 0 )

For  x 1 = 1  and  x 2 = 1

f ( x 1 ) = f ( 1 ) = | 1 | = 1

f ( x 2 ) = f ( 1 ) = | 1 | = 1

So,  f ( x 1 ) = f ( x 2 )  but  x 1 x 2

i.e.,  f  is not one-one

For  x = 1 R

f ( x ) = | x |

i.e.,  f ( 1 ) = | 1 | = 1

So, range of  f ( x )  is always a positive real number and is not equal to the co-domain  R

i.e.,  f  is not onto

 

Q5. Show that the Signum Function f: R → R , given by

f ( x ) = { 1 i f x > 0 0 i f x = 0 1 i f x < 0   is neither one-one nor onto.

A.5. The  f x n   f : R R  is given by  f ( x ) = ( 1 i f x > 0 0 i f x = 0 1 i f x < 0 )

For  x 1 = 1 , x 2 = 2 , R

f ( x 1 ) = f ( 1 ) = 1

f ( x 2 ) = f ( 2 ) = 1  but  1 2

So,  f  is not one-one

And the range of  f ( x ) = { 1 , 0 , 1 }  hence it is not equal to the co-domain  R

So,  f  is not onto

 

Q6. 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. Show that f is one-one.

A.6. Given,  f : A B  and  f = { ( 1 , 4 ) , ( 2 , 5 ) , ( 3 , 6 ) }

f ( 1 ) = 4 f ( 2 ) = 5 f ( 3 ) = 6

i.e., the image elements of  A  under the given  f X n   f  are unique

So,  f  is one-one

 

Q7. In each of the following cases, state whether the function is one-one, onto or bijective. Justify your answer.

(i) f: R → R defined by f(x) = 3 − 4x

(ii) f: R → R defined by f(x) = 1 + x2

A.7. (i) f : R R  defined as  f ( x ) = 3 4 x

For  x 1 , x 2 R  such that  f ( x 1 ) = f ( x 2 )

3 4 x 1 = 3 4 x 2 4 x 1 = 4 x 2 x 1 = x 2

So,  f  is one-one

For  y R  , there exist

f ( . 3 y 4 ) = 3 4 ( 3 y 4 ) = 3 3 + y = y

Hence,  f  is onto

f  is bijective

(ii)Given, f : R R  defined as  f ( x ) = 1 + x 2

For  x 1 , x 2 R  such that  f ( x 1 ) = f ( x 2 )

1 + x 1 2 = 1 + x 2 2 x 1 2 = x 2 2 x 1 = ± x 2

x 1 = x 2  or  x 1 = x 2

f  is not one-one

The range of  f ( x )  is always a positive real number which is not equal to co-domain  R

So,  f  is not onto

 

Q8. Let A and B be sets. Show that f: A × B → B × A such that (a, b) = (b, a) is bijective function.

A.8. Given,  f : A × B B × A  defined as  f ( a , b ) = ( b , a )

Let  ( a 1 , b 1 ) , ( a 2 , b 2 ) A × B  such that

f ( a 1 , b 1 ) = f ( a 2 , b 2 )

( b 1 , a 1 ) = ( b 2 , a 2 )

So,  b 1 = b 2  and  a 1 = a 2

( a 1 , b 1 ) = ( a 2 , b 2 )

f  is one-one

For  ( a , b ) B × A

There exist  ( a , b ) A × B  such that  f ( a , b ) = ( b , a )

f  is onto

Hence,  f  is bijective

 

Q9. Let N → N be defined by f(n) for all

 

State whether the function f is bijective. Justify your answer.

A.9. Given,  f : N N  defined  f ( x ) = ( x + 1 2 , i f x i s o d d x 2 , i f x i s e v e n )   x N

Let  x 1 = 1  and  x 2 = 2 N ,

f ( x 1 ) = f ( x 2 ) f ( 1 ) = f ( 2 )

1 + 1 2 = 2 2

1 = 1  but  1 2

So,  f  is not one-one

For  x =  odd and  x N  , say  x = 2 C + 1  where  C N

There exist  ( 4 C + 1 )   N  such that

( 4 C + 1 ) = 4 C + 1 + 1 2 = 2 C + 1 . N

And for  x =  even  N  , say  x = 2 C  where  C N

There exist  ( 4 C ) N  such that

f ( 4 C ) = 4 C 2 = 2 C . N

So,  f  is onto

But,  f  is not bijective

 

Q10. Let A = R – {3} and B = R – {1}. Consider the function f : A → B defined by f(x)  = (x-2/x-3) Is f one-one and onto? Justify your answer.

A.10. Given,  f : A B  defined by  f ( x ) = ( x 2 x 3 )

Let  x 1 , x 2 A = R { 3 }  such that

f ( x 1 ) = f ( x 2 )

x 1 2 x 1 3 = x 2 2 x 2 3

( x 1 2 ) ( x 2 3 ) = ( x 2 2 ) ( x 1 3 )

x 1 x 2 3 x 1 2 x 2 + 6 = x 2 x 1 3 x 2 2 x 1 + 6

2 x 1 3 x 1 = 2 x 2 3 x 2

x 1 = x 2

x 1 = x

So,  f  is one-one

For  y B = R { 1 }  there exist  f ( x ) = y  such that

x 2 x 3 = y

x 2 = x y 3 y

x x y = 2 3 y

x ( 1 y ) = 2 3 y

x = 2 3 y 1 y  where  y 1 . A

Thus,  f ( 2 3 y 1 y ) = ( 2 3 y 1 y ) 2 ( 2 3 y 1 y ) 3 = 2 3 y 2 + 2 y 2 3 y 3 + 3 y

y 1 = y

f  is onto

 

Q11. Let f: R → R be defined as f(x) = x4. Choose the correct answer.

(A) f is one-one onto

(B) f is many-one onto

(C) f is one-one but not onto

(D) f is neither one-one nor onto

A.11. Given,  f : R R  defined by  f ( x ) = x 4

For  x 1 , x 2 R  such that  f ( x 1 ) = f ( x 2 )

x 1 4 = x 2 4

x 1 = ± x 2

x 1 = x 2  or  x 1 = x 2

So,  f  is not one-one

The range of  f ( x )  is a set of all positive real numbers which is not equal to co-domain  R

So,  f  in not onto

 Option (D) is correct

 

Q12.Let f: R → R be defined as f(x) = 3x. Choose the correct answer.

(A) f is one-one onto

(B) f is many-one onto

(C) f is one-one but not onto

(D) f is neither one-one nor onto

A.12. Given,  f : R R  defined as  f ( x ) = 3 x

For  x 1 , x 2 R  such that  f ( x 1 ) = f ( x 2 )

3 x 1 = 3 x 2

x 1 = x 2

So,  f  is one-one

And for  y R  , there exist  y 3 R  such that

f ( y 3 ) = 3 × y 3 = y

f  is onto

Hence, option (A) is correct.

Maths Ncert Solutions class 12th Logo

Class 12 Math Chapter 1 Relation and Function Old NCERT Solutions

Students can also check the old NCERT solutions of relation and function chapter below for exercises 1.3 and 1.4  solutions. These topics are dropped from the latest CBSE syllabus, Exercise 1.3 & 1.4 discusses composition of functions and the inverse of functions. These topics are still relevant for competitive exams like JEE main, CUSAT CAT, MHT CET, and others.

Relation and Function Exercise 1.3 Solutions

Q1. Let f: {1, 3, 4} → {1, 2, 5} and g: {1, 2, 5} → {1, 3} be given by f = {(1, 2), (3, 5), (4, 1)} and g = {(1, 3), (2, 3), (5, 1)}. Write down gof.

A.1. The functions f: {1, 3, 4} → {1, 2, 5} and g: {1, 2, 5} → {1, 3} are defined as

f = {(1, 2), (3, 5), (4, 1)} and g = {(1, 3), (2, 3), (5, 1)}.

gof(1) = g(f(1)) = g(2) = 3 [f(1) = 2 and g(2) = 3]

gof(3) = g(f(3)) = g(5) = 1[f(3) = 5 and g(5) = 1]

gof(4) = g(f(4)) = g(1) = 3[f(4) = 1 and g(1) = 3]

 gof = {(1, 3), (3, 1), (4, 3)}

 

Q2. Let f, g and h be functions from R to R. Show that:

(f + g) oh = foh + goh

(f.g) oh = (foh). (goh)

A.2. To prove:

( f + g ) o h = f o h + g o h c o n s i d e r : ( ( f + g ) o h ) ( x ) = ( f + g ) ( h ( x ) ) = f ( h ( x ) ) + g ( h ( x ) ) = ( f o h ) ( x ) + ( g o h ) ( x ) = { ( f o h ) + ( g o h ) } ( x ) ( ( f + g ) o h ) ( x ) = { ( f o h ) + ( g o h ) } ( x ) , x R H e n c e , ( f + g ) o h = f o h + g o h

To prove

( f . g ) o h = ( f o h ) . ( g o h ) C o n s i d e r ( ( f . g ) o h ) ( x ) = ( f . g ) ( h ( x ) ) = f ( h ( x ) ) . g ( h ( x ) ) = ( f o h ) ( x ) . ( g o h ) ( x ) = { ( f o h ) . ( g o h ) } ( x ) ( ( f . g ) o h ) ( x ) = { ( f o h ) . ( g o h ) } ( x ) , x R H e n c e , ( f . g ) o h = ( f o h ) . ( g o h )

 

Q3. Find gof and fog , if:

(i) f(x) = |x| and g(x) = |5x - 2|

(ii) f(x) = 8x3 and g(x) = x1/3

A.3.

 

Q4. If  f ( x ) = 4 x + 3 6 x 4 , x 2 3    show that( fof) (x) = x for all x ≠ 2/3 What is the inverse of f

A.4. It is given that  f ( x ) = 4 x + 3 6 x 4 , x 2 3

( f o f ) ( x ) = f ( f ( x ) ) = f ( 4 x + 3 6 x 4 ) = 4 ( 4 x + 3 6 x 4 ) + 3 6 ( 4 x + 3 6 x 4 ) 4 = 1 6 x + 1 2 + 1 8 x 1 2 2 4 x + 1 8 2 4 x + 1 6 = 3 4 x 3 4 = x

Therefore  f o f ( x ) = x  for all  x 2 3

f o f = 1

Hence, the given function f is invertible and the inverse of f is itself.

 

Q5. State with reason whether following functions have inverse

(i) f: {1, 2, 3, 4} → {10} with f = {(1, 10), (2, 10), (3, 10), (4, 10)}

(ii) g: {5, 6, 7, 8} → {1, 2, 3, 4} with g = {(5, 4), (6, 3), (7, 4), (8, 2)}

(iii) h: {2, 3, 4, 5} → {7, 9, 11, 13} with h = {(2, 7), (3, 9), (4, 11), (5, 13)}

A.5. (i) f: {1, 2, 3, 4} → {10} defined as:

f = {(1, 10), (2, 10), (3, 10), (4, 10)}

From the given definition of f, we can see that f is a many one function as: f(1) = f(2) = f(3) = f(4) = 10

∴f is not one-one.

Hence, function f does not have an inverse.

(ii) g: {5, 6, 7, 8} → {1, 2, 3, 4} defined as:

g = {(5, 4), (6, 3), (7, 4), (8, 2)}

From the given definition of g, it is seen that g is a many one function as: g(5) = g(7) = 4.

∴g is not one-one, 

Hence, function g does not have an inverse.

(iii) h: {2, 3, 4, 5} → {7, 9, 11, 13} defined as:

h = {(2, 7), (3, 9), (4, 11), (5, 13)}

It is seen that all distinct elements of the set {2, 3, 4, 5} have distinct images under h. 

∴Function h is one-one.

Also, h is onto since for every element y of the set {7, 9, 11, 13}, there exists an element x in the set {2, 3, 4, 5} such that h(x) = y.

Thus, h is a one-one and onto function. Hence, h has an inverse.

 

Q6. Show that f: [-1, 1] → R given by f(x) =  x/x+2 is one-one. Find the inverse of the function f: [-1, 1] → Range f

A.6.   f : [ 1 , 1 ] R  is given as  f ( x ) = x x + 2

L e t , f ( x ) = f ( y ) . x x + 2 = y y + 2 x y + 2 x = x y + 2 y 2 x = 2 y x = y

 f is a one-one function.

It is clear that  f : [ 1 , 1 ]  Range f is onto.

  f : [ 1 , 1 ]  Range f is one-one onto and therefore, the inverse of the function:

f : [ 1 , 1 ]  Range f exists.

Let g: Range  f [ 1 , 1 ]  be the inverse of f.

Let y be an arbitrary element of range f.

Since  f : [ 1 , 1 ]  Range f is onto, we have:

y = x x + 2 x y + 2 y = x x ( 1 y ) = 2 y x = 2 y 1 y , y 1 g ( y ) = 2 y 1 y , y 1 N o w , ( g o f ) ( x ) = g ( f ( x ) ) = g ( x x + 2 ) = 2 ( x x + 2 ) 1 x x + 2 = 2 x x + 2 x = 2 x 2 = x ( f o g ) ( y ) = f ( g ( y ) ) = f ( 2 y 1 y ) = 2 y ( 1 y ) ( 2 y 1 y ) + 2 = 2 y 2 y + 2 2 y = 2 y 2 = y g o f = I 1 , 1 , a n d , f o g I R a n g e , f f 1 = g f 1 ( y ) = 2 y 1 y , y 1

 

Q7. Consider f : R→ R given by f(x) = 4x + 3 Show that f is invertible. Find the inverse of f.

A.7.  f : R R  is given by,

f ( x ) = 4 x + 3 O n e o n e : L e t , f ( x ) = f ( y ) . 4 x + 3 = 4 y + 3 4 x = 4 y x = y

 f is a one-one function.

Onto:

F o r , y R , l e t , y = 4 x + 3 . x = y 3 4 R

Therefore, for any  y R  , there exists  x = y 3 4 R  such that

f ( x ) = f ( y 3 4 ) = 4 ( y 3 4 ) + 3 = y

 f is onto.

Thus, f is one-one and onto and therefore,  f 1  exists.

Let us define  g : R R  by  g ( x ) = y 3 4

N o w , ( g o f ) ( x ) = g ( f ( x ) ) = g ( 4 x + 3 ) = ( 4 x + 3 ) 3 4 = x ( f o g ) ( y ) = f ( g ( y ) ) = f ( y 3 4 ) = 4 ( y 3 4 ) + 3 = y 3 + 3 = y g o f = f o g = I R

Hence, f is invertible and the inverse of f is given by

f 1 = g ( y ) = y 3 4

 

Q8. Consider f: R+ → [4, ∞)  given by f(x) = x2 + 4 Show that f is invertible with the inverse f−1 of f given by f−1(y)  = √y - 4  where R+ is the set of all non-negative real numbers.

A.8.   f : R + [ 4 , )  is given as  f ( x ) = x 2 + 4  .

One-one:

L e t , f ( x ) = f ( y ) . x 2 + 4 = y 2 + 4 x 2 = y 2 x = y [ a s , x = y R ]

f  is a one-one function.

 

Q10.   Let f: X → Y be an invertible function. Show that f has unique inverse.

(Hint: suppose g1 and g2 are two inverses of f. Then for all y ∈ Y, fog1(y) = IY(y) = fog2(y). Use one-one ness of f).

A.10. Let  f : X Y  be an invertible function.

Also, suppose f has two inverses (say g1 and g2 ).

Then, for all y ∈ Y, we have:

f o g 1 ( y ) = I y ( y ) = f o g 2 ( y ) f ( g 1 ( y ) ) = f ( g 2 ( y ) )  [f is invertible => f is one-one]

g 1 = g 2  [g is one-one]

Hence, f has a unique inverse.

 

Q11. Consider f: {1, 2, 3} → {a, b, c} given by f(1) = a, f(2) = b and f(3) = c. Find f−1  and show that (f−1)−1 = f.

A.11.  f ( 1 ) = a , f ( 2 ) b , a n d , f ( 3 ) = c

If we define  g : { a , b , c } { 1 , 2 , 3 } a s , g ( a ) = 1 , g ( b ) = 2 , g ( c ) = 3 ,  then we have:

   ( f o g ) ( a ) = f ( g ( a ) ) = f ( 1 ) = a ( f o g ) ( b ) = f ( g ( b ) ) = f ( 2 ) = b ( f o g ) ( c ) = f ( g ( c ) ) = f ( 3 ) = c A n d ( g o f ) ( 1 ) = g ( f ( 1 ) ) = f ( a ) = 1 ( g o f ) ( 2 ) = g ( f ( 2 ) ) = f ( b ) = 2 ( g o f ) ( 3 ) = g ( f ( 3 ) ) = f ( c ) = 3 g o f = I X a n d , f o g = I Y W h e r e , X = { 1 , 2 , 3 } , a n d , Y = { a , b , c } .

Thus, the inverse of f exists and  f 1 = g .

f 1 : { a , b , c } { 1 , 2 , 3 }  is given by,

f 1 ( a ) = 1 , f 1 ( b ) = 2 , f 1 ( c ) = 3

Let us now find the inverse of  f 1  i.e., find the inverse of g.

If we define  h : { 1 , 2 , 3 } { a , b , c } a s

h ( 1 ) = a , h ( 2 ) = b , h ( 3 ) = c  , then we have

( g o h ) ( 1 ) = g ( h ( 1 ) ) = g ( a ) = 1 ( g o h ) ( 2 ) = g ( h ( 2 ) ) = g ( b ) = 2 ( g o h ) ( 3 ) = g ( h ( 3 ) ) = g ( c ) = 3 A n d ( h o g ) ( a ) = h ( g ( a ) ) = h ( 1 ) = a ( h o g ) ( b ) = h ( g ( b ) ) = h ( 2 ) = b ( h o g ) ( c ) = h ( g ( c ) ) = h ( 3 ) = c g o h = I X a n d , h o g = I Y W h e r e , X = { 1 , 2 , 3 } , a n d , Y = { a , b , c } .

Thus, the inverse of g exists and  g 1 = h ( f 1 ) 1 = h .

It can be noted that h=f.

Hence,  ( f 1 ) 1 = f .

Q12. Let f: X → Y be an invertible function. Show that the inverse of f−1 is f, i.e., (f−1)−1 = f.

A.12. Let f: X → Y be an invertible function. 

Then, there exists a function g: Y → X such that gof = IX and fog = IY. 

Here, f−1 = g. 

Now, gof = IX and fog = IY

⇒ f−1 of = IX and fof−1 = IY

Hence, f−1 : Y → X is invertible and f is the inverse of f−1 

i.e., (f−1)−1  = f.

 

Q13.  If  f : R R  be given by  f ( x ) = ( 3 x 3 ) 1 3  , then f of(x) is

(A) 1/x3

(B) x3

(C) x

(D) (3 − x3)

A.13. f : R R  is given as  f ( x ) = ( 3 x 3 ) ( 1 / 3 )

f ( x ) = ( 3 x 3 ) 1 3 f o f ( x ) = f ( f ( x ) ) = f ( ( 3 x 3 ) 1 3 ) = [ 3 ( ( 3 x 3 ) 1 3 ) 3 ] 1 3 = [ 3 ( 3 x 3 ) ] 1 3 = ( x 3 ) 1 3 = x f o f ( x ) = x

The correct answer is C.

 

Q14. Let  f : R { 4 3 } R  be a function defined as  f ( x ) = 4 x 3 x + 4  . The inverse of f is map g Range  f R { 4 3 }

g ( y ) = 3 y 3 4 y

g ( y ) = 4 y 4 3 y

g ( y ) = 4 y 3 4 y

g ( y ) = 3 y 4 3 y

A.14. It is given that  f : R { 4 3 } R  is defined as  f ( x ) = 4 x 3 x 4

Let y be an arbitrary element of Range f.

Then, there exists  x R { 4 3 }  such that  y = f ( x )

y = 4 x 3 x + 4

3 x y + 4 y = 4 x  let us define g: Range  f R { 4 3 } a s , g ( y ) = 4 y 4 3 y

x ( 4 3 y ) = 4 y N o w , ( g o f ) ( x ) = g ( f ( x ) ) = g ( 4 x 3 x + 4 ) x = 4 y 4 3 y = 4 ( 4 x 3 x + 4 ) 4 3 ( 4 x 3 x + 4 ) = 1 6 x 1 2 x + 1 6 1 2 x = 1 6 x 1 6 = x A n d , ( f o g ) ( y ) = f ( g ( y ) ) = f ( 4 y 4 3 y ) = 4 ( 4 y 4 3 y ) 3 ( 4 y 4 3 y ) + 4 = 1 6 y 1 2 y + 1 6 1 2 y = 1 6 y 1 6 = y g o f = I R ( 4 3 ) a n d , f o g = I _ " R a n g e , f "

Thus, g is the inverse of f i.e.,  f 1 = g .

Hence, the inverse of f is the map g: Range  f R { 4 3 }  which is given by

g ( y ) = 4 y 4 3 y

The correct answer is B.

 

EXERCISE 1.4

Q1. Determine whether or not each of the definition of given below gives a binary operation. In the event that * is not a binary operation, give justification for this.

(i) On Z+ , define * by a * b = a − b

(ii) On Z+, define * by a * b = ab

(iii) On R, define * by a * b = ab2

(iv) On Z+, define * by a * b = |a − b|

(v) On Z+, define * by a * b = a

A.1. (i) On Z+, * is defined by a * b = a − b.

It is not a binary operation as the image of (1, 2) under * is 1 * 2 = 1 − 2= −1 ∉ Z+.

(ii) On Z+, * is defined by a * b = ab.

It is seen that for each a, b ∈ Z+, there is a unique element ab in Z+.

This means that * carries each pair (a, b) to a unique element a * b = ab in Z+.

Therefore, * is a binary operation.

(iii) On R, * is defined by a * b = ab2.

It is seen that for each a, b ∈ R, there is a unique element ab2 in R. 

This means that * carries each pair (a, b) to a unique element a * b = ab2 in R.

Therefore, * is a binary operation.

(iv) On Z+, * is defined by a * b = |a − b|.

It is seen that for each a, b ∈ Z+, there is a unique element |a − b| in Z+

This means that * carries each pair (a, b) to a unique element a * b = |a − b| in Z+.

Therefore, * is a binary operation.

(v) On Z+, * is defined by a * b = a.

* carries each pair (a, b) to a unique element a * b = a in Z+.

Therefore, * is a binary operation.

 

Q2. For each binary operation * defined below, determine whether * is commutative or associative:

(i) On Z, define a * b = a − b

(ii) On Q, define a * b = ab + 1

(iii) On Q, define a * b =ab/2

(iv) On Z+, define a * b = 2ab

(v) On Z+, define a * b = ab

(vi) On R − {−1}, define  a.b = a/b+1

A.2. (i) On Z, * is defined by a * b = a − b.

It can be observed that 1 * 2 = 1 − 2 = 1 and 2 * 1 = 2 − 1 = 1.

∴1 * 2 ≠ 2 * 1; where 1, 2 ∈ Z

Hence, the operation * is not commutative.

Also we have:

(1 * 2) * 3 = (1 − 2) * 3 = −1 * 3 = −1 − 3 = −4

1 * (2 * 3) = 1 * (2 − 3) = 1 * −1 = 1 − (−1) = 2

∴(1 * 2) * 3 ≠ 1 * (2 * 3) ; where 1, 2, 3 ∈ Z

Hence, the operation * is not associative.

(ii) On Q, * is defined by a * b = ab + 1.

It is known that:

ab = ba & mn For E; a, b ∈ Q

⇒ ab + 1 = ba + 1 & mn For E; a, b ∈ Q

⇒ a * b = a * b &mn For E; a, b ∈ Q

Therefore, the operation * is commutative.

It can be observed that:

(1 * 2) * 3 = (1 × 2 + 1) * 3 = 3 * 3 = 3 × 3 + 1 = 10

1 * (2 * 3) = 1 * (2 × 3 + 1) = 1 * 7 = 1 × 7 + 1 = 8

∴(1 * 2) * 3 ≠ 1 * (2 * 3) ; where 1, 2, 3 ∈ Q

Therefore, the operation * is not associative.

(iii) On Q, * is defined by a * b = ab/2

It is known that:

ab = ba &mnForE; a, b ∈ Q

⇒ab/2 = ba/2 &mnForE; a, b ∈ Q

⇒ a * b = b * a &mnForE; a, b ∈ Q

Therefore, the operation * is commutative.

For all a, b, c ∈ Q, we have:

( a b ) c = ( a b 2 ) c = ( a b 2 ) c 2 = a b c 4 a ( b c ) = a ( b c 2 ) = a ( b c 2 ) 2 = a b c 4 ( a b ) c = a ( b c )

Therefore, the operation * is associative.

(iv) On Z+, * is defined by * b = 2ab.

It is known that:

ab = ba &mnForE; a, b ∈ Z+

⇒ 2ab = 2ba &mnForE; a, b ∈ Z+

⇒ a * b = b * a &mnForE; a, b ∈ Z+

Therefore, the operation * is commutative.

It can be observed that:

( 1 2 ) 3 = 2 ( 1 × 2 ) 3 = 4 3 = 2 4 × 3 = 2 1 2 1 ( 2 3 ) = 1 2 2 × 3 = 1 2 6 = 1 6 4 = 2 6 4

∴(1 * 2) * 3 ≠ 1 * (2 * 3) ; where 1, 2, 3 ∈ Z+

Therefore, the operation * is not associative.

(v) On Z+, * is defined by * b = ab.

It can be observed that:

 1 x2 = 12=1 and 2x 1 =21 = 2

∴ 1 * 2 ≠ 2 * 1 ; where 1, 2 ∈ Z+

Therefore, the operation * is not commutative.

It can also be observed that:

( 2 3 ) 4 = 2 3 4 = 8 4 = 8 4 = ( 2 3 ) 4 = 2 1 2 2 ( 3 4 ) = 2 3 4 = 2 8 1 = 2 8 1

∴(2 * 3) * 4 ≠ 2 * (3 * 4) ; where 2, 3, 4 ∈ Z+

Therefore, the operation * is not associative.

(vi) On R, * − {−1} is defined by a.b = a/b+1

It can be observed that 1 x 2 = 1/2+1 = 1/2 and 2 x 1 = 2/1+1 = 2/2

∴1 * 2 ≠ 2 * 1 ; where 1, 2 ∈ R − {−1}

Therefore, the operation * is not commutative.

It can also be observed that:

( 1 2 ) 3 = 1 3 3 = 1 3 3 + 1 = 1 1 2 1 ( 2 3 ) = 1 2 3 + 1 = 1 2 4 = 1 1 2 = 1 1 2 + 1 = 1 3 2 = 2 3

∴ (1 * 2) * 3 ≠ 1 * (2 * 3) ; where 1, 2, 3 ∈ R − {−1}

Therefore, the operation * is not associative.

 

Q3. Consider the binary operation ∨ on the set {1, 2, 3, 4, 5} defined by a ∨b = min {a, b}. Write the operation table of the operation∨.

A.3. The binary operation ∨ on the set {1, 2, 3, 4, 5} is defined as a ∨ b = min {a, b} &mn For E; a, b ∈ {1, 2, 3, 4, 5}.

Thus, the operation table for the given operation ∨ can be given as:

1

2

3

4

5

1

1

1

1

1

1

2

1

2

2

2

2

3

1

2

3

3

3

4

1

2

3

4

4

5

1

2

3

4

5

 

Q4. Consider a binary operation * on the set {1, 2, 3, 4, 5} given by the following multiplication table. 

(i) Compute (2 * 3) * 4 and 2 * (3 * 4)

(ii) Is * commutative?

(iii) Compute (2 * 3) * (4 * 5).

(Hint: use the following table)

*

1

2

3

4

5

1

1

1

1

1

1

2

1

2

1

2

1

3

1

1

3

1

1

4

1

2

1

4

1

5

1

1

1

1

5

A.4. (i) (2 * 3) * 4 = 1 * 4 = 1

2 * (3 * 4) = 2 * 1 = 1

(ii) For every a, b ∈{1, 2, 3, 4, 5}, we have a * b = b * a. Therefore, the operation * is commutative.

(iii) (2 * 3) = 1 and (4 * 5) = 1

∴ (2 * 3) * (4 * 5) = 1 * 1 = 1

 

Q5. Let*′ be the binary operation on the set {1, 2, 3, 4, 5} defined by a *′ b = H.C.F. of a and b. Is the operation *′ same as the operation * defined in Exercise 4 above? Justify your answer.

A.5. The binary operation *′ on the set {1, 2, 3 4, 5} is defined as a *′ b = H.C.F of a and b.

The operation table for the operation *′ can be given as:

*′ 

1

2

3

4

5

1

1

1

1

1

1

2

1

2

1

2

1

3

1

1

3

1

1

4

1

2

1

4

1

5

1

1

1

1

5

We observe that the operation tables for the operations * and *′ are the same.

Thus, the operation *′ is same as the operation*.

 

Q6. Let * be the binary operation on N given by a * b = L.C.M. of a and b. Find

(i) 5 * 7, 20 * 16 (ii) Is * commutative?

(iii) Is * associative? (iv) Find the identity of * in N

(v) Which elements of N are invertible for the operation *?

A.6. The binary operation * on N is defined as a * b = L.C.M. of a and b.

(i) 5 * 7 = L.C.M. of 5 and 7 = 35

20 * 16 = L.C.M of 20 and 16 = 80

(ii) It is known that: 

L.C.M of a and b = L.C.M of b and a & mnForE; a, b ∈ N. 

∴a * b = b * a

Thus, the operation * is commutative.

(iii) For a, b, c ∈ N, we have:

(a * b) * c = (L.C.M of a and b) * c = LCM of a, b, and c

a * (b * c) = a * (LCM of b and c) = L.C.M of a, b, and c

∴ (a * b) * c = a * (b * c) 

Thus, the operation * is associative.

(iv) It is known that:

L.C.M. of a and 1 = a = L.C.M. 1 and a &mnForE; a ∈ N 

⇒ a * 1 = a = 1 * a &mnForE; a ∈ N

Thus, 1 is the identity of * in N.

(v) An element a in N is invertible with respect to the operation * if there exists an element b in N, such that a * b = e = b * a.

Here, e = 1

This means that: 

L.C.M of a and b = 1 = L.C.M of b and a

This case is possible only when a and b are equal to 1.

Thus, 1 is the only invertible element of N with respect to the operation *.

 

Q7. Is * defined on the set {1, 2, 3, 4, 5} by a * b = L.C.M. of a and b a binary operation? Justify your answer.

A.7. The operation * on the set A = {1, 2, 3, 4, 5} is defined as 

a * b = L.C.M. of a and b.

Then, the operation table for the given operation * can be given as:

*

1

2

3

4

5

1

1

2

3

4

5

2

2

2

6

4

10

3

3

6

3

12

15

4

4

4

12

4

20

5

5

10

15

20

5

It can be observed from the obtained table that:

3 * 2 = 2 * 3 = 6 ∉ A, 5 * 2 = 2 * 5 = 10 ∉ A, 3 * 4 = 4 * 3 = 12 ∉ A

3 * 5 = 5 * 3 = 15 ∉ A, 4 * 5 = 5 * 4 = 20 ∉ A 

Hence, the given operation * is not a binary operation.

 

Q8. Let * be the binary operation on N defined by a * b = H.C.F. of a and b. Is * commutative? Is * associative? Does there exist identity for this binary operation on N?

A.8. The binary operation * on N is defined as:

a * b = H.C.F. of a and b

It is known that: 

H.C.F. of a and b = H.C.F. of b and a & mn For E; a, b ∈ N. 

∴a * b = b * a

Thus, the operation * is commutative.

For a, b, c ∈ N, we have:

(a * b)* c = (H.C.F. of a and b) * c = H.C.F. of a, b, and c

a *(b * c)= a *(H.C.F. of b and c) = H.C.F. of a, b, and c

∴(a * b) * c = a * (b * c)

Thus, the operation * is associative.

Now, an element e ∈ N will be the identity for the operation * if a * e = a = e* a ∈ a ∈ N.

But this relation is not true for any a ∈ N.

Thus, the operation * does not have any identity in N.

 

Q9. Let * be a binary operation on the set Q of rational numbers as follows:

(i) a * b = a − b

(ii) a * b = a2 + b2

(iii) a * b = a + ab

(iv) a * b = (a − b)2

(v) a * b = ab/4  (vi) a * b = ab2

Find which of the binary operations are commutative and which are associative.

A.9. (i) On Q the operation* is defined as a*b=a-b.

It can be observed that:

1 2 . 1 3 = 1 2 1 3 = 3 2 6 = 1 6 " a n d " 1 3 . 1 2 = 1 3 1 2 = 2 3 6 = 1 6 1 2 . 1 3 1 3 . 1 2 w h e r e , 1 2 , 1 3 Q

Thus, the operation* is not commutative.

It can also be observed that:

( 1 2 . 1 3 ) . 1 4 = ( 1 2 1 3 ) . 1 4 = 1 6 . 1 4 = 1 6 1 4 = 2 3 1 2 = 1 1 2 1 2 . ( 1 3 . 1 4 ) = 1 2 . ( 1 3 1 4 ) = 1 2 . 1 1 2 = 1 2 1 1 2 = 6 1 1 2 = 5 1 2 ( 1 2 . 1 3 ) . 1 4 1 2 . ( 1 3 . 1 4 ) w h e r e , 1 2 , 1 3 , 1 4 Q

Thus, the operation* is not associative.

(ii) On Q the operation* is defined as a*b=a2+b.

For  a , b Q  , we have:

a . b = a 2 + b 2 = b 2 + a 2 = b . a a * b = b * a

Thus, the operation* is commutative.

It can be observed that:

( 1 * 2 ) * 3 = ( 1 2 + 2 2 ) * 3 = ( 1 + 4 ) * 3 = 5 * 3 = 5 2 + 3 2 = 2 5 + 9 = 3 4 1 * ( 2 * 3 ) = 1 * ( 2 2 + 3 2 ) = 1 * ( 4 + 9 ) = 1 * 1 3 = 1 2 + 1 3 2 = 1 + 1 6 9 = 1 7 0 ( 1 * 2 ) * 3 1 * ( 2 * 3 ) , w h e r e , 1 , 2 , 3 Q

Thus, the operation* is not commutative.

(iii) On Q the operation* is defined as a*b=a+ab.

It can be observed that:

1 . 2 = 1 + 1 × 2 = 1 + 2 = 3 2 . 1 = 2 + 2 × 1 = 2 + 2 = 4 1 . 2 2 . 1 , w h e r e , 1 , 2 Q

Thus, the operation* is not commutative.

It can also be observed that:

( 1 . 2 ) . 3 = ( 1 + 1 × 2 ) . 3 = 3 . 3 = 3 + 3 × 3 = 3 + 9 = 1 2 1 . ( 2 . 3 ) = 1 . ( 2 + 2 × 3 ) = 1 + 1 × 8 = 9 ( 1 . 2 ) . 3 1 . ( 2 . 3 ) , w h e r e , 1 , 2 , 3 Q

Thus, the operation* is not associative.

(iv) On Q the operation* is defined as a*b=(a-b)2

For  a , b Q  , we have:

a * b = ( a b ) 2 b * a = ( b a ) 2 = [ ( a b ) ] 2 = ( a b ) 2 a * b = b * a

Thus, the operation* is commutative.

It can be observed that:

( 1 . 2 ) . 3 = ( 1 . 2 ) 2 . 3 = ( 1 ) 2 . 3 = 1 . 3 = ( 1 . 3 ) 2 = ( 2 ) 2 = 4 1 . ( 2 . 3 ) = 1 . ( 2 . 3 ) 2 = 1 . ( 1 ) 2 = 1 . 1 = ( 1 . 1 ) 2 = 0 ( 1 . 2 ) . 3 1 . ( 2 . 3 ) , w h e r e , 1 , 2 , 3 Q

Thus, the operation* is not associative.

(v) On Q the operation* is defined as a.b=ab/4

For  a , b Q  , we have:

a . b = a b 4 = b a 4 = b . a a * b = b * a

Thus, the operation* is commutative.

For  a , b , c Q  , we have:

( a . b ) . c = a b 4 . c = a b 4 . c 4 = a b c 1 6 a . ( b . c ) = a . b c 4 = a . b c 4 4 = a b c 1 6 = ( a * b ) * c a * ( b * c )

Thus, the operation* is associative.

(vi) On Q the operation* is defined as a*b=ab2

It can be observed that:

1 2 . 1 3 = 1 2 . ( 1 3 ) 2 = 1 2 . 1 9 = 1 1 8 1 3 . 1 2 = 1 3 . ( 1 2 ) 2 = 1 3 . 1 4 = 1 1 2 1 2 . 1 3 1 3 . 1 2 , w h e r e , 1 2 , 1 3 Q

Thus, the operation* is not commutative.

It can be observed that:

( 1 2 . 1 3 ) . 1 4 = [ 1 2 . ( 1 3 ) 2 ] . 1 4 = 1 1 8 . 1 4 = 1 1 8 . ( 1 4 ) 2 = 1 1 8 × 1 6 1 2 . ( 1 3 . 1 4 ) = 1 2 . [ 1 3 . ( 1 4 ) 2 ] = 1 2 . 1 4 8 = 1 2 . ( 1 4 8 ) 2 = 1 2 × ( 4 8 ) 2 ( 1 2 . 1 3 ) . 1 4 1 2 . ( 1 3 . 1 4 ) , w h e r e , 1 2 , 1 3 , 1 . 4 Q

Thus, the operation* is not associative.

Hence, the operations defined (ii), (iv), (v) are commutative and the operation defined in (v) is associative.

 

Q10. Find which of the operations given above has identity.

A.10. Let the identity be I.

An element  e Q  will be the identity element for the operation* if

a * e = a = e * a , a Q .

We are given

a * b = a b 4 a * e = a a e 4 = a e = 4

Similarly, it can be checked for  e * a = a  , we get e=4. Thus, e=4 is the identity

 

Q11. Let A = N × N and * be the binary operation on A defined by

(a, b) * (c, d) = (a + c, b + d)

Show that * is commutative and associative. Find the identity element for * on A, if any.

A.11. A = N × N

* is a binary operation on A and is defined by:

(a, b) * (c, d) = (a + c, b + d)

Let (a, b), (c, d) ∈ A

Then, a, b, c, d ∈ N

We have:

(a, b) * (c, d) = (a + c, b + d)

(c, d) * (a, b) = (c + a, d + b) = (a + c, b + d) 

[Addition is commutative in the set of natural numbers]

∴(a, b) * (c, d) = (c, d) * (a, b)

Therefore, the operation * is commutative.

Now, let (a, b), (c, d), (e, f) ∈A

Then, a, b, c, d, e, f ∈ N

We have:

( ( a , b ) . ( c , d ) ) . ( e , f ) = ( a + c , b + d ) . ( e , f ) = ( a + c + e , b + d + f ) ( a , b ) . ( ( c , d ) . ( e , f ) ) = ( a , b ) . ( c + e , d + f ) = ( a + c + e , b + d + f ) ( ( a , b ) . ( c , d ) ) . ( e , f ) = ( a , b ) . ( ( c , d ) . ( e , f ) )

Therefore, the operation* is associative.

An element  e = ( e 1 , e 2 )  will be an identity element for the operation* if

a * e = a = e * a a = ( a 1 , a 2 ) A

i . e . , ( a 1 + e 1 , a 2 + e 2 ) = ( a 1 , a 2 ) = ( e 1 + a 1 , e 2 + a 2 )  which is not true for any element in A.

Therefore, the operation* does not have any identity element.

Which is not true for any element in A.

Therefore, the operation * does not have any identity element.

 

Q12. State whether the following statements are true or false. Justify.

(i) For an arbitrary binary operation * on a set N, a * a = a ∀ a * N.

(ii) If * is a commutative binary operation on N, then a * (b * c) = (c * b) * a

A.12. (i) Define an operation * on N as:

a * b = a + b  a, b ∈ N

Then, in particular, for b = a = 3, we have:

3 * 3 = 3 + 3 = 6 ≠ 3

Therefore, statement (i) is false.

(ii) R.H.S. = (c * b) * a

= (b * c) * a [* is commutative]

= a * (b * c) [Again, as * is commutative]

= L.H.S.

∴ a * (b * c) = (c * b) * a

Therefore, statement (ii) is true.

 

Q13. Consider a binary operation * on N defined as a * b = a3 + b3. Choose the correct answer.

(A) Is * both associative and commutative?

(B) Is * commutative but not associative?

(C) Is * associative but not commutative?

(D) Is * neither commutative nor associative?

A13. On N, the operation * is defined as a * b = a3 + b3.

For, a, b, ∈ N, we have:

a * b =  a3 + b3 = b3 + a = b * a [Addition is commutative in N]

Therefore, the operation * is commutative.

It can be observed that:

 (1*2)*3 = (13+23)*3 = 9 * 3 = 93 + 33 = 729 + 27 = 756

Also, 1*(2*3) = 1*(2+33) = 1*(8 +27) = 1 × 35

= 13 +353 = 1 +(35)3 = 1 + 42875 = 42876.

∴(1 * 2) * 3 ≠ 1 * (2 * 3) ; where 1, 2, 3 ∈ N

Therefore, the operation * is not associative.

Hence, the operation * is commutative, but not associative. Thus, the correct answer is B.

 

MISCELLANEOUS

Q1. Let f: R → R be defined as f(x) = 10x + 7. Find the function g: R → R such that g o f = f o g = 1R.

A.1. It is given that  f : R R  is defined as  f ( x ) = 1 0 x + 7 .

One-one:

L e t , f ( x ) = f ( y ) , w h e r e , x , y R 1 0 x + 7 = 1 0 y + 7 x = y

f  is a one-one function.

Onto:

F o r , y R , l e t , y = 1 0 x + 7 x = y 7 1 0 R

Therefore, for any  y R  ,there exists  x = y 7 1 0 R

Such that

f ( x ) = f ( y 7 1 0 ) = 1 0 ( y 7 1 0 ) + 7 = y 7 + 7 = y

f  is onto.

Therefore, f is one-one and onto.

Thus, f is an invertible function.

Let us define  g : R R  as  g ( y ) = y 7 1 0

Now, we have

g o f ( x ) = g ( f ( x ) ) = g ( 1 0 x + 7 ) = ( 1 0 x + 7 ) 7 1 0 = 1 0 x 1 0 = 1 0 A n d f o g ( y ) = f ( g ( y ) ) = f ( y 7 1 0 ) = 1 0 ( y 7 1 0 ) + 7 = y 7 + 7 = y

Hence, the required function  g : R R  is defined as  g ( y ) = y 7 1 0

 

Q2. Let f: W → W be defined as f(n) = n − 1, if is odd and f(n) = n + 1, if n is even. Show that f is invertible. Find the inverse of f. Here, W is the set of all whole numbers.

A.2. It is given that:

f : W W  is defined as  f ( n ) = { n 1 , i f . n , o d d n + 1 , i f . n , e v e n

One-one:

Let,  f ( n ) = f ( m ) .

It can be observed that if n is odd and m is even, then we will have n-1=m+1.

n m = 2

However, the possibility of n being even and m being odd can also be ignored under a similar argument.

 Both n and m must be either odd or even.

Now, if both n and m are odd, then we have:

f ( n ) = f ( m ) n 1 = m 1 n = m

Again, if both n and m are even, then we have:

f ( n ) = f ( m ) n + 1 = m + 1 n = m

f  is one-one.

It is clear that any odd number 2r+1 in co-domain N is the image of 2r in domain N and any even 2r in co-domain N is the image of 2r+1 in domain N.

f  is onto.

Hence, f is an invertible function.

Let us define  g : W W  as:

g ( m ) = { m + 1 , i f . n , e v e n m 1 , i f . n , o d d

Now, when n is odd:

g o f ( n ) = g ( f ( n ) ) = g ( n 1 ) = n 1 + 1 = n

And, when n is even:

g o f ( n ) = g ( f ( n ) ) = g ( n + 1 ) = n + 1 1 = n

Similarly, when m is odd:

f o g ( m ) = f ( g ( m ) ) = f ( m 1 ) = m 1 + 1 = m

When m is even:

f o g ( m ) = f ( g ( m ) ) = f ( m + 1 ) = m + 1 1 = m g o f = I W , a n d , f o g = I W

Thus, f is invertible and the inverse of f is given by  f 1 = g  , which is the same as f.

Hence, the inverse of f is f itself.

 

Q3. If f: R → R is defined by f(x) = x2 − 3x + 2, find f(f(x)).

A.3. It is given that  f : R R  is defined as  f ( x ) = x 2 3 x + 2 .

f ( f ( x ) ) = f ( x 2 3 x + 2 ) = ( x 2 + 3 x + 2 ) 2 3 ( x 2 3 x + 2 ) + 2 = x 4 + 9 x 2 + 4 6 x 2 1 2 x + 4 x 2 3 x 2 + 9 x 6 + 2 = x 4 6 x 2 + 1 0 x 2 3 x

 

Q4. Show that function f: R → {x ∈ R: −1 < x < 1} defined by f(x) = x/1+|x| x ∈R is one-one and onto function.

A.4. It is given that  f : R { x R : 1 < x < 1 }  is defined as  f ( x ) = x 1 + | x | , x R .

Suppose  f ( x ) = f ( y )  , where  x , y R .

x 1 + x = y 1 y 2 x y = x y

Since x is positive and y is negative:

x > y x y > 0

But, 2xy is negative.

Then,  2 x y x y  .

Thus, the case of x being positive and y being negative can be ruled out.

Under a similar argument, x being negative and y being positive can also be ruled out

 x and y have to be either positive or negative.

When x and y are both positive, we have:

f ( x ) = f ( y ) x 1 + x = y 1 + y x + x y = y + x y x = y

When x and y are both negative, we have:

f ( x ) = f ( y ) x 1 x = y 1 y x x y = y y x x = y

f  is one-one.

Now, let  y R  such that  1 < y < 1  .

If x is negative, then there exists  x = y 1 + y R  such that

f ( x ) = f ( y 1 + y ) = ( y 1 + y ) 1 + y 1 + y = y 1 + y 1 + y 1 + y = y 1 + y y = y

If x is positive, then there exists  x = y 1 y R  such that

f ( x ) = f ( y 1 y ) = ( y 1 y ) 1 + ( y 1 y ) = y 1 y 1 + y 1 y = y 1 y + y = y

f  is onto.

Hence, f is one-one and onto.

 

Q5. Show that the function f: R → R given by f(x) = x3 is injective.

A.5. f: R → R is given as f(x) = x3.

Suppose f(x) = f(y), where x, y ∈ R.

⇒ x3 = y3  … (1)

Now, we need to show that x = y.

Suppose x ≠ y, their cubes will also not be equal.

⇒ x3 ≠ y3

However, this will be a contradiction to (1).

∴ x = y

Hence, f is injective.

 

Q6. Give examples of two functions f: N → Z and g: Z → Z such that g o f is injective but g is not injective.

(Hint: Consider f(x) = x and g(x) = |x| )

A.6. Define  f : N Z  as  f ( x )  and  g : Z Z  as  g ( x ) = | x |

We first show that g is not injective.

It can be observed that:

g ( 1 ) = | 1 | = 1 g ( 1 ) = | 1 | = 1 g ( 1 ) = g ( 1 ) , b u t , 1 1

g  is not injective.

Now,  g o f : N Z  is defined as

g o f ( x ) = y ( f ( x ) ) = y ( x ) = | x |

Let  x , y N  such that  g o f ( x ) g o f ( y )

| x | = | y |

Since  x , y N  , both are positive.

| x | = | y | x = y

Hence, gof is injective

 

Q7. Given examples of two functions f: N → N and g: N → N such that gof is onto but f is not onto.

(Hint: Consider f(x) = x + 1 and   g ( x ) { x 1 i f , x > 1 1 f , x = 1 }

A.7. Define  f : Ν Ν  by

f ( x ) = x + 1

And,  g : Ν Ν  by,

g ( x ) { x 1 i f , x > 1 1 f , x = 1 }

We first show that g is not onto.

For this, consider element 1 in co-domain N. it is clear that this element is not an image of any of the elements in domain.

f  is not onto.

Now,  g o f : Ν Ν  is defined by,

g o f ( x ) = g ( f ( x ) ) = g ( x + 1 ) = ( x + 1 ) 1 [ x , i n Ν = > ( x + 1 ) > 1 ] = x

Then, it is clear that for  y Ν  , there exists  x = y Ν  such that  g o f ( x ) = g o f ( y )

Hence, gof is onto.

 

Q8. Given a non empty set X, consider P(X) which is the set of all subsets of X.

Define the relation R in P(X) as follows: For subsets A, B in P(X), ARB if and only if A ⊂ B. Is R an equivalence relation on P(X)? Justify you answer:

A.8. Since every set is a subset of itself, ARA for all A ∈ P(X).

∴R is reflexive.

Let ARB ⇒ A ⊂ B.

This cannot be implied to B ⊂ A.

For instance, if A = {1, 2} and B = {1, 2, 3}, then it cannot be implied that B is related to A.

∴ R is not symmetric.

Further, if ARB and BRC, then A ⊂ B and B ⊂ C.

⇒ A ⊂ C

⇒ ARC 

∴ R is transitive.

Hence, R is not an equivalence relation since it is not symmetric.

 

Q9. Given a non-empty set X, consider the binary operation *: P(X) × P(X) → P(X) given by A * B = A ∩ B &mn For  E; A, B in P(X) is the power set of X. Show that X is the identity element for this operation and X is the only invertible element in P(X) with respect to the operation*.

A.9. Let S be a non-empty set and P(S) be its power set. Let any two subsets A and B of S.

It is given that:  P ( X ) x P ( X ) P ( X )  is defined as  A . B = A B A , B P ( X )

We know that  A X = A = X A A P ( X )

A . X = A = X . A A P ( X )

Thus, X is the identity element for the given binary operation*.

Now, an element is   A P ( X )  invertible if there exists  B P ( X )  such that

A * B = X = B * A  (As X is the identity element)

i.e.

A B = X = B A

This case is possible only when  A = X = B .

Thus, X is the only invertible element in P(X) with respect to the given operation*.

Hence, the given result is proved.

 

Q10. Find the number of all onto functions from the set {1, 2, 3, … , n) to itself.

A.10. Onto functions from the set {1, 2, 3, … ,n} to itself is simply a permutation on n symbols 1, 2, …, n.

Thus, the total number of onto maps from {1, 2, … , n} to itself is the same as the total number of permutations on n symbols 1, 2, …, n, which is n!.

 

Q11. Let S = {a, b, c} and T = {1, 2, 3}. Find F−1 of the following functions F from S to T, if it exists.

(i) F = {(a, 3), (b, 2), (c, 1)} (ii) F = {(a, 2), (b, 1), (c, 1)}

A.11. S = {a, b, c}, T = {1, 2, 3}

(i) F: S → T is defined as:

F = {(a, 3), (b, 2), (c, 1)}

⇒ F (a) = 3, F (b) = 2, F(c) = 1 

Therefore, F−1 : T → S is given by

F−1  = {(3, a), (2, b), (1, c)}.

(ii) F: S → T is defined as:

F = {(a, 2), (b, 1), (c, 1)}

Since F (b) = F (c) = 1, F is not one-one.

Hence, F is not invertible i.e., F−1  does not exist.

 

Q12. Consider the binary operations*: R ×R → and o: R × R → R defined as a * b  = |a - b| and  ao b = a, &mn For E; a, b ∈ R. Show that * is commutative but not associative, o is associative but not commutative. Further, show that &mn For E;a, b, c ∈ R, a*(b o c) = (a * b) o (a * c). [If it is so, we say that the operation * distributes over the operation o]. Does o distribute over *? Justify your answer.

A.12. It is given that*:  R × R  and  o : R × R R  is defined as

a * b = | a b | a n d , a o b = a , & m n F o r E ; a , b R .

For  a , b R  , we have:

a * b = | a b | b * a = | b a | = | ( a b ) | = | a b | a * b = b * a

 The operation* is commutative.

It can be observed that,

( 1 . 2 ) . 3 = ( | 1 2 | ) . 3 = 1 . 3 = | 1 3 | = 2 1 * ( 2 * 3 ) = 1 * ( | 2 3 | ) = 1 * 1 = | 1 1 | = 0 ( 1 * 2 ) * 3 = 1 * ( 2 * 3 ) ( w h e r e , 1 , 2 , 3 R )

 The operation* is not associative.

Now, consider the operation o:

It can be observed that  1 o 2 = 1 , a n d , 2 o 1 = 2 .

1 o 2 2 o 1 ( w h e r e , 1 , 2 R )

 The operation o is not commutative.

Let,  a , b , c R  . Then we have:

( a ο b ) ο c = a o c = a a o ( b ο c ) = a o b = a ( a ο b ) ο c = a o ( b ο c )

 The operation o is associative.

Now,  a , b , c R  . Then we have:

a * ( b ο c ) = a * b = | a b | ( a * b ) o ( a * c ) = ( | a b | ) o ( | a c | ) = | a b | H e n c e , a * ( b ο c ) = ( a * b ) o ( a * c ) . N o w , 1 o ( 2 ο 3 ) = 1 o ( | 2 3 | ) = 1 o 1 = 1 ( 1 o 2 ) * ( 1 o 3 ) = 1 * 1 = | 1 1 | = 0 1 o ( 2 ο 3 ) ( 1 o 2 ) * ( 1 o 3 ) ( w h e r e , 1 , 2 , 3 R )

 The operation o does not distribute over*.

 

Q13. Given a non-empty set X, let *: P(X) × P(X) → P(X) be defined as A * B = (A − B) ∪ (B − A), &mn For E; A, B ∈ P(X). Show that the empty set Φ is the identity for the operation * and all the elements A of P(X) are invertible with A−1 = A. (Hint: (A − Φ) ∪ (Φ − A) = A and (A − A) ∪ (A − A) = A * A = Φ).

A.13. : It is given that ∗: P(X) × P(X) → P(X) be defined as

 A * B = (A – B) ∪ (B – A), A, B ∈ P(X).

Now, let A ϵ P(X). Then, we get,

A * ф = (A – ф) ∪ (ф –A) = A∪ф = A

ф * A = (ф - A) ∪ (A - ф ) = ф∪A = A

A * ф = A = ф * A,    A ϵ P(X)

Therefore, ф is the identity element for the given operation *.

Now, an element A ϵ P(X) will be invertible if there exists B ϵ P(X) such that

A * B = ф = B * A. (as ф is an identity element.)

Now, we can see that A * A = (A –A) ∪ (A – A) = ф∪ф = ф AϵP(X).

Therefore, all the element A of P(X) are invertible with A-1 = A. 

 

Q14. Define binary operation * on the set {0, 1, 2, 3, 4, 5} as  a * b = { a + b i f , a + b < 6 a + b 6 f , a + b 6

Show that zero is the identity for this operation and each element a ≠ 0 of the set is invertible with 6 - abeing the inverse of a

A.14.  Let X={0, 1, 2, 3, 4, 5}.

The operation* on X is defined as:

a * b = { a + b i f , a + b < 6 a + b 6 i f , a + b 6

An element  e X  is the identity element for the operation*, if  a * e = a = e * a a X

For  a X  we observed that

a * 0 = a + 0 = a [ a X a + 0 < 6 ] 0 * a = 0 + a = a [ a X 0 + a < 6 ] a * 0 = 0 * a a X

Thus, 0 is the identity element for the given operation*.

An element  a X  is invertible if there exists  b X  such that  a * 0 = 0 * a .

i e { a + b = 0 = b + a i f , a + b < 6 a + 6 6 = 0 = b + a 6 i f , a + b 6

i.e.,

a = b , o r , b = 6 a

But, X={0, 1, 2, 3, 4, 5} and  a , b X  . Then,  a b  .

b = 6 a  is the inverse of  a & m n F o r E ; a X .

Hence, the inverse of an element  a X , a 0  is 6-a i.e.,  a 1 = 6 a .

*

0

1

2

3

4

5

0

0

1

2

3

4

5

1

1

2

3

4

5

0

2

2

3

4

5

0

1

3

3

4

5

0

1

2

4

4

5

0

1

2

3

5

5

0

1

2

3

4

 

Q15. Let A = {–1, 0, 1, 2}, B = {–4, –2, 0, 2} and f; g: A→B be the functions defined by f(x) = x2 − x, x ∈  A and g(x) = 2x - 1/2 - 1. x∈  A. Are f and g equal? Justify your answer.

(Hint: One may note that two functions f: A → B and g: A → B such that f(a) = g(a) & mn For E; a ∈A, are called equal functions).

A.15. It is given that A = {–1, 0, 1, 2}, B = {–4, –2, 0, 2}

Also, it is given that  f , g : A B  are defined by  f ( x ) = x 2 x , x A  and  g ( x ) = 2 x 1 2 1 , x A  .

It is observed that:

f ( 1 ) = ( 1 2 ) ( 1 ) = 1 + 1 = 2 g ( 1 ) = 2 ( 1 ) 1 2 1 = 2 ( 3 2 ) 1 = 3 1 = 2 f ( 1 ) = g ( 1 ) f ( 0 ) = ( 0 ) 2 0 = 0 g ( 0 ) = 2 ( 0 ) 1 2 1 = 2 ( 1 2 ) 1 = 1 1 = 0 f ( 0 ) = g ( 0 ) f ( 1 ) = ( 1 ) 2 1 = 1 1 = 0 g ( 1 ) = 2 a 1 2 1 = 2 ( 1 2 ) 1 = 1 1 = 0 f ( 1 ) = g ( 1 ) f ( 2 ) = ( 2 ) 2 2 = 4 2 = 2 g ( 2 ) = 2 ( 2 ) 1 2 1 = 2 ( 3 2 ) 1 = 3 1 = 2 f ( 2 ) = g ( 2 ) f ( a ) = g ( a ) a A

Hence, the functions f and g are equal.

 

Q16. Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is:

(A) 1

(B) 2

(C) 3

(D) 4

A.16. It is clear that 1 is reflexive and symmetric but not transitive.

Therefore, option (A) is correct.

 

Q17. Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is:

(A) 1

(B) 2

(C) 3

(D) 4

A.17. 2, Therefore, option (B) is correct.

 

Q18. Let R → R be the Signum Function defined as  f ( x ) = { 1 x > 0 0 x = 0 1 x < 0   and R → R be the Greatest Function given by g(x) = [x] where [x] is greatest integer less than or equal to x

Then, does fog and gof  coincide in (0, 1)?

A.18.  It is given that,

f : R R  is defined as  f ( x ) = { 1 x > 0 0 x = 0 1 x < 0

Also,  g : R R  is defined as  g ( x ) = [ x ]  , where [x] is the greatest integer less than or equal to x.

Now, let  x ( 0 , 1 )

Then, we have:

[ x ] = 1  if  x = 1  and  [ x ] = 0  if  0 < x < 1

f o g ( x ) = f ( g ( x ) ) = f ( [ x ] ) = { f ( 1 ) i f , x = 1 f ( 0 ) i f , x ( 0 , 1 ) = { ( 1 , " i f , x = 1 " ) , ( 0 , : i f , x ( 0 , 1 ) " ) : } g o f ( x ) = g ( f ( x ) ) = g ( 1 ) [ x > 0 ] = [ 1 ] = 1

Thus, when  x ( 0 , 1 )  , we have  f o g ( x ) = 0 a n d , g o f ( x ) = 1 .

Hence, fog and gof do not coincide in (0, 1).

Therefore, option (B) is correct.

 

Q19. Number of binary operations on the set {a, b} are:

(A) 10

(b) 16

(C) 20

(D) 8

A.19.

A binary operation * on {a, b} is a function from {a, b} × {a, b} → {a, b}

i.e., * is a function from {(a, a), (a, b), (b, a), (b, b)} → {a, b}.

Hence, the total number of binary operations on the set {a, b} is 24 i.e., 16.

The correct answer is B.

Maths Ncert Solutions class 12th Logo

Class 12 Math important reference books and preparation Tips

Candidates can check the suggestions of the most recommended books for competitive exam maths preparation. Candidates must choose the right resources and correct preparation plan to excel in both board and competitive exams such as JEE, COMEDK, etc... Candidates can check the preparation tips and book recommendations below;

Important Reference Books for JEE Main Maths Preparation

  • RD Sharma Mathematics for Class 12 ( ( Vol.I and II)
  • Objective Mathematics by R.D. Sharma (For JEE Mains)
  • Cengage Mathematics Book Series by G. Tewani (For JEE Mains and Advance)
  • Problems in Calculus of One Variable by I.A. Maron 
  • Trigonometry and Co-ordinate Geometry by SL Loney

Several other books are available in the market for JEE Main preparation for Maths. Candidates should discuss the options with their teachers or mentors before buying the books.

Preparation Tips for Class 12 Math and JEE Main

  • Know Your Exam Well: Students should first check the exam pattern, including the level of questions asked, the time allotted to solve the paper, the format of the question paper (MCQs or descriptive), the required time for prep, resources, and other important things related to the exam. Knowing the exam thoroughly helps students make better and more realistic preparation strategies.
  • Select Preparation Resources: Students should choose the right resources with the help of mentors or teachers to start their preparation. The Resources must match the level of exam targeted by the student, different levels of questions might hamper the prep speed and disturb the regular prep plan.
  • Make a holistic preparation plan: Students should make a flexible and complete preparation plan which should include enough time for practice and revision of the already learned concepts.
  • Practice and Attempt Sample/ Mock Papers: Practice and mock tests are key to scoring higher on any board or entrance exam. Students should take as many mock tests as possible during the preparation days, Mock tests boost the confidence and critical thinking skills of the student. In between the preparation, students can attempt the section and chapter-wise mock tests.
qna

Maths Ncert Solutions class 12th Exam

Student Forum

chatAnything you would want to ask experts?
Write here...