Waste less time on Facebook — follow Brilliant.

A neat generalization .

I found a question which is indeed beautiful in its simplicity. Draw 4 straight lines at random .

a) In how many regions do the lines intersect ?

b) How many triangles are formed ?

c) Into how many regions is the plane divided?

Can there be a general solution to these questions? Please post your thoughts about it.

Note by Raven Herd
1 year, 7 months ago

No vote yet
1 vote


Sort by:

Top Newest

Yep, indeed there exists a generalization for it.

Suppose you have \(n\) lines in a plane out of which \(m\) are parallel (assuming they are not concurrent lines). Then,

a) (I assume you are asking for number of points in which these lines intersect)

So, the number of points in which these lines intersect are \({n \choose 2} - {m \choose 2}\). This is because out of \(n\) lines in the plane you can always pick up two of these lines and it's obvious that these lines will intersect at a unique point iff they are not parallel. Thus total number of intersection points will be \({n \choose 2}\) But, notice that we have also counted extra cases because we have some lines parallel. These extra intersection points will be \({m \choose 2}\) So we have to subtract this and thus we get our result.

b) We can always draw a triangle from 3 given points (provided that they are not collinear). And also we know that we will get 3 points from intersection of 3 non-parallel lines. Thus, total number of triangles will be \({n \choose 3}\) . But again we have counted some extra cases because we also have \(m\) parallel lines which won't result in 3 intersection points and thus no triangle . Number of these extra triangles will be \({m \choose 3}\). Now also notice that we need to subtract even those cases in which we have only two of the lines parallel. Thus, we will have a total of \({n \choose 3}-{m \choose 3}-{m \choose 2}\) triangles from the intersection of these \(n\) lines out of which \(m\) are parallel.

c) I'm right now thinking over this case.

Even more generalized case exists when you take \(n\) lines in a plane out of which \(m_1\) are parallel to each other, then another set \(m_2\) lines are parallel \(\ldots\) another set of \(m_i\) lines are parallel and they are also concurrent. You can even cross-check the above results for small number of cases. I hope, now you'll be able to solve those problems for \(n=4, m=0\) case. (I'll soon be coming up with rest of the cases and more generalized results too)


Kishlaya Jaiswal.. Kishlaya Jaiswal · 1 year, 7 months ago

Log in to reply

@Kishlaya Jaiswal Thank you for your work but I need to dwell more on the minute threads of logic which you have implanted in there.Honestly speaking it took me around 1/2 hour to read this and still I constructed an example to understand the little part I fathomed. Raven Herd · 1 year, 7 months ago

Log in to reply

@Kishlaya Jaiswal I don't think that is the general case. You've forgotten to account for the fact if the lines are concurrent or if there are more pairs of parallel lines (For example, if the lines make a parallelogram).

Also, in part (b), you forgotten to subtract the case when there are \( 2 \) parallel lines and one line not parallel to them. Siddhartha Srivastava · 1 year, 7 months ago

Log in to reply

@Siddhartha Srivastava Oh, yes there I see! I have indeed missed many cases. I'll make the edits right now. Thanks for pointing them out. \(\ddot \smile\) Kishlaya Jaiswal · 1 year, 7 months ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...