Let $a \in \left(0, \dfrac{\pi}{2}\right)$ be fixed.
If
$\displaystyle \int \dfrac{\tan x + \tan a}{\tan x - \tan a} , dx = A(x)\cos 2a + B(x)\sin 2a + C,$
where $C$ is a constant of integration,
then the functions $A(x)$ and $B(x)$ are respectively:
Two families with three members each and one family with four members are to be seated in a row. In how many ways can they be seated so that the same family members are not separated?
Let there be two families with 3 members each (say Family A and Family B), and one family with 4 members (Family C).
Step 1: Since members of the same family must sit together, treat each family as a single block.
Thus, there are 3 blocks: A, B, and C.
They can be arranged in $3! = 6$ ways.
Step 2: Now arrange members within each family:
Family A (3 members): $3!$ ways
Family B (3 members): $3!$ ways
Family C (4 members): $4!$ ways
Step 3: Total number of arrangements =
$3! \times 3! \times 3! \times 4!$
A group of students comprises of $5$ boys and $n$ girls. If the number of ways in which a team of $3$ students can randomly be selected from this group such that there is at least one boy and at least one girl in each team is $1750$, then $n$ is equal to:
From a group of 7 batsmen and 6 bowlers, 10 players are to be chosen for a team, which should include atleast 4 batsmen and atleast 4 bowlers. One batsmen and one bowler who are captain and vice-captain respectively of the team should be included. Then the total number of ways such a selection can be made, is
Let $T_{n}$ be the number of all possible triangles formed by joining vertices
of an $n$-sided regular polygon. If $T_{n+1}-T_{n}=10$, then the value of $n$ is :
All the letters of the word PUBLIC are written in all possible orders and these words are written as in a dictionary with serial numbers. Then the serial number of the word PUBLIC is :
Let x denote the total number of one-one functions from a set A with 3 elements to a set B with 5 elements and y denote the total number of one-one functions form the set A to the set A $\times$ B. Then :
Let the set $S={2,4,8,16,\ldots,512}$ be partitioned into three sets $A,B,C$ having equal number of elements such that
$A\cup B\cup C=S$ and $A\cap B=B\cap C=A\cap C=\phi$.
Then the maximum number of such possible partitions of $S$ is:
60 words can be formed using all the letters of the word BHBJO (with or without meaning). If these words are arranged in dictionary order, then the 50th word is:
Let $p$ be the number of all triangles that can be formed by joining the vertices of a regular $n$-gon $P$, and $q$ be the number of all quadrilaterals that can be formed by joining the vertices of $P$. If $p+q=126$, then the eccentricity of the ellipse $\dfrac{x^2}{16}+\dfrac{y^2}{n}=1$ is:
From $6$ different novels and $3$ different dictionaries, $4$ novels and $1$ dictionary are to be selected and arranged in a row on a shelf so that the dictionary is always in the middle. The number of such arrangements is :
Group $A$ consists of $7$ boys and $3$ girls, while group $B$ consists of $6$ boys and $5$ girls. The number of ways $4$ boys and $4$ girls can be invited for a picnic if $5$ of them must be from group $A$ and the remaining $3$ from group $B$, is equal to:
If the number of words (with or without meaning) that can be formed using all the letters of the word MATHEMATICS — in which C and S do not come together — is $(6!)k$, then $k$ is equal to:
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 is not more than $8$, is
The number of numbers between $2000$ and $5000$ that can be formed with the digits $0,1,2,3,4$ (repetition of digits is not allowed) and are multiples of $3$ is :
Eight persons are to be transported from city A to city B in three cars of different makes. If each car can accommodate at most three persons, then the number of ways, in which they can be transported, is :
Let S be the set of all the words that can be formed by arranging all the letters of the word GARDEN. From the set S, one word is selected at random. The probability that the selected word will NOT have vowels in alphabetical order is:
A man X has 7 friends, 4 of them are ladies and 3 are men. His wife Y also has 7 friends, 3 of them are ladies and 4 are men. Assume X and Y have no common friends. Then the total number of ways in which X and Y together can throw a party inviting 3 ladies and 3 men, so that 3 friends of each of X and Y are in this party, is:
If all words (with or without meaning) formed using all the letters of the word NAGPUR are arranged in dictionary order, then the word at the 315th position is:
Consider a rectangle ABCD having 5, 7, 6, 9 points in the interior of the line segments AB, CD, BC, DA respectively. Let $\alpha$ be the number of triangles having these points from different sides as vertices and $\beta$ be the number of quadrilaterals having these points from different sides as vertices. Then ($\beta$ $-$ $\alpha$) is equal to :
An organization awarded 48 medals in event 'A', 25 in event 'B' and 18 in event 'C'. If these medals went to total 60 men and only five men got medals in all the three events, then, how many received medals in exactly two of three events?
There are 12 points in a plane, no three of which are in the same straight line, except 5 points which are collinear. Then the total number of triangles that can be formed with the vertices at any three of these 12 points is
If the letters of the word MATHS are permuted and all possible words so formed are arranged as in a dictionary with serial numbers, then the serial number of the word THAMS is :
Let n > 2 be an integer. Suppose that there are n Metro stations in a city located along a circular path. Each pair of stations is connected by a straight track only. Further, each pair of nearest stations is connected by blue line, whereas all remaining pairs of stations are connected by red line. If the number of red lines is 99 times the number of blue lines, then the value of n is :
All possible numbers are formed using the digits $1,1,2,2,2,2,3,4,4$ taken all at a time. The number of such numbers in which the odd digits occupy even places is:
If all the words, with or without meaning, are written using the letters of the word QUEEN and are arranged as in English dictionary, then the position of the word QUEEN is :
The number of five digit numbers, greater than 40000 and divisible by 5 , which can be formed using the digits 1, 3, 7 and 9 without repetition, is equal to :
Team 'A' consists of 7 boys and n girls and Team 'B' has 4 boys and 6 girls. If a total of 52 single matches can be arranged between these two teams when a boy plays against a boy and a girl plays against a girl, then n is equal to :
The number of ways five alphabets can be chosen from the alphabets of the word MATHEMATICS, where the chosen alphabets are not necessarily distinct, is equal to:
The number of ways in which $5$ boys and $3$ girls can be seated on a round table if a particular boy $B_1$ and a particular girl $G_1$ never sit adjacent to each other, is :
A scientific committee is to be formed from 6 Indians and 8 foreigners, which includes at least 2 Indians and double the number of foreigners as Indians. Then the number of ways, the committee can be formed, is :
All words, with or without meaning, are made using all the letters of the word MONDAY. These words are written as in a dictionary with serial numbers. The serial number of the word MONDAY is :
A committee of $11$ members is to be formed from $8$ males and $5$ females. If $m$ is the number of ways the committee is formed with at least $6$ males and $n$ is the number of ways the committee is formed with at least $3$ females, then:
The letters of the word OUGHT are written in all possible ways and these words are arranged as in a dictionary, in a series. Then the serial number of the word TOUGH is :
If all the words (with or without meaning) having five letters, formed using the letters of the word SMALL and arranged as in a dictionary, then the position of the word SMALL is :
If the four-letter words (need not be meaningful) are to be formed using the letters from the word “MEDITERRANEAN” such that the first letter is $R$ and the fourth letter is $E$, then the total number of all such words is:
If for some $m,n$,
$\binom{6}{m}+2\binom{6}{m+1}+\binom{6}{m+2}>8\binom{6}{3}$
and
$\,^{\,n-1}\!P_{3}:\,^{\,n}\!P_{4}=1:8$,
then $\,^{\,n}\!P_{\,n+1}+\,^{\,n+1}\!C_{m}$ is equal to:
Words with or without meaning are to be formed using all the letters of the word EXAMINATION. The probability that the letter M appears at the fourth position in any such word is :
If $n$ is the number of ways five different employees can sit into four indistinguishable
offices where any office may have any number of persons (including zero), then $n$ is equal to:
Consider a class of $5$ girls and $7$ boys. The number of different teams consisting of $2$ girls and $3$ boys that can be formed from this class, if there are two specific boys $A$ and $B$ who refuse to be in the same team, is:
The number of ways of selecting two numbers $a$ and $b$, $a\in\{2,4,6,\ldots,100\}$ and $b\in\{1,3,5,\ldots,99\}$ such that $2$ is the remainder when $a+b$ is divided by $23$ is:
From all the English alphabets, five letters are chosen and arranged in alphabetical order. The total number of ways in which the middle letter is M is:
Line $L_1$ of slope $2$ and line $L_2$ of slope $\dfrac{1}{2}$ intersect at the origin $O$. In the first quadrant, $P_1,P_2,\ldots,P_{12}$ are $12$ points on line $L_1$ and $Q_1,Q_2,\ldots,Q_{9}$ are $9$ points on line $L_2$. Then the total number of triangles that can be formed having vertices at three of the $22$ points $O,P_1,P_2,\ldots,P_{12},Q_1,Q_2,\ldots,Q_{9}$ is
Let $S$ be the set of all triangles in the $xy$-plane, each having one vertex at the origin and the other two vertices on the coordinate axes with integral coordinates. If each triangle in $S$ has area $50$ sq. units, then the number of elements in the set $S$ is:
Suppose that $20$ pillars of the same height are erected along the boundary of a circular stadium. If the top of each pillar is connected by beams with the tops of all its non-adjacent pillars, then the total number of beams is:
In a group of 3 girls and 4 boys, there are two boys $B_1$ and $B_2$. The number of ways in which these girls and boys can stand in a queue such that all the girls stand together, all the boys stand together, but $B_1$ and $B_2$ are not adjacent to each other, is:
There are 5 points P1, P2, P3, P4, P5 on the side AB, excluding A and B, of a triangle ABC. Similarly, there are 6 points P6, P7,..., P11 on the side BC and 7 points P12, P13,..., P18 on the side CA.
The number of triangles that can be formed using the points P1, P2,..., P18 as vertices is:
There are 3 sections in a question paper and each section contains 5 questions. A candidate has to answer a total of 5 questions, choosing at least one question from each section. Then the number of ways, in which the candidate can choose the questions, is :
Let $A$ and $B$ be two sets containing four and two elements respectively. Then,
the number of subsets of the set $A\times B$, each having at least three
elements, are :