How many strictly increasing functions $f$ are possible such that $f:A \rightarrow B$, where $A=\{ a_1,a_2,a_3,a_4,a_5,a_6\}$ , and $B=\{ 1,2,3,4,5,6,7,8,9\}$ and $a_{i+1}>a_i \forall i \in \mathbb{N}$ and $f( a_i) \neq i$ ?

If you're looking to skyrocket your preparation for JEE-2015, then go for solving this set of questions

Your answer seems reasonable.
Find out if you're right!