RankRizz
JEE MAIN 2020 · 02 SEP S2+4 / −1MEDIUMTRANSCRIBED

JEE Main 2020 Mathematics question — Circular permutations

Let n>2n > 2 be an integer. Suppose that there are nn Metro stations in a city located around a circular path. Each pair of the nearest stations is connected by a straight track only. Further, each pair of the nearest station is connected by blue line, whereas all remaining pairs of stations are connected by red line. If number of red lines is 99 times the number of blue lines, then the value of nn is:

SOLUTION

We have nn Metro stations placed on a circle, with n>2n > 2. For any two stations we draw exactly one straight track, so overall the network is the complete graph on nn vertices.

Among these tracks, those joining the two stations that are next to each other on the circle are declared blue. Because the stations form a single closed polygon, every station is adjacent to exactly two neighbours, but every such edge is counted only once. Hence the number of blue tracks equals the number of sides of the polygon, namely

Blue lines=n.\text{Blue lines}=n.

All the other tracks, i.e. those whose ends are not nearest neighbours on the circle, are coloured red. Let us count how many tracks there are altogether. In a complete graph on nn vertices, the number of unordered pairs of vertices (and hence the number of tracks) is given by the combination formula

(n2)=n(n−1)2.\binom{n}{2}= \frac{n(n-1)}{2}.

Therefore

Total tracks=n(n−1)2.\text{Total tracks}= \frac{n(n-1)}{2}. Red lines=Total tracks−Blue lines=n(n−1)2−n.\text{Red lines}= \text{Total tracks}-\text{Blue lines}= \frac{n(n-1)}{2}-n.

The condition given in the question says that the number of red lines is 99 times the number of blue lines, that is,

n(n−1)2−n=99 n.\frac{n(n-1)}{2}-n = 99\,n.

Now we solve this equation step by step. First clear the fraction by multiplying both sides by 2:

n(n−1)−2n=198 n.n(n-1) - 2n = 198\,n.

Expand the left side:

n2−n−2n=198 n.n^2 - n - 2n = 198\,n.

Combine like terms on the left:

n2−3n=198 n.n^2 - 3n = 198\,n.

Bring the right‐hand side to the left:

n2−3n−198 n=0,n^2 - 3n - 198\,n = 0, n2−201 n=0.n^2 - 201\,n = 0.

Factor out nn:

n (n−201)=0.n\,(n-201)=0.

Since we are told n>2n>2, the factor n=0n=0 is impossible. Hence we must have

n−201=0⟹n=201.n-201 = 0 \quad\Longrightarrow\quad n = 201.

Hence, the correct answer is Option A.

Tagged Circular permutations. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicCircular permutations
TypeMultiple choice