Given N‘, the number of non-parallel lines. The task is to find the maximum number of regions in which these lines can divide a plane.
Input : N = 3
Output : 7
Input : N = 2
Output : 4
Approach : The above image shows the maximum number of regions a line can divide a plane. One line can divide a plane into two regions, two non-parallel lines can divide a plane into 4 regions and three non-parallel lines can divide into 7 regions and so on. When the nth line is added to a cluster of (n-1) lines then the maximum number of extra regions formed is equal to n.
Now solve the recursion as follows:
L(2) – L(1) = 2 … (i)
L(3) – L(2) = 3 … (ii)
L(4) – L(3) = 4 … (iii)
. . .
. . .
L(n) – L(n-1) = n ; … (n)
Adding all the above equation we get,
L(n) – L(1) = 2 + 3 + 4 + 5 + 6 + 7 + …… + n ;
L(n) = L(1) + 2 + 3 + 4 + 5 + 6 + 7 + …… + n ;
L(n) = 2 + 2 + 3 + 4 + 5 + 6 + 7 + …… + n ;
L(n) = 1 + 2 + 3 + 4 + 5 + 6 + 7 + …… + n + 1 ;
L(n) = n ( n + 1 ) / 2 + 1 ;
The number of region in which N non-parallel lines can divide a plane is equal to N*( N + 1 )/2 + 1.
Below is the implementation of the above approach:
Time Complexity : O(1)
- Number of Triangles that can be formed given a set of lines in Euclidean Plane
- Check if a line at 45 degree can divide the plane into two equal weight parts
- Divide a number into two parts such that sum of digits is maximum
- Program to find the number of region in Planar Graph
- Maximum points of intersection n lines
- Maximum distinct lines passing through a single point
- Number of triangles in a plane if no more than two points are collinear
- Divide cuboid into cubes such that sum of volumes is maximum
- Number of triangles formed from a set of points on three lines
- Number of jump required of given length to reach a point of form (d, 0) from origin in 2D plane
- Count number of pairs of lines intersecting at a Point
- Total number of triangles formed when there are H horizontal and V vertical lines
- Number of parallelograms when n horizontal parallel lines intersect m vertical parallellines
- Find count of digits in a number that divide the number
- Find the number of ways to divide number into four parts such that a = c and b = d
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.