olymmath

OPM 1998 Problem 3

  • Final day 1

Could the set {1,2,3,...,3000}\{1,2,3,...,3000\} contain a subset of 20002000 elements such that none of them is twice the size of another?

Dataset text AI-MO AoPS. Quoted with source.

Official text: Portuguese Mathematical Olympiad 1998 official paper, page 1.

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 pt-opm/1998/p3 · Tag Z8VZGJNMFK · Edit this page on GitHub · Keys: j next, k previous