Let n 2 be an integer. Suppose that there a | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(C) The number of blue lines corresponds to the number of sides of the polygon formed by the $n$ stations,which is $n$.The total number of ways to con

Vedclass · Accepted Answer

$201$

Vedclass · Answer

(C) The number of blue lines corresponds to the number of sides of the polygon formed by the $n$ stations,which is $n$.The total number of ways to connect any two stations is given by the combination formula ${}^{n}C_{2}$.The number of red lines is the total number of connections minus the number of blue lines (sides),which is the number of diagonals: ${}^{n}C_{2} - n$.According to the problem,the number of red lines is $99$ times the number of blue lines:${}^{n}C_{2} - n = 99n$Substituting the formula for ${}^{n}C_{2}$:$\frac{n(n-1)}{2} - n = 99n$Dividing both sides by $n$ (since $n > 2$):$\frac{n-1}{2} - 1 = 99$$\frac{n-1}{2} = 100$$n - 1 = 200$$n = 201$

Similar Questions

How many triangles can be drawn by means of $9$ non-collinear points?

The number of triangles that can be formed by $5$ points on a line and $3$ points on a parallel line is

There are $3, 4,$ and $5$ points on the sides $AB, BC,$ and $CA$ of a triangle $ABC$ respectively. How many triangles can be formed using these points as vertices?

Six '$X$'s have to be placed in the squares of the figure such that each row contains at least one '$X$'. In how many different ways can this be done?

Vedclass Test Series

Exam Paper Generator

Online Exam Module