olymmath

RO-NMO 2003 Problem 71

  • Grade 7

Find the maximum number of elements which can be chosen from the set {1,2,3,…,2003}\{1,2,3,\ldots,2003\} such that the sum of any two chosen elements is not divisible by 3.

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 ro-nmo/2003/p71 · Tag X5M469GJQW · Edit this page on GitHub · Keys: j next, k previous