arXiv · 2308.03050
An inductive proof of the Frobenius coin problem of two denominations
Abstract
Let $a,b$ be positive, relatively prime, integers. We prove, using induction, that for every $d > ab-a-b$ there exist $x,y\in\mathbb{Z}_{\geq 0}$, such that $d=ax+by$. As a byproduct, we obtain a constructive recursive algorithm for identifying appropriate $x,y$ as above.
Explore related subjects
Keep this discovery
Giorgos Kapetanakis, Ioannis Rizos. 2023-08-06. An inductive proof of the Frobenius coin problem of two denominations. https://arxiv.org/abs/2308.03050
Cite the original work for its findings. Save a collection to share your selection of sources.