Asymptotic study on the partition function p(n) began with the work of Hardy and Ramanujan. Later Rademacher obtained a convergent series for p(n) and an error bound was given by Lehmer. Despite having this, a full asymptotic expansion for p(n) with an explicit error bound is not known. Recently O'Sullivan studied the asymptotic expansion of p k (n)-partitions into kth powers, initiated by Wright, and consequently obtained an asymptotic expansion for p(n) along with a concise description of the coefficients involved in the expansion but without any estimation of the error term. Here we consider a detailed and comprehensive analysis on an estimation of the error term obtained by truncating the asymptotic expansion for p(n) at any positive integer n. This gives rise to an infinite family of inequalities for p(n) which finally answers to a question proposed by Chen. Our error term estimation predominantly relies on applications of algorithmic methods from symbolic summation.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.