Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.07726 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918505004138496 |
|---|---|
| author | Iyer, Siddharth |
| author_facet | Iyer, Siddharth |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_07726 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On the Digits of Partition Functions Iyer, Siddharth Number Theory Combinatorics 11A63 (Primary) 11P82 (Secondary) 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. |
| title | On the Digits of Partition Functions |
| topic | Number Theory Combinatorics 11A63 (Primary) 11P82 (Secondary) |
| url | https://arxiv.org/abs/2602.07726 |