Purchase Solution

Proof by Mathematical Induction : Planes, Lines and Regions

Not what you're looking for?

Ask Custom Question

Suppose that n straight lines in the plane are positioned so that no two are parallel an no three pass throught the same point. Show that they divide the plane into 1/2(n^2 + n + 2) distinct regions.

Purchase this Solution
Solution Summary

A proof linking lines, planes and regions is provided.

Solution Preview

First we prove that how many distinct regions will be created if the n+1th line show up in the plane where there are n lines exist already.

That's will be easy to find that there will be n+1 distint regions created if the n+1th line show ...

Purchase this Solution
Free BrainMass Quizzes
Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

View More Free Quizzes
Related BrainMass Solutions

  • Real Analysis : Fold Lines

    The proof is very simple: We need to show that if a map intersected by n lines is a valid map, then the map constructed by n+1 lines is also valid.

  • Several proofs by induction

    works perfectly and generates a true statement for n=1,2 and the proof is only two lines The solution demonstrates the use of induction in proving mathematical identities.

  • Mathematical induction proof

    A complete, detailed proof (by mathematical induction) of the given assertion is presented, the importance of the basis step in an induction proof is discussed, and an example of how wrong results can be obtained if the basis step in an induction proof

  • Proof of principles

    This is a proof regarding well-ordering principle and principle of mathematical induction.

  • Mathematical Induction

    147413 Proof by Mathematical Induction Use mathematical induction to prove that the given statement is true for all positive integers n. n! <= n^n Proof: If n=1, n!=1!=1 and 1^1=1. So n!<=n^n holds for n=1. Suppose n!

  • Mathematical induction

    See attached This solution provides a mathematical induction proof.

  • Guessing a Formula for a Summation and Proving it by Mathematical Induction

    By hypothesis , so So, we proved that . We are done by induction. A formula is guessed and proven by mathematical induction. A formula using mathematical induction is determined.

  • Proof of Inequality by Mathematical Induction

    11574 Proof of Inequality by Mathematical Induction Prove that (n + 1)!>2^(n+3) for n>=3 Hint: try using mathematical induction NOTE: When n=3, (n+1)!=4!=24<2^(n+3)=2^6=64; when n=4, (n+1)!=5!

  • Induction Mathematical Proof and Odd and Even Powers

    The induction mathematical proof and odd and even powers.

View More Related Solutions