olymmath

US-TST 2010 Problem 6

    Let TT be a finite set of positive integers greater than 1. A subset SS of TT is called good if for every t∈Tt \in T there exists some s∈Ss \in S with gcd⁡(s,t)>1\gcd(s, t) > 1 . Prove that the number of good subsets of TT is odd.

    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 us-tst/2010/p6 · Tag P4C7PF7B4K · Edit this page on GitHub · Keys: j next, k previous