olymmath

AHSME 1968 Problem 30

    Convex polygons P1P_1 and P2P_2 are drawn in the same plane with n1n_1 and n2n_2 sides, respectively, n1≤n2n_1\le n_2. If P1P_1 and P2P_2 do not have any line segment in common, then the maximum number of intersections of P1P_1 and P2P_2 is: (A) 2n1(B) 2n2(C) n1n2(D) n1+n2(E) none of these\text{(A) } 2n_1 \text{(B) } 2n_2 \text{(C) } n_1n_2 \text{(D) } n_1+n_2 \text{(E) } \text{none of these}

    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.

    Add a solution

    Similar problems

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

    Locator ahsme/1968/p30 · Tag 5QQANA18NW · Edit this page on GitHub · Keys: j next, k previous