olymmath

CWMO 2019 Problem 8

    We call a set SS a good set if S={x,2x,3x}(x≠0).S=\{x,2x,3x\}(x\neq 0). For a given integer n(n≥3),n(n\geq 3), determine the largest possible number of the good subsets of a set containing nn positive integers.

    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 cn-wmo/2019/p8 · Tag N3AP95ZCMX · Edit this page on GitHub · Keys: j next, k previous