olymmath

CAPS 2021 Problem 3

    For any two convex polygons P1P_1 and P2P_2 with mutually distinct vertices, denote by f(P1,P2)f(P_1, P_2) the total number of their vertices that lie on a side of the other polygon. For each positive integer n≥4n \ge 4 , determine max⁡{f(P1,P2) ∣ P1 and P2 are convex n-gons}.\max \{ f(P_1, P_2) ~ | ~ P_1 ~ \text{and} ~ P_2 ~ \text{are convex} ~ n \text{-gons} \}. (We say that a polygon is convex if all its internal angles are strictly less than 180∘180^\circ .)

    Josef Tkadlec (Czech Republic)

    Dataset text AI-MO AoPS. 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.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator caps/2021/p3 · Tag W4B1BP9ZQ0 · Edit this page on GitHub · Keys: j next, k previous