olymmath

KZ-MO 2001 Problem 8

    There are n≥4n \geq4 points on the plane, the distance between any two of which is an integer. Prove that there are at least 16\frac {1} {6} distances, each of which is divisible by 33 .

    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 kz-mo/2001/p8 · Tag 9K0MWN4FHZ · Edit this page on GitHub · Keys: j next, k previous