Annals of Combinatorics Discrete Mathematics and Combinatorics
On the Digits of Partition Functions
Abstract
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.