![]() |
Figure 1 |
I just stumbled upon this problem, or rather a generalisation of this problem, and thought its solution was worthy of a mention. The solution was quite simple once I read it. Let's first review what the diagram shows. There are three parallel lines (labelled 1, 2 and 3) and another five non-parallel lines (labelled 4 to 8) that intersect with each other and also with the parallel lines. No three lines pass through a single point. How many triangles are formed?
Let's break the problem into two parts. Firstly let's deal with the five non-parallel lines. It takes three lines to make a triangle and so there are So the five non-parallel lines form 10 triangles with each other. The three parallel lines can each be linked to a pair of non-parallel lines. This becomes: So in total there are triangles formed.
Generalising this, if there are non-parallel lines and parallel lines then: Of course if none of the lines are parallel then and the expression simplifies accordingly. It's interesting to count the number of points as well (shown in Figure 2):
![]() |
Figure 2 |
The intersection of the lines produces 25 points, which I dutifully counted and labelled. If the points are taken in pairs, then each pair will generate a line with the result that there will be lines which is clearly not the case because many of the lines are the same as others due to the large number of collinear points.
However it can be noted that when two lines intersect, a point is created and so the following expression arises: This can be generalised to:
No comments:
Post a Comment