Let $p_n$ denote the total number of triangles formed by joining the vertices of an $n$-side regular polygon.
If $p_{n+1} - p_n = 66$, then the sum of all distinct prime divisors of $n$ is :

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:

The number of elements in the set $S = \left\{ (r, k) : k \in \mathbb{Z} \text{ and } ^{36}C_{r+1} = \frac{6\left(^{35}C_{r}\right)}{(k^2-3)} \right\}$ is :

Let $\mathrm{S}=\{1,2,3,4,5,6,7,8,9\}$. Let $x$ be the number of 9-digit numbers formed using the digits of the set S such that only one digit is repeated and it is repeated exactly twice. Let $y$ be the number of 9 -digit numbers formed using the digits of the set S such that only two digits are repeated and each of these is repeated exactly twice. Then,