Let \(A = \{x_1, x_2, \ldots, x_7\}\) and \(B = \{y_1, y_2, y_3\}\) be two sets containing seven and three distinct elements respectively. Then the total number of functions \(f: A \to B\) that are onto, if there exists exactly three elements \(x\) in \(A\) such that \(f(x) = y_2\), is equal to
Let \(A = \{1, 2, 3, 4, 5, 6, 7\}\). The number of surjective functions defined from \(A\) to \(A\) such that \(f(i) = i\) for at least four values of \(i\) from \(i = 1, 2, \ldots, 7\) is:
Find the number of positive integers, which can be formed by using any number of digits from 0, 1, 2, 3, 4, 5 but using each digit not more than once in each number. How many of these integers are greater than 3000? What will happen when repetition is allowed?
The number of seven digit odd numbers, that can be formed using all the seven digits 1, 2, 2, 2, 3, 3, 5 is _____.