On the Digits of Partition Functions
arXiv:2602.07726 · doi:10.1007/s00026-026-00827-9
Abstract
We study a problem of Douglass and Ono concerning the smallest integer such that the partition function begins with a specified string of digits in base . By employing an elementary discrepancy framework, we establish new upper bounds that significantly improve upon previous results of Luca.
5 pages