The number of ways, of forming a queue of \( 4 \) boys and \( 3 \) girls such that all the girls are not together, is:
\( 5040 \)
\( 3050 \)
\( 3410 \)
\( 4320 \)
The number of \( 4 \)-letter words, with or without meaning, which can be formed using the letters PQRPQRSTUVP, is ______.
The number of \( 4 \)-letter words, with or without meaning, each consisting of two vowels and two consonants that can be formed the letters of the word INCONSEQUENTIAL, without repeating any letter, is:
A building has ground floor and \( 10 \) more floors. Nine persons enter in a lift at the ground floor. The lift goes up to the \( 10^{\text{th}} \) floor. The number of ways, in which any \( 4 \) persons exit at a floor and the remaining \( 5 \) persons exit at a different floor, if the lift does not stop at the first and the second floors, is equal to:
Let \( ABC \) be a triangle. Consider four points \( p_1, p_2, p_3, p_4 \) on the side \( AB \), five points \( p_5, p_6, p_7, p_8, p_9 \) on the side \( BC \), and four points \( p_{10}, p_{11}, p_{12}, p_{13} \) on the side \( AC \). None of these points is a vertex of the triangle \( ABC \). Then the total number of pentagons, that can be formed by taking all the vertices from the points \( p_1, p_2, \ldots, p_{13} \), is __________.
The letters of the word “UDAYPUR” are written in all possible ways with or without meaning and these words are arranged as in a dictionary. The rank of the word “UDAYPUR” is:
The number of ways, in which \( 16 \) oranges can be distributed to four children such that each child gets at least one orange, is:
Let \( S=\{(m,n): m,n\in \{1,2,3,\ldots,50\}\} \). If the number of elements \( (m,n) \) is \( S \) such that \( 6^{m}+9^{n} \) is a multiple of \( 5 \) is \( p \) and the number of elements \( (m,n) \) in \( S \) such that \( m+n \) is a square of a prime number is \( q \), then \( p+q \) is equal to _________.
A person has three different bags and four different books. The number of ways, in which he can put these books in the bags so that no bag is empty, is:
Let \( A=\{(a,b,c):a,b,c \\text{ are non-negative integers and } a+b+2c=22\} \). Then \( n(A) \) is equal to:
The number of seven-digit numbers, that can be formed by using the digits \( 1, 2, 3, 5 \) and \( 7 \) such that each digit is used at least once, is:
Two players \( A \) and \( B \) play a series of games of badminton. The player, who wins \( 5 \) games first, wins the series. Assuming that no game ends in a draw, the number of ways, in which player \( A \) wins the series is ______.
The number of elements in the set \( S = \{(r,k): k \in \mathbb{Z} \text{ and } {}^{36}C_{r+1} = \dfrac{6\left({}^{35}C_{r}\right)}{k^{2}-3}\} \) is:
The number of numbers greater than \( 5000 \), less than \( 9000 \) and divisible by \( 3 \), that can be formed using the digits \( 0, 1, 2, 5, 9 \), if the repetition of the digits is allowed, is _______.
The largest value of \( n \), for which \( 40^n \) divides \( 60! \), is:
Let \( S \) denote the set of \( 4 \)-digit numbers \( abcd \) such that \( a>b>c>d \) and \( P \) denote the set of \( 5 \)-digit numbers having product of its digits equal to \( 20 \). Then \( n(S)+n(P) \) is equal to \( \_\_\_\_\_\_\_\_ \).
