olymmath

KöMaL 2009 A492

    For every finite, nonempty set HH of positive integers, denote by gcd(H)\mathrm{gcd}(H) the greatest common divisor of the elements in HH. Show that if AA is a finite, nonempty set of positive integers then the following inequality holds: ∑∅≠H⊆A(−2)∣H∣−1gcd(H)>0.\sum_{\emptyset\ne H\subseteq A} {(-2)}^{|H|-1} \mathrm{gcd}(H) > 0.

    Official text KöMaL. 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 hu-komal/2009/a492 · Tag QH9RJD97SR · Edit this page on GitHub · Keys: j next, k previous