in Combinatory
1,022 views
0 votes
0 votes
  1. Find the recurrence relation satisfied by $R_{n},$ where $R_{n}$ is the number of regions that a plane is divided into by $n$ lines, if no two of the lines are parallel and no three of the lines go through the same point.
  2. Find $R_{n}$ using iteration.
in Combinatory
by
1.0k views

1 Answer

0 votes
0 votes
One line divide a plane in 2 region and two unparalleled lines divide a plane in 4 regions.

So,

a) $R_{n}=R_{n-1}+n$

Suppose, there are $R_{n-1}$ parallel lines, which divides the plane in $R_{n-1}$ regions.

and 1 unparallel line , cut each parallel line in 1 point, which add n more region in the plane.
edited by

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true