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 \le i \le 6\), is equal to:
Consider an A.P. $a_1,a_2,\ldots,a_n$; $a_1>0$. If $a_2-a_1=-\dfrac{3}{4}$, $a_n=\dfrac{1}{4}a_1$, and \[ \sum_{i=1}^{n} a_i=\frac{525}{2}, \] then $\sum_{i=1}^{17} a_i$ is equal to

Permutation is the method or the act of arranging members of a set into an order or a sequence.
Combination is the method of forming subsets by selecting data from a larger set in a way that the selection order does not matter.