Arithmetic Upper and Lower Bounds for the Denumerant Function
From MaRDI portal
Abstract: We use an old elementary arithmetic argument to find new upper and lower bounds for Sylvester's denumerant function. These bounds are tight enough to get the asymptotic behavior of the denumerant.
This page was built for publication: Arithmetic Upper and Lower Bounds for the Denumerant Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6397736)
