The number of strictly increasing functions f from the set { 1 , 2 , 3 , 4 , 5 , 6 } to the set { 1 , 2 , 3 , … , 9 } such that f ( i ) i for 1 i 6 , is equal to [2026]

STUDY MATERIALS
COURSES
MORE
SUCCESS STORY
ADMISSION
STORE

Back

JEE ADVANCE

CLASS XI - XII
CRASH COURSE

CLASS XI - XII

CRASH COURSE

JEE MAIN

CLASS XI - XII
CRASH COURSE

CLASS XI - XII

CRASH COURSE

NEET

CLASS XI - XII
CRASH COURSE

CLASS XI - XII

CRASH COURSE

BITSAT

CLASS XI - XII

CLASS XI - XII

CBSE BOARD

CLASS IX

CLASS X

CLASS XI

CLASS XII

CLASS VI

CLASS VII

CLASS VIII

UP BOARD

CLASS IX
CLASS X
CLASS XI
CLASS XII

CLASS IX

CLASS X

CLASS XI

CLASS XII

CUET

CRASH COURSE

CRASH COURSE

Courses

CLASSROOM COURSES
ONLINE COURSES

ONLINE COURSES

More

Solution

Q.
The number of strictly increasing functions f from the set ${1, 2, 3, 4, 5, 6}$ to the set ${1, 2, 3, \dots, 9}$ such that $f (i) \neq i$ for $1 \leq i \leq 6,$ is equal to [2026]

1 28

2 22

3 27

4 21

Ans.
(1)

$f (i) \neq i, f (x) is strictly increasing function$

$f : A \to B,$ $where A = {1, 2, 3, \dots, 6}$

$B = {1, 2, 3, \dots, 9},$ then number of functions $f : A \to B$ is equal to

$f (i) \neq i$ $Case (i) f (1) = 2 \Rightarrow {}^{7}{C_{5}} = 21$

$Case (ii) f (1) = 3 \Rightarrow {}^{6}{C_{5}} = 6$

$Case (iii) f (1) = 4 \Rightarrow {}^{5}{C_{5}} = 1$

Number of functions from A to B $= 21 + 6 + 1 = 28$

Want Us to Email you About Special Offers & Updates?