The Frobenius Problem (and numerical semigroups) - Numberphile

The Frobenius Problem explores numerical semigroups and Sylvester's theorem, illustrating how combinations of relatively prime integers generate all larger numbers beyond a certain point. It discusses gaps in achievable sums, the concept of the Fenus number, and connections to broader mathematical theories, emphasizing systematic approaches to understanding these semigroups.