MathDB
Set of positive integers

Source: Vietnam TST 1990, Problem 4

July 29, 2008
Ring Theorynumber theoryrelatively primegreatest common divisorleast common multiplenumber theory unsolved

Problem Statement

Let T T be a finite set of positive integers, satisfying the following conditions: 1. For any two elements of T T, their greatest common divisor and their least common multiple are also elements of T T. 2. For any element x x of T T, there exists an element x x' of T T such that x x and x x' are relatively prime, and their least common multiple is the largest number in T T.
For each such set T T, denote by s(T) s(T) its number of elements. It is known that s(T)<1990 s(T) < 1990; find the largest value s(T) s(T) may take.