arXiv · 2602.07726
On the Digits of Partition Functions
Abstract
We study a problem of Douglass and Ono concerning the smallest integer $n$ such that the partition function $p(n)$ begins with a specified string of digits $f$ in base $b$. By employing an elementary discrepancy framework, we establish new upper bounds that significantly improve upon previous results of Luca.
Explore related subjects
Keep this discovery
Siddharth Iyer. 2026-02-07. On the Digits of Partition Functions. https://doi.org/10.1007/s00026-026-00827-9
Cite the original work for its findings. Save a collection to share your selection of sources.