




















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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。