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 :
- 21
- 28
- 27
- 22
Answer
(2) 28
Solution
For a strictly increasing f on \1, 2, , 6\: f(1) 1, f(2) > f(1), … f(i) i for every i.
f(i) i f(i) i + 1.
If f(1) 2, then f(2) 3, f(3) 4, … automatically, so the condition reduces to f(1) 1.
A strictly increasing f is fixed by choosing its 6 values; they must be chosen from \2, 3, , 9\ (8 numbers).
Number of functions = 8C6 = 28
Answer: (2)