RankRizz
JEE MAIN 2026 · 02 APR S2+4 / −1EASYTRANSCRIBED

JEE Main 2026 Mathematics question — Counting in geometry

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

SOLUTION

For a convex regular polygon, any choice of three distinct vertices forms a triangle. Hence, the total number of triangles that can be drawn is simply the combination

pn=(n3)=n(n−1)(n−2)6p_n = \binom{n}{3} = \frac{n(n-1)(n-2)}{6}

The condition given in the question is

pn+1−pn=66p_{n+1} - p_n = 66

Compute each term:

pn+1=(n+13)=(n+1)n(n−1)6p_{n+1}= \binom{n+1}{3}= \frac{(n+1)n(n-1)}{6}
pn=(n3)=n(n−1)(n−2)6p_n = \binom{n}{3}= \frac{n(n-1)(n-2)}{6}

Subtracting, we get

pn+1−pn=(n+1)n(n−1)−n(n−1)(n−2)6p_{n+1}-p_n = \frac{(n+1)n(n-1) - n(n-1)(n-2)}{6}

Factor out the common term n(n−1)n(n-1):

pn+1−pn=n(n−1)[(n+1)−(n−2)]6=n(n−1)×36=n(n−1)2p_{n+1}-p_n = \frac{n(n-1)\big[(n+1)-(n-2)\big]}{6} = \frac{n(n-1)\times 3}{6} = \frac{n(n-1)}{2}

Set this equal to the given value 66:

n(n−1)2=66⟹n(n−1)=132\frac{n(n-1)}{2}=66 \quad\Longrightarrow\quad n(n-1)=132

This is a quadratic equation:

n2−n−132=0n^2-n-132=0

Factoring (or using the quadratic formula) gives

(n−12)(n+11)=0⟹n=12  (positive solution)(n-12)(n+11)=0\quad\Longrightarrow\quad n=12\;(\text{positive solution})

The distinct prime factors of 1212 are 22 and 33. Their sum is

2+3=52+3 = 5

Therefore, the required sum is 55.

Option C which is: 5

Tagged Counting in geometry. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicCounting in geometry
TypeMultiple choice