Some properties of Frobenius numbers and a fraction of symmetric semigroups in the weak limit for \(n=3\) (Q611967)

Given relatively prime integers \(a_1, a_2, \dots, a_n\), we call an integer \(k\) \textit{representable} if we can write \(k\) as a nonnegative integral linear combination of \(a_1, a_2, \dots, a_n\). The \textit{Frobenius number} is the largest integer \(g \left( a_1, a_2, \dots, a_n \right)\) that is not representable. It is well known and easy to show that \(g\left( a_1, a_2 \right) = a_1 a_2 - a_1 - a_2\), but no such simple formula exists for \(n \geq 3\). There are two main theorems in this paper. The first one states that if \(\gcd \left( a_1, a_2, \dots, a_n-1 \right) = d\), then \(d\) divides \(g \left( a_1, a_2, \dots, a_n \right) + 1\). This proves and generalizes a conjecture of V.\ I.\ Arnold. The second theorem concern the case that for every non-representable integer \(k\), \(g \left( a_1, a_2, \dots, a_n \right) - k\) is representable. The author gives a closed formula for the Frobenius number for \(n=3\) in this case.