scientific article; zbMATH DE number 1112790

From MaRDI portal
Publication:4374413





Let \(a_1,a_2,\dots, a_n\) be relatively prime positive integers. The Frobenius problem is to determine the largest integer \(F(a_1,a_2,\dots, a_n)\) which cannot be expressed in the linear form \(a_1x_1+ a_2x_2+\cdots+ a_nx_n\), where each \(x_i\geq 0\). The result given in this paper is a special case of the following theorem proved earlier by \textit{W. Lu} and \textit{C. Wu} [J. Sichuan Univ. 2 (1957)]: Let \(t_i= \text{gcd} (a_1,a_2,\dots, a_{i-1}, a_{i+1},\dots, a_n)\) and \(a_i'\) be the integer satisfying \(a_i= a_i' t_1t_2\cdots t_{i-1} t_{i+1}\cdots t_n\). Then \[ F(a_1,a_2,\dots, a_n)= \Biggl(\sum_{i=1}^n a_i'+ F(a_1',a_2',\dots, a_n')\Biggr) t_1t_2\cdots t_n-\sum_{i=1}^n a_i. \] Note that obviously \(F(a_1',a_2',\dots, a_n')=-1\) when some \(a_i'=1\), so it implies Theorem 4, the main result in the paper.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4374413)