The number of integers greater than 6,000 that can be formed, using the digits 3, 5, 6, 7 and 8, without repetition, is:
The lines $L_1,L_2,\ldots,L_{20}$ are distinct. For $n=1,2,3,\ldots,10$ all the lines $L_{2n-1}$ are parallel to each other and all the lines $L_{2n}$ pass through a given point $P$. The maximum number of points of intersection of pairs of lines from the set $\{L_1,L_2,\ldots,L_{20}\}$ is equal to:
Find the number of ordered pairs \((x, y)\) if \(x, y \in \{0, 1, 2, 3, \ldots, 10\}\) and if \(|x - y| > 5\).
The number of different $5$-digit numbers greater than $50000$ that can be formed using the digits $0,1,2,3,4,5,6,7$, such that the sum of their first and last digits should not be more than $8$, is:
Let A = {1, 2, 3, 4, 5, 6, 7}. Find the total number of functions f : A → A such that f(f(x)) = x for all x ∈ A (i.e., involutions on A). The answer is 351.