Every straight line has no length

lemurs
Messages
30
Reaction score
0
ok i stuck guys here is the question.

Consideer n infinitely long straight lines. none are parrelel and no three are lines have a common intersection. show that for N>=1, the lines divide the plane into (n^2+n+2)/2.

kay I am stuck kay i now base case works.

I know that k=(k^2+k+2)/2

but how do relate that to k+1 lines... I am stuck.
I can't get them to relate for some reason.. what the trick i am missing.
 
Physics news on Phys.org
lemurs said:
ok i stuck guys here is the question.

Consideer n infinitely long straight lines. none are parrelel and no three are lines have a common intersection. show that for N>=1, the lines divide the plane into (n^2+n+2)/2.

kay I am stuck kay i now base case works.

I know that k=(k^2+k+2)/2

but how do relate that to k+1 lines... I am stuck.
I can't get them to relate for some reason.. what the trick i am missing.

First of all, every straight line has no length. But if you pick two different points A and B on the line, then \overline{AB} has a length.

Now, for n = 1 it is obvious that the line 'divides' the plane into two parts. Assume it's true for some k. You have to show it's true for some k+1, too. If it is, then it is true for every n. So, you have to find a way to show that for k+1, you have \frac{(k+1)^2+(k+1)+2}{2} = \frac{k^2+3k+4}{2}. Here's a way. First, let's assume P(k) = \frac{k^2+k+2}{2} is true for some k. Then look at the difference P(k+1) - P(k) = k+1. That means that the plane is divided into k+1 more parts than it is divided for some k. For example, if you take k = 2, and k = 3, you get that for k = 2 the plane is divided into 4 parts, and for k' = 3 it is divided into 7 parts. So, 7 - 4 = 3 = k + 1. Now, use that fact to prove the statement is true for some k+1. You have \frac{k^2+k+2}{2} + k+1 = \cdots The rest is obvious. :smile:
 
ok.. but how.. not making sense. I how would I jsutiify p(k+1) - P(K). that is not as easy..
 
lemurs said:
ok.. but how.. not making sense. I how would I jsutiify p(k+1) - P(K). that is not as easy..

You don't have to justify it. It is not a formal part of induction. You showed that for some k+1 the statement P(k+1) holds, and that's all you need to do.
 
Last edited:
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top