NMTC Practice Part 5

Six straight lines are drawn on the same plane such that no two of them are parallel, and no three are concurrent. Find the number of regions in which these lines divide this plane.


The answer is 22.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Aditya Raut
Aug 22, 2014

We solve this by recurrence relations.

Let n n lines divide the plane in a n a_n parts.

Thus, when we draw k t h k^{th} line, there are already a k 1 a_{k-1} regions formed.

The k t h k^{th} line will intersect all the other k 1 k-1 lines, and this will add k k more regions (in the outer part, which you can call infinitely large regions.)

Thus we have a n = a n 1 + n a_n=a_{n-1}+n

Writing a n 1 = a n 2 + n 1 a_{n-1} = a_{n-2} +n-1 and so on, we have

a n = a 0 + n ( n + 1 ) 2 = 1 + n ( n + 1 ) 2 a_n= a_0 + \dfrac{n(n+1)}{2} = 1+ \dfrac{n(n+1)}{2}

This is because 0 lines divide the plane in 1 part, the plane itself.

For n = 6 n=6 , we have a 6 = 1 + 6 × 7 2 = 1 + 21 = 22 a_6 = 1 + \dfrac{6\times 7}{2} = 1+21 =\boxed{22}

@Satvik Golechha how's the approach ?

Aditya Raut - 6 years, 9 months ago

Log in to reply

Awesome. You are the king of recurrences.

Satvik Golechha - 6 years, 9 months ago

Log in to reply

How did you solve it? @Satvik Golechha

Krishna Ar - 6 years, 9 months ago

Log in to reply

@Krishna Ar I took a large sheet of paper... :D

Satvik Golechha - 6 years, 9 months ago

Wow....cool solution. I knew this kind of a formula, but was confused because of the guidelines like no two are arallel, no three concureent and all that...is this formula applicable for all and any such extensions?

Jayakumar Krishnan - 6 years, 9 months ago

Log in to reply

You also can generalise any problem using recurrences and derive formulas. There are such recurrences for intersecting circles, reflections of a ray from inner surfaces of lines etc , the one in above solution is a simple type of recurrence.

Aditya Raut - 6 years, 9 months ago

Log in to reply

Yes surely thanks for the info. My question was like if the question above was change like no 5 lines are parallel, no 10 lines are concurrent....will the mehtod /formula be the same?

Jayakumar Krishnan - 6 years, 9 months ago

Log in to reply

@Jayakumar Krishnan Nopes, then everything changes. The answer given by the above formula will be the maximum possible answer in your asked case, like 5 parallel and all. In that case, the number given by the recurrence used above will be the maximum number of regions in which lines will divide the plane

Aditya Raut - 6 years, 9 months ago

Log in to reply

@Aditya Raut Thnx Adi......wonderfully solved

Anik Kumar Bhushan - 6 years, 9 months ago

@Aditya Raut Thanks ...

Jayakumar Krishnan - 6 years, 9 months ago

I also did the same way but the question doesn't say that "the kth line intersects all the other k-1 lines." Well, there maybe more combinations allowed for the given conditions, I think!

Kartik Sharma - 6 years, 9 months ago

Log in to reply

Euclid once said, "All non-parallel lines meet somewhere before infinity", or something like that.

Satvik Golechha - 6 years, 9 months ago

Log in to reply

Perfect reply @Satvik Golechha , truly said

Aditya Raut - 6 years, 9 months ago

Oh, yes thanks, I got it.

Kartik Sharma - 6 years, 9 months ago

They must intersect because they are not parallel. And they will make distinct regions because no 3 are concurrent. Thus the recurrence holds.

Aditya Raut - 6 years, 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...