Let p = (p1,...,p(n)) be a vector of positive integers whose greatest
common divisor is unity. The Frobenius problem is to find the largest
integer f which cannot be written as a nonnegative integral combinati
on of the p(i). In this note we relate the Frobenius problem to the to
pic of maximal lattice free bodies and describe an algorithm for n = 3
.