MathDB
Oliforum contest- final round - problem3

Source:

December 8, 2008
combinatorics unsolvedcombinatorics

Problem Statement

Let 0<a1<a2<a3<...<a10000<20000 0 < a_1 < a_2 < a_3 < ... < a_{10000} < 20000 be integers such that gcd(ai,aj)<ai,∀i<j gcd(a_i,a_j) < a_i, \forall i < j ; is 500<a1 500 < a_1 (always) true ? (own) :lol:
Back to ProblemsView on AoPS