2006 Romanian NMO Problems/Grade 7/Problem 4

From AoPSWiki

Revision as of 12:32, 27 August 2008 by 1=2 (Talk | contribs)

(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

Problem

Let $A$ be a set of positive integers with at least 2 elements. It is given that for any numbers $a>b$ , $a,b \in A$ we have $\frac{ [a,b] }{ a- b } \in A$ , where by $[a,b]$ we have denoted the least common multiple of $a$ and $b$ . Prove that the set $A$ has exactly two elements.