“…There is a wealth of recent work concerning the computation of the delta set of a numerical monoid [5,7,10,13,15,16,18,22]. For numerical monoids with three generators, the computation of the delta set is tightly related to Euclid's extended greatest common divisor algorithm [23,24]. We now summarize the main results in [ if r = 0, 6, 9, 15, where n = 20q + r for q, r ∈ N 0 and r < 20.…”