olymmath

BALKAN-SL 2019 N2

    Let S⊂{1,…,n}S \subset \{ 1, \dots, n \} be a nonempty set, where nn is a positive integer. We denote by ss the greatest common divisor of the elements of the set SS . We assume that s≠1s \not= 1 and let dd be its smallest divisor greater than 11 . Let T⊂{1,…,n}T \subset \{ 1, \dots, n \} be a set such that S⊂TS \subset T and ∣T∣≥1+[nd]|T| \ge 1 + \left[ \frac{n}{d} \right] . Prove that the greatest common divisor of the elements in TT is 11 .

    [Second Version] Let n(n≥1)n(n \ge 1) be a positive integer and U={1,…,n}U = \{ 1, \dots, n \} . Let SS be a nonempty subset of UU and let d(d≠1)d (d \not= 1) be the smallest common divisor of all elements of the set SS . Find the smallest positive integer kk such that for any subset TT of UU , consisting of kk elements, with S⊂TS \subset T , the greatest common divisor of all elements of TT is equal to 11 .

    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 balkan-sl/2019/n2 · Tag 2HCQCE5F5K · Edit this page on GitHub · Keys: j next, k previous