can someone surely confirm if the answer to this question is 126 or 47?
X1, X2...,X9 are nine points on the circumference of circle O. Line segments are drawn connecting each pair of points.
What is the largest number of different points inside the circle at which at least two of these line segments intersect? (Remember that the points are not necessarily evenly spaced around the circle.)
What you coudl do is draw an octagon and find the intersection points. When I did this with on octagon, it made more points forming another octagon, and there were 49 of them. So I think both answers are off. :)