Annals of Combinatorics Discrete Mathematics and Combinatorics

On the Digits of Partition Functions

Siddharth Iyer
Springer Nature · 2026-05-05 · DOI 10.1007/s00026-026-00827-9

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.

Read at publisher →