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.
The number of distinct natural numbers up to a maximum of four digits and divisible by 5, which can be formed with the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, each digit not occurring more than once in each number, is
The number of ways in which we can arrange the 2n students with n boys \(b_1, b_2, \ldots, b_n\) and n girls \(g_1, g_2, \ldots, g_n\) in a line so that all the boys and all the girls stand in increasing order of their age (Assume they all are of different age)
The number of 5-digit numbers greater than $50000$ that can be formed using the digits $0,1,2,3,4,5,6,7$ (repetition allowed) such that the sum of the first and last digit is at most 8 is
A conference attended by 200 delegates is held in a hall. The hall has 7 doors, marked $A, B, \ldots \ldots, G$. At each door, an entry book is kept and the delegates entering through that door sign it in the order in which they enter. If each delegate is free to enter any time through and through any door he likes, if the total no. of different sets of seven lists would arise in all is equal to $''P_r''$ then $'n-r'$ is equal to (Assume that every person signs only at his first entry).