AHSME 1968 Problem 30
Convex polygons and are drawn in the same plane with and sides, respectively, . If and do not have any line segment in common, then the maximum number of intersections of and is:
Dataset text NuminaMath-1.5. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.