Let n geq 2 be an integer. Take n distinct po | vedclass

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

Question

(C) The total number of line segments formed by joining $n$ points is given by $\binom{n}{2} = \frac{n(n-1)}{2}$.The number of line segments joining a

Vedclass · Accepted Answer

$5$

Vedclass · Answer

(C) The total number of line segments formed by joining $n$ points is given by $\binom{n}{2} = \frac{n(n-1)}{2}$.The number of line segments joining adjacent points (which form the sides of an $n$-sided polygon) is $n$.The number of line segments joining non-adjacent points (which are the diagonals of the polygon) is $\binom{n}{2} - n$.According to the problem,the number of blue segments (adjacent) equals the number of red segments (non-adjacent):$n = \binom{n}{2} - n$$2n = \frac{n(n-1)}{2}$$4n = n^2 - n$$n^2 - 5n = 0$$n(n - 5) = 0$Since $n \geq 2$,we have $n = 5$.

Let $n \geq 2$ be an integer. Take $n$ distinct points on a circle and join each pair of points by a line segment. Colour the line segment joining every pair of adjacent points blue and the rest red. If the number of red and blue line segments are equal,then the value of $n$ is

Similar Questions

Two squares are chosen at random on a chessboard. The probability that they have a side in common is:

In how many ways can $21$ English books and $19$ Hindi books be placed in a row so that no two Hindi books are together?

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?

Ten points lie in a plane such that no three of them are collinear. The number of lines passing through exactly two of these points and dividing the plane into two regions,each containing four of the remaining points,is

The number of shortest paths from $HOSTEL$ to $ALLEN$ is equal to (as shown in the given figure):

Vedclass Test Series

Exam Paper Generator

Online Exam Module