Six straight lines are drawn in a plane with no two parallel and no three concurrent. Find the number of regions into which they divide the 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.
For this problem we have to use recursion method.
Suppose, for n lines the number of regions are L n .
If there is no line in the page. Then L 0 =1.
And L 1 =2,
L 2 =4=2+2= L 1 +2,
L 3 =7=4+3= L 2 +3,
L 4 =11=7+4= L 3 +4.
So, L n = L n − 1 +n = L n − 2 +n-1+n = L 0 +1+2+.......+n-1+n
=1+ 2 n ( n + 1 )
Thus, L 6 =1+21=22