olymmath

VN-TST 1999 Problem 3

  • Day 1

Let a convex polygon HH be given. Show that for every real number a∈(0,1)a \in (0, 1) there exist 6 distinct points on the sides of HH , denoted by A1,A2,…,A6A_1, A_2, \ldots, A_6 clockwise, satisfying the conditions:

I. (A1A2)=(A5A4)=a⋅(A6A3)(A_1A_2) = (A_5A_4) = a \cdot (A_6A_3) . II. Lines A1A2,A5A4A_1A_2, A_5A_4 are equidistant from A6A3A_6A_3 .

(By (AB)(AB) we denote vector ABAB )

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