What is the number of triangles that can be formed by choosing the vertices from a set of 12 points in a plane, seven of which lie on the same straight line?
185
Let's break down how to calculate the number of triangles that can be formed from a given set of points, especially when some of those points lie on the same straight line (are collinear).
We are given:
A triangle is formed by choosing 3 points that are not collinear. If we choose 3 points that are collinear, they will lie on a straight line and cannot form a triangle.
First, let's find the total number of ways to choose any 3 points from the 12 points, without considering if they are collinear or not. This can be done using the combination formula $\binom{n}{k}$, where $n$ is the total number of items to choose from, and $k$ is the number of items to choose.
Here, $n = 12$ (total points) and $k = 3$ (points needed for a triangle).
The total number of ways to choose 3 points from 12 is:
$\binom{12}{3} = \frac{12!}{3!(12-3)!} = \frac{12!}{3!9!}$
Let's calculate this value:
$\binom{12}{3} = \frac{12 \times 11 \times 10 \times 9!}{ (3 \times 2 \times 1) \times 9!} = \frac{12 \times 11 \times 10}{6}$
$\binom{12}{3} = 2 \times 11 \times 10 = 220$
So, there are 220 ways to choose any 3 points from the 12 points.
Next, we need to find the number of ways to choose 3 points specifically from the set of 7 collinear points. Any combination of 3 points chosen from these 7 will be collinear and will not form a triangle.
Using the combination formula again, with $n = 7$ (collinear points) and $k = 3$ (points to choose):
The number of ways to choose 3 points from the 7 collinear points is:
$\binom{7}{3} = \frac{7!}{3!(7-3)!} = \frac{7!}{3!4!}$
Let's calculate this value:
$\binom{7}{3} = \frac{7 \times 6 \times 5 \times 4!}{(3 \times 2 \times 1) \times 4!} = \frac{7 \times 6 \times 5}{6}$
$\binom{7}{3} = 7 \times 5 = 35$
So, there are 35 ways to choose 3 points that are collinear and therefore cannot form a triangle.
The number of triangles that can be formed is the total number of ways to choose 3 points minus the number of ways to choose 3 collinear points (which do not form triangles).
Number of Triangles = (Total ways to choose 3 points) - (Ways to choose 3 collinear points)
Number of Triangles = $\binom{12}{3} - \binom{7}{3}$
Number of Triangles = $220 - 35$
Number of Triangles = $185$
Therefore, 185 triangles can be formed by choosing vertices from the set of 12 points, seven of which are collinear.
The final answer is 185.
| Concept | Description | Formula / Calculation |
|---|---|---|
| Total Points | The total number of points available. | 12 |
| Collinear Points | Points lying on the same straight line. | 7 |
| Points for Triangle | Number of non-collinear points needed to form a triangle. | 3 |
| Total Combinations of 3 points | Ways to choose 3 points from the total set. | $\binom{12}{3} = 220$ |
| Collinear Combinations of 3 points | Ways to choose 3 points from the collinear set (do not form triangles). | $\binom{7}{3} = 35$ |
| Number of Triangles | Total combinations minus collinear combinations. | $220 - 35 = 185$ |
This problem combines concepts from combinatorics (counting principles) and basic geometry.
What is the number of 6-digit numbers that can be formed only by using 0, 1, 2, 3, 4 and 5 (each once); and divisible by 6 ?
Consider the following statements for a fixed natural number n:
1. C(n, r) is greatest if n = 2r
2. C(n, r) is greatest if n = 2r - 1 and n = 2r + 1
Which of the statements given above is/are correct ?
Let x be the number of permutations of the word ‘PERMUTATIONS’ and y be the number of permutations of the word ‘COMBINATIONS’. Which one of the following is correct ?
What is the number of ways in which 3 holiday travel tickets are to be given to 10 employees of an organization, if each employee is eligible for any one or more of the tickets?
A polygon has 44 diagonals then the number of its sides is