Strictly Increasing Functions Count (Jee Mains) | ExamDuo
Ask Doubts
Log in
Combinations
Medium
Strictly Increasing Functions Count
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
SELECT ONE OPTION
A
21
B
27
C
22
D
28
Check
Ask about this question