Question

if they have asked number of line segments, n=given points and n(n-1)/2 then what if they have asked number of points?​

Answer 1

Answer:

How can we prove by mathematical induction that for all n, the number of straight line segments determined by n points in the plane, no three of which lie on the same straight line, is n2−n2? (The line segment determined by two points is the line segment connecting them.)

Step-by-step explanation:

I know we start with the base case, where, if we call the above equation P(n), P(0), for 0 lines would be 0. But I really have no idea how to begin the inductive step. How do we know what k+1 we're supposed to arrive at?