6 points in a plane are joined in all possibl | vedclass

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

Question

(C) The number of lines formed by joining $6$ points is given by $^6C_2 = \frac{6 	imes 5}{2} = 15$ lines.The total number of intersection points for

Vedclass · Accepted Answer

$51$

Vedclass · Answer

(C) The number of lines formed by joining $6$ points is given by $^6C_2 = \frac{6 	imes 5}{2} = 15$ lines.The total number of intersection points formed by $15$ lines,assuming no three lines are concurrent and no two are parallel,is $^{15}C_2 = \frac{15 	imes 14}{2} = 105$.However,at each of the original $6$ points,$5$ lines intersect. Since these $5$ lines are counted as intersecting at a single point,but the formula $^{15}C_2$ counts all pairs of these $5$ lines as distinct intersection points,we must adjust for this.For each of the $6$ points,the number of pairs of lines passing through it is $^5C_2 = 10$. These $10$ pairs are counted as $10$ distinct points in the $105$ total,but they all represent the same original point.Thus,for each original point,we subtract $10$ and add back $1$ (the point itself). Total distinct points $= 105 - 6 	imes (10 - 1) = 105 - 6 	imes 9 = 105 - 54 = 51$.

$6$ points in a plane are joined in all possible ways by indefinite straight lines. If no two lines are coincident or parallel,and no three lines pass through the same point (with the exception of the original $6$ points),the number of distinct points of intersection is equal to

Similar Questions

If in a regular polygon the number of diagonals is $54$,then the number of sides of this polygon is

There are $5$ letters and $5$ directed envelopes. Find the number of ways in which the letters can be put into the envelopes so that all are not put in directed envelopes?

The number of numbers that can be formed with the help of the digits $1, 2, 3, 4, 3, 2, 1$ so that odd digits always occupy odd places,is

The solution set of $^{10}C_{x-1} > 2 \cdot ^{10}C_x$ is

An eight-digit number divisible by $9$ is to be formed using digits from $0$ to $9$ without repeating the digits. The number of ways in which this can be done is: (in $(7!)$)

Vedclass Test Series

Exam Paper Generator

Online Exam Module