Library / /113 of 151

, 2009

Number theory Difficulty 7.0 National Olympiad, round 2 Prove it Hungary

For every finite, nonempty set $H$ of positive integers, denote by $\mathrm{gcd}(H)$ the greatest common divisor of the elements in $H$ . Show that if $A$ is a finite, nonempty set of positive integers then the following inequality holds:

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.