MATHS TRICKS FOR RELATION AND FUNCTION

18/03/201613/04/2016 AMAN RAJ 0 Comment Latest

Announcement

MATHS TRICKS FOR RELATION AND FUNCTION

Maths Tricks introduces some important shortcut methods on

Relations and Functions to save precious time in tedious
calculation based problems in IIT JEE MAINS and ADVANCE
and other Engineering Entrance Exams. As we know that
the chapter Relation and Functions are very important chapter
in IIT JEE. This chapter is very conceptual. By using the
following maths tricks in solving the problems based on this
chapter you will be able to attempt more problems in IIT JEE in
vary shorts span of time.

Maths Tricks 1: If A and B are any two non-empty sets

having n elements in common, then and
have elements in common.

Example : A and B are two sets having 4 elements in common.

If n(A) = 5 and n(B) = 9, then n[( ) ( )] =

(A) 9 (B) 3 (C) 16

(D) 20

Solution: The number of common elements in A and B is 3.

Thus, n[( ) ( )] = .

Therefore, Ans:(A)

Maths Tricks 2: Let A and B be two non-empty finite

sets consisting of m and n elements respectively, then
total number relation from A to B is .

Example: If A = {2,3,5,6,8} and B = {1,5,9,8,7,4,3}, then find

the total number of relation from A to B is

(A) (B) (C)

(D)
Solution: Since n(A) = m = 5 and n(B) = n = 7. Thus, the total
number of the relation from A to B is .

Therefore, Ans (C)

Maths Tricks 3: If a set A has n elements, then the

number of reflexive relations from A to A

is .

Example: If A = {x:x is a natural number and x <= 20}, then

the number of reflexive relation from set A to itself is

(A) (B) (C)

(D) none

Solution: Since A = {x:x is a natural number and x <= 20} A

= {1,2,3,,18,19,20} n(A) = 20

Thus, the number of the reflexive relation =

Therefore, Ans (C)

Maths Tricks 4: Let A be a finite set containing n

elements. Then, the total number of binary operation on
A is

Example: If A = {x : x is first six even multiple of 4}, then the

number of binary operation on A is

(A) (B) (C)

(D) none

Solution: Since A = {x:x is first six even multiple of 4} A=

{4,8,12,16,20,24} n(A) = 6

Thus, the number of the binary operation on A =

Therefore, Ans (A)

Maths Tricks 5: Let A be a finite set containing n
elements. Then, the total number of commutative binary

operation on A is

Example: If A = {x : x is a natural number such that },

then the number of commutative binary operation on A is

(A) 18 (B) 20 (C) 30

(D) 28

Solution: Since A = {x : x is a natural number such that

} A = {1,2,3,4,5,6,7} n(A) = 7

Thus, the number of the commutative binary operation on A

Therefore, Ans (D)

Maths Tricks 6: If a set contains m elements and another

set B contains n elements, then the total number of
functions from the set A to B is .

Example: If A = {1,5,9,7,14,22} and B = {2,3,5,6}, then the

number of function from the set A to B is

(A) 2048 (B) 4096 (C) 1522

(D)1024

Solution: Since A = {1,5,9,7,14,22} n(A) = 6 and B =

{2,3,5,6} n(B) = 4

Thus, the total number of the function A to B is

Therefore, Ans (B)

Maths Tricks 7: Let a function f defined as such

that A and B are finite sets having m and n elements
respectively. The number of one-one function is ,
for and O (zero) for n < m.
Example: If A = {6,7,8,9,10,11,12} and B = {2,3,4,5,6} and
, then the total number of one-one function is

(A) 3024 (B) 2863 (C) 2520

(D)3042

Solution: Since A = {6,7,8,9,10,11,12} n(A) = 7 and B =

{2,3,4,5,6} n(B) = 5 and n(A) > n(B).

Thus, the total number of one-one function from A to B is

Therefore, Ans (C)

Maths Tricks 8: Let a function f defined as such

that A and B are finite sets having m and n elements
respectively. The number of many-one function is
, for and for n < m.

Example: If A = {1,3,5,7,9} and B = {a,e,i,o,u} and ,

then the total number of many-one function is

(A) 3005 (B) 3105 (C) 3250

(D)3025

Solution: Since A = {1,3,5,7,9} n(A) = 5 and B = {a,e,i,o,u}

n(B) = 5 and n(A) = n(B).

Thus, the total number of many-one function

is

Therefore, Ans (A)

Maths Tricks 9: Let a function f defined as such

that A and B are finite sets having m and n elements
respectively. The number of onto function is

(i) , for n<m

(ii) n! for n=m

(iii) 0 for n>m

Example: If A = {2,4,6,8} and B = {a,b,c,d} and , then
the total number of onto function is

(A) 16 (B) 18 (C) 22

(D)24

Solution: Since A = {2,4,6,8} n(A) = 4 and B = {a,b,c,d}

n(B) = 4 and n(A) = n(B).

Thus, the total number of onto function is 4!=24

Therefore, Ans (D)

Maths Tricks 10: Let a function f defined as such

that A and B are finite sets having m and n elements
respectively. The number of into function is

(i) , for

(ii) for n > m

Example: If A = {1,2,3} and B = {a,b,c,d,e,f,g,h} and ,

then the total number of into function is

(A) 243 (B) 512 (C)6561

(D)1024

Solution: Since A = {1,2,3} n(A) = 3 and B =

{a,b,c,d,e,f,g,h} n(B) = 8 and n(A) < n(B).

Thus, the total number of into function is

Therefore, Ans (C)

Maths Tricks 11: Let a function f defined as such

that A and B are finite sets having m and n elements
respectively. The number of constant function is n.

Example: If A = {1,2,3} and B = {a,b,c,d,e,f,g,h} and ,

then the total number of constant function is
(A) 3 (B) 8 (C)10
(D)16

Solution: Since A = {1,2,3} n(A) = 3 and B =

{a,b,c,d,e,f,g,h} n(B) = 8

Thus, the total number of constant function is 8.

Therefore, Ans (B)

Maths Tricks 12: If A and B are finite sets and is a

bijection (One One Onto), then A and B have same
number of the elements. If A has n elements, then the
number of the bijections from A to B is n!

Example: If A = {1,2,3,4,5} , then the total number of bijection

function is is

(A) 110 (B) 115 (C)120

(D)125

Solution: Since A = {1,2,3,4,5} n(A) = 5

Thus, the total number of bijection function is is 5! =

120.

Therefore, Ans (C)

13: If f(x) is periodic with period T, then kf(ax+b) is

periodic with period , where a, b, k R and

a, k 0.

Example: The period of tan8x is

(A) (B) (C)

(D)

Solution: Since tanx is a periodic function with period , then

the period of tan8x is

Therefore, Ans (C)

So, use these Maths Tricks based on Relations and Functions

chapter in competitive engineering exams, which helps you to
solve tedious calculation based problems in IIT JEE MAINS and
ADVANCE and other Engineering Entrance Exams.