How many chords can be drawn through $21$ points on a circle?
For drawing one chord a circle, only $2$ points are required.
To know the number of chords that can be drawn through the given $21$ points on a circle, the number of combinations have to be counted.
Therefore, there will be as many chords as there are combinations of $21$ points taken $2$ at a time.
Thus, required number of chords $=\,^{21} C_{2}=\frac{21 !}{2 !(21-2) !}=\frac{21 !}{2 ! 19 !}=\frac{21 \times 20}{2}=210$
A man has $7$ friends. In how many ways he can invite one or more of them for a tea party
In a city no two persons have identical set of teeth and there is no person without a tooth. Also no person has more than $32$ teeth. If we disregard the shape and size of tooth and consider only the positioning of the teeth, then the maximum population of the city is
The value of $^{15}{C_3}{ + ^{15}}{C_{13}}$ is
There are $m$ men and two women participating in a chess tournament. Each participant plays two games with every other participant. If the number of games played by the men between themselves exceeds the number of games played between the men and the women by $84,$ then the value of $m$ is
The solution set of $^{10}{C_{x - 1}} > 2\;.{\;^{10}}{C_x}$ is