olymmath

US-TST 2002 Problem 3

    Let nn be an integer greater than 2, and P1,P2,⋯ ,PnP_1, P_2, \cdots , P_n distinct points in the plane. Let S\mathcal S denote the union of all segments P1P2,P2P3,…,Pn−1PnP_1P_2, P_2P_3, \dots , P_{n-1}P_{n} . Determine if it is always possible to find points AA and BB in S\mathcal S such that P1Pn∥ABP_1P_n \parallel AB (segment ABAB can lie on line P1PnP_1P_n ) and P1Pn=kABP_1P_n = kAB , where (1) k=2.5k = 2.5 ; (2) k=3k = 3 .

    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 us-tst/2002/p3 · Tag SD0CDCQC4B · Edit this page on GitHub · Keys: j next, k previous