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.
In how many ways can a team of 5 players be selected from 8 players so as not to include a particular player?
How many four-digit natural numbers are there such that all of the digits are odd ?
If different permutations of the letters of the word 'MATHEMATICS' are listed as in a dictionary, how many words (with or without meaning) are there in the list before the first word that starts with C ?
If P (n, r) = 2520 and C (n, r) = 21, then what is the value of C (n + 1, r + 1)?
If n! has 17 zeros, then what is the value of n?
What is C(47, 4) + C(51, 3) + C(50, 3) + C(49, 3) + C(48, 3) + C(47, 3) equal to?
Let x be the number of integers lying between 2999 and 8001 which have at least two digits equal. Then x is equal to
There are 17 cricket players, out of which 5 players can bowl. In how many ways can a team of 11 players be selected so to include 3 bowlers?
The total number of 5 - digit numbers that can be composed of distinct digits from 0 to 9 is
What is the sum of all three-digit numbers that can be formed using all the digits 3,4 and 5 where repetition of digits is not allowed?
Three boxes are coloured red, blue and green and so are three balls. In how many ways can one put the balls one in each box such that no ball goes into the box of its own colour?
Six indistinguishable balls are to be distributed amongst A, B and C, such that each gets at least one. Then the number of ways to make this distribution is
A palindrome is a word that reads the same backwards and forwards. For example, the word LEVEL is a palindrome. If we are allowed to construct words that need not have a meaning, then in how many different ways can we construct a five-letter palindrome using English alphabets?
If nPr = 720 and nCr = 120, then the value of r is:
What will be the number of permutations of n different things, taken r at a time, where repeatition is allowed?