There exists α∈S so that {gcd(α,s)∣s∈S,s=α} contains at least two elements. Since α has only finitely many divisors, there is a d∣α such that the set B={β∈S∣gcd(α,β)=d} is infinite. Pick γ∈S so that gcd(α,γ)=d. Pick β1,β2∈B so that gcd(β1,γ)=gcd(β2,γ)=:d′. If d=d′, then gcd(α,β1)=gcd(γ,β1)=gcd(α,γ). If d=d′, then either gcd(α,β1)=gcd(α,β2)=d and gcd(β1,β2)=d or gcd(γ,β1)=gcd(γ,β2)=d′ and gcd(β1,β2)=d′.