Abstract:
Equivalence of primitive sets of natural numbers is investigated in connection with the diophantine Frobenius problem. The equivalence is used to simplify calculations of Frobenius number $g(a_1,\ldots,a_k)$ and all numbers that are not contained in the additive semigroup generated by the set $\{a_1,\ldots,a_k\}$.
Keywords:Frobenius's function, primitive set, additive semigroups of numbers.