Jeffrey Shallit – The Frobenius Problem and Its Generalizations
June 20, 2013 The classical but oddly little-known Frobenius problem from number theory is the following: given a set of positive integers with greatest common divisor equal to 1, find the largest integer not representable as a non-negative integer linear combination of the set elements. This largest integer is called…
