does any one know a proof for the solution to the frobenius problem for n=2? that is, that the smallest not possible number expressable as a linear combination of a and b is (a-1)(b-1)??(adsbygoogle = window.adsbygoogle || []).push({});

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Frobenius problem

Loading...

Similar Threads - Frobenius problem | Date |
---|---|

I A problem in combinatorics | Jan 17, 2018 |

B Optimisation problem | Jan 11, 2018 |

I Math papers and open problems | Dec 11, 2017 |

Variations of the Frobenius coin problem | Apr 3, 2012 |

**Physics Forums - The Fusion of Science and Community**