olymmath

BALTIC-WAY 1999 Problem 10

    Can the points of a disc of radius 1 (including its circumference) be partitioned into three subsets in such a way that no subset contains two points separated by distance 1 ?

    Dataset text NuminaMath olympiads. 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

    Locator baltic-way/1999/p10 · Tag FEWV2ARXMV · Edit this page on GitHub · Keys: j next, k previous