Count number of chords with points on circumference of a circle

There are $p\ge6$ points given on circumference of a circle, and every two points are joined by a chord. Assume that no 3 chords are concurrent within the interior of the circle. We have to find the number of intersection points made by these chords inside the circle.

We count the ways to choose 4 points out of $p$ and each set of the chosen points contributes to a single intersection point inside the circle. So the answer is $$p\choose4$$ But I cannot understand the significance of the condition in bold. How will the answer change without this condition?

• That assumption is there, because otherwise the answer would not be unique. If you have got the answer to this question, you should write it down with the question, so that we can point out, at which step of the answer have you implicitly used the assumption. – астон вілла олоф мэллбэрг Jul 11 '18 at 6:39
• @астонвіллаолофмэллбэрг I don't understand how the answer will not be unique – naman jain Jul 11 '18 at 6:45
• Think of $n=6$ and the configuration where the points are the vertices of a regular hexagon. That will have fewer intersection points than the generic case. – Lord Shark the Unknown Jul 11 '18 at 6:46
• Each set of points contributes to a single intersection point inside the circle, correct. How do you know that two different sets of points always contribute different end points? If this were not true, then you would overcount the intersection points. The hypothesis ensures that this is true. – астон вілла олоф мэллбэрг Jul 11 '18 at 7:07
• Same formula works for $p=4,5.$ – coffeemath Jul 11 '18 at 7:46