olymmath

VN-TST 1991 Problem 1

  • Day 1

1.) In the plane let us consider a set SS consisting of n≥3n \geq 3 distinct points satisfying the following three conditions:

I. The distance between any two points ∈S\in S is not greater than 1. II. For every point A∈SA \in S , there are exactly two "neighbor" points, i.e. two points X,Y∈SX, Y \in S for which AX=AY=1AX = AY = 1 . III. For arbitrary two points A,B∈SA, B \in S , let A′,A′′A', A'' be the two neighbors of A,B′,B′′A, B', B'' the two neighbors of BB , then A′AA′′=B′BB′′A'AA'' = B'BB'' .

Is there such a set SS if n=1991n = 1991 ? If n=2000n = 2000 ? Explain your answer.

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/1991/p1 · Tag 8BHE5HXM50 · Edit this page on GitHub · Keys: j next, k previous