How many strictly increasing functions precede (2,3,4,5)?
I'm having some trouble with the following question:
Notation: Let [n] denote the set and we will represent a function as a list:
Consider all strictly increasing functions and order them with the natural lexicographic order induced by the order in . How many functions precede the function (2,3,4,5)?