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.
Siddharth Iyer (Tue,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: