A diophantine problem of Frobenius in terms of the least common multiple (Q1916124)

The Frobenius number \(g= g(a_1, \dots, a_n)\), i.e. the greatest number such that there do not exist nonnegative integers \(x_1, \dots, x_n\) satisfying \(g= a_1 x_1+ \dots+ a_n x_n\), \(a_1, \dots, a_n\) relatively prime and \(1\leq a_1< \dots< a_n\), is given for so called strongly flat and flat systems \(a_1, \dots, a_n\). A set of relatively prime numbers \(a_1, \dots, a_n\) is called strongly flat (resp. flat) iff there exist pairwise prime natural numbers \(q_1, \dots, q_n\) so that \[ \forall i: a_i= \prod^n_{\substack{ j=1\\ j\neq i}} q_j\qquad (resp.\;\exists i: a_i= \prod^n_{\substack{ j=1\\ j\neq i}} q_j). \] In the case of strongly flat systems one has \(g(a_1, \dots, a_n)= (n-1)\) lcm \(\{a_1, \dots, a_n\}- \sum^n_{i=1} a_i\), and this is a generalization of \(g(a_1, a_2)= a_1 a_2- a_1- a_2\), the well known formula in the case \(n=2\), where all systems with relatively prime \(a_1\), \(a_2\) are strongly flat.