On the Digits of Partition Functions
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.