olymmath

OMM 2002 Problem 5

    A trio is a set of three distinct integers such that two of the numbers are divisors or multiples of the third. Which trio contained in {1,2,...,2002}\{1, 2, ... , 2002\} has the largest possible sum? Find all trios with the maximum sum.

    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 mx-omm/2002/p5 · Tag YP1CFS7ZA7 · Edit this page on GitHub · Keys: j next, k previous