On a theorem of Erdős and Loxton
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908301494583296 |
|---|---|
| author | Lebowitz-Lockard, Noah |
| author_facet | Lebowitz-Lockard, Noah |
| contents | Let $a(n)$ be the number of partitions of $n$ of the form $a_1 + a_2 + \cdots + a_k$ where $a_{i + 1}$ is a proper divisor of $a_i$ for all $i < k$. Erd{\H o}s and Loxton showed that the sum of $a(n)$ over all $n \leq x$ is asymptotic to a constant multiple of $x^ρ$ where $s = ρ\approx 1.73$ is the unique solution to the equation $ζ(s) = 2$ satisfying $s > 1$. In this note, we provide tight bounds on the value of this constant, though we do not find an exact formula for it. In addition, we write an explicit upper bound for $a(n)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_03446 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On a theorem of Erdős and Loxton Lebowitz-Lockard, Noah Number Theory Let $a(n)$ be the number of partitions of $n$ of the form $a_1 + a_2 + \cdots + a_k$ where $a_{i + 1}$ is a proper divisor of $a_i$ for all $i < k$. Erd{\H o}s and Loxton showed that the sum of $a(n)$ over all $n \leq x$ is asymptotic to a constant multiple of $x^ρ$ where $s = ρ\approx 1.73$ is the unique solution to the equation $ζ(s) = 2$ satisfying $s > 1$. In this note, we provide tight bounds on the value of this constant, though we do not find an exact formula for it. In addition, we write an explicit upper bound for $a(n)$. |
| title | On a theorem of Erdős and Loxton |
| topic | Number Theory |
| url | https://arxiv.org/abs/2504.03446 |