WorksMathematics
Arithmetic Upper and Lower Bounds for the Denumerant Function II
Abstract
We apply the elementary arithmetic argument of the first paper of this series (arXiv:2204.13689) to binomial coefficients, and obtain upper and lower bounds for Sylvester's denumerant function for arbitrary positive integers that sharpen those of Agnarsson. The lower bound is a sum of binomial coefficients; it holds along the multiples of without assuming that a solution exists, and it is greater than the polynomial lower bound of the first paper. In the upper bound the shift of Agnarsson's binomial coefficient is reduced.