LogicalAndReasoning PUMaC Intermediate
2014


Problem - 2551
Let there be $320$ points arranged on a circle, labeled $1$, $2$, $3$, $\cdots$, $8$, $1$, $2$, $3$, $\cdots$, $8$, $\cdots$ in order. Line segments may only be drawn to connect points labeled with the same number. What is the largest number of non-intersecting line segments one can draw? (Two segments sharing the same endpoint are considered to be intersecting).

The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error