In an election,$3$ members are to be elected from $6$ candidates. $A$ voter can cast their vote for any number of candidates but not more than the number of candidates to be elected. In how many ways can a voter cast their vote?

In how many ways can $12$ balls be distributed between two friends such that one gets $8$ balls and the other gets $4$ balls?

The product of any $r$ consecutive natural numbers is always divisible by

$A$ group of $9$ students,$s_1, s_2, \ldots, s_9$,is to be divided into three teams $X, Y$,and $Z$ of sizes $2, 3$,and $4$,respectively. Suppose that $s_1$ cannot be selected for team $X$,and $s_2$ cannot be selected for team $Y$. The number of ways to form such teams is:

$A$ class contains $b$ boys and $g$ girls. If the number of ways of selecting $3$ boys and $2$ girls from the class is $168$,then $b + 3g$ is equal to.

$n$ balls each of weight $w$. When weighed in pairs,the sum of the weights of all possible pairs is $120$. When they are weighed in triplets,the sum of the weights of all possible triplets is $480$. Then $n$ is: