1 citations · 1 across the 12 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DM2010
A Polynomial Diophantine Generator Function for Integer Residuals
Charles Sauerbier
Two Diophantine equation generator function for integer residuals produced by integer division over closed intervals are presented. One each for the closed intervals [1,Floor(n^0.5…
cs.DS2010
Computing a Frobenius Coin Problem decision problem in O(n^2)
Charles Sauerbier
Expanding on recent results of another an algorithm is presented that provides solution to the Frobenius Coin Problem in worst case O(n^2) in the magnitude of the largest denominat…