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 , is equal to:
For a strictly increasing function on integers, , so for every .
If , the condition fails. If , then , so holds for every .
So the required functions are exactly the strictly increasing functions whose values all lie in .
A strictly increasing function is fixed by its set of 6 values, assigned to in increasing order, so the count equals the number of 6-element subsets of the 8-element set :
Hence, the correct option is (D).
Tagged Combinations and selections with conditions. Machine-assigned, so read it as a strong shortlist rather than a verdict.