Dissection of Plane with Lines

Problem 1. Let the maximum number of sections of the plane you can divide with 2n2n lines be the function f(n)f(n). Let the maximum number of sections of the plane you can divide with nn pairs of parallel lines be g(n)g(n). Prove that f(n)>g(n)f(n) > g(n) for n>0n > 0.

Problem 2. Let the maximum number of sections of the plane you can divide with 2n2n lines be the function f(n)f(n). Let the maximum number of sections of the plane you can divide with nn pairs of perpendicular lines be g(n)g(n). Prove that f(n)=g(n)f(n)=g(n) for n>0n > 0.


If any of these two problems are actually wrong, feel free to disprove it in the comments.

Note by Daniel Liu
5 years, 6 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

Sort by:

Top Newest

Problem 1.\textbf{Problem 1.}

Let f(n)f(n) denote the number of regions a plane is divided by n lines....

Clearly f(1)=2f(1) = 2 , f(2)=4f(2) = 4 and f(3)=7f(3) = 7.

Now let us think about the recursive definition of the function f(n)f(n),when the nth line enters the [plane it intersect each of the previous n1n-1 lines at one point only and in process creates nn new regions.Hence f(n)=f(n1)+nf(n) = f(n-1) + n

Solving this and putting f(1)=2f(1) = 2, we get, f(n) =1+n(n+1)2f(n)\ = 1+\frac{n(n+1)}{2}

So clearly the number of regions a plane is divided by 2n2n lines is f(2n)=1+n(2n+1)=1+2n2+nf(2n) = 1+n(2n+1) = 1+ 2n^{2} + n.

Now let us the consider n pairs of parallel lines...

By inspection we can say that g(1)=3g(1) = 3 and g(2)=9g(2) = 9,

Now let us consider the nth pair of parallel lines being drawn...each line intersects the previous 2n22n - 2 lines to form 2n12n-1 regions!!

So the recursive definition is g(n)=g(n1)+2(2n1)g(n) = g(n-1) + 2(2n-1)

Solving this recurrence relation we get g(n)=1+2n2g(n) = 1 + 2n^{2}. This relation's validity can easily be proved by induction.

Hence f(n)=1+2n2+n>1+2n2>g(n)f(n) = 1+2n^{2} + n > 1+2n^{2} > g(n).

Eddie The Head - 5 years, 6 months ago

Log in to reply

I think perpendicular lines will also follow the same recursion as f(n)f(n) and hence the 2nd identity also correct....

Eddie The Head - 5 years, 6 months ago

Log in to reply

Here you have no where mentioned whether the lines can coincide wholly with each other.......

Krishna Viswanathan - 5 years, 6 months ago

Log in to reply

If I understand what you are saying, then yes, more than three lines can intersect at one place. However, that case will not give the maximum number of sections.

Daniel Liu - 5 years, 6 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...