Indexed metadata
On the Digits of Partition Functions
Siddharth Iyer
Source record
Source: Crossref
Published: May 5, 2026
DOI: 10.1007/s00026-026-00827-9
Open original source ↗Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.