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

Among $10$ points in a plane,no three points are collinear and $4$ points are concyclic. How many distinct circles can be drawn using at least $3$ of these points?

In the given figure,$6$ '$A$'s should be written in such a manner that every row contains at least one '$A$'. The number of ways this is possible is

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

There is a rectangular sheet of dimension $(2m - 1) \times (2n - 1)$,(where $m > 0, n > 0$). It has been divided into squares of unit area by drawing lines perpendicular to the sides. Find the number of rectangles having sides of odd unit length.

There were two women participating in a chess tournament. Every participant played two games with every other participant. The number of games that the men played between themselves exceeded the number of games that the men played with the women by $66$. The total number of participants is

Vedclass Test Series

Exam Paper Generator

Online Exam Module