olymmath

MEMO 2012 I2

    Let NN be a positive integer. A set S⊂{1,2,⋯ ,N}S \subset \{ 1, 2, \cdots, N \} is called allowed if it does not contain three distinct elements a,b,ca, b, c such that aa divides bb and bb divides cc . Determine the largest possible number of elements in an allowed set SS .

    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 memo/2012/i2 · Tag 5GGDNBFDME · Edit this page on GitHub · Keys: j next, k previous