title: Algorithms to compute Frobenius Numbers of a set of positive integers
body: <p>Frobenius numbers of a set exist iff the gcd of the numbers of the set is 1. Given a set of positive integers with at most 10 elements such that the gcd of all the elements is 1, how can we compute the Frobenius number of the set?</p>
  
  <p>Here is the link to the original problem: <a href="https://icpcarchive.ecs.baylor.edu/external/62/6298.pdf" rel="noreferrer">https://icpcarchive.ecs.baylor.edu/external/62/6298.pdf</a>
  Sylvester's formula can be used to find the Frobenius number of a set of 2 elements.</p>