Let M be a set of positive
integers which is closed under multiplication and division whenever possible: if
m,n ∈ M and m∣n, then n∕m ∈ M. A closed factor of M is a subset K ⊂ M which
is closed under multiplication and for which there is another subset R ⊂ M such that
every member of M is uniquely representable as a product kr with k ∈ K and
r ∈ R. A theory is developed for determining all closed factors of a given M.
The theory can be adapted to an analogous problem for convex polyhedral
cones.