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.
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.
@Satvik Golechha how's the approach ?
Log in to reply
Awesome. You are the king of recurrences.
Log in to reply
How did you solve it? @Satvik Golechha
Log in to reply
@Krishna Ar – I took a large sheet of paper... :D
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?
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.
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?
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
Log in to reply
@Aditya Raut – Thnx Adi......wonderfully solved
@Aditya Raut – Thanks ...
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!
Log in to reply
Euclid once said, "All non-parallel lines meet somewhere before infinity", or something like that.
Log in to reply
Perfect reply @Satvik Golechha , truly said
Oh, yes thanks, I got it.
They must intersect because they are not parallel. And they will make distinct regions because no 3 are concurrent. Thus the recurrence holds.
Problem Loading...
Note Loading...
Set Loading...
We solve this by recurrence relations.
Let n lines divide the plane in a n parts.
Thus, when we draw k t h line, there are already a k − 1 regions formed.
The k t h line will intersect all the other k − 1 lines, and this will add k more regions (in the outer part, which you can call infinitely large regions.)
Thus we have a n = a n − 1 + n
Writing a n − 1 = a n − 2 + n − 1 and so on, we have
a n = a 0 + 2 n ( n + 1 ) = 1 + 2 n ( n + 1 )
This is because 0 lines divide the plane in 1 part, the plane itself.
For n = 6 , we have a 6 = 1 + 2 6 × 7 = 1 + 2 1 = 2 2