Answers are grounded in this paper and cite their sources.
It is known that the partition function obeys Benford’s law in any integer base b ≥ 2 b≥ 2 . We give an upper bound for the smallest positive integer n n such that the partition function of n n starts with a prescribed string f f of digits in base b b .
No takes yet. Share an insight, caveat, or question.
Florian Luca (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: