Suppose we have n distinct lines on a plane. What is the maximum and minimum number of intersections?

Suppose we have n distinct points on a plane. What is the maximum and minimum number of line that they can form?

What is the maximum number of region that n lines can divide a plane into?

Given n collinear points , what is the maximum and minimum distance between the points?

Arrange seven points on a plane such that , for any 3 points , we can find 2 points with distance 1.

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

## Comments

Sort by:

TopNewestMinimum=1, all points are collinear. For maximum, assume all points on a circle, ie. no 3 of them are collinear, this will give again \(\dbinom{n}{2}\)

This can be proved by recursion. See complete proof here

Minimum\(=0^+\), maximum\(=\infty\). Either I am not understanding it properly or its vague.

Log in to reply

For 1 , 2 , how do u know that it is N 2 ?? And , can you please explain what's that……??

Log in to reply

How many ways are there to select \(2\) objects from \(N\) given objects? That's \(\dbinom{N}{2}\). Thus, in \(1.\), I selected \(2\) lines out of \(n\) to find number of intersections. Similarly, in \(2.\), I selected \(2\) points out of \(n\) points, to draw a line.

In general, \(\dbinom{x}{y}\) is the number of ways to

select\(y\) objects out of \(x\) given objects. For more details, see this. I hope it helps.Though if you don't know about Permutations as well, I'll recommend you to read a wiki on permuations from here first.

\(\dbinom{N}{2}=\dfrac{N(N-1)}{2}\)

If you need some more help, feel free to either comment here or at Moderator's Messageboard hereLog in to reply

Thank you.

Log in to reply

Say, we are given \(5\) objects, \((A,B,C,D,E)\)

{(A,B),(A,C),(A,D),(A,E),(B,C),(B,D),(B,E),(C,D),(C,E),(D,E)}

{(A,B,C,D),(A,B,C,E),(A,B,D,E),(A,C,D,E),(B,C,D,E)}

{(A,B,C,D,E)}

Log in to reply

Solution needed.

Log in to reply