Skip to content
DraconiticResearch
Search Sources API
181,716 studies31 sourcesUpdated 54 min ago
PreprintCC BY 4.0arXiv

Explicit bounds for Dickman's function

Abstract

Dickman's function ρ(u) denotes the natural density of integers n whose largest prime factor does not exceed n1/u. We establish numerically explicit upper and lower bounds for ρ(u), resulting in estimates with a relative error of less than 0.005/u2 for all u≥ 5. This allows for an approximate evaluation of ρ(u) without the need to solve the delay differential equation numerically.

Related

  1. Explicit height bounds on modular polynomials for the elliptic j-invariant, cube root of j, and Weber modular function f
    Abraham Zhang
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  2. Explicit upper and lower bounds on certain functions related to ζ(s) for s>1
    Stephan Ramon Garcia, Loïc Grenié, Giuseppe Molteni
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  3. Improved explicit Burgess-strength bounds for composite moduli
    James Punch
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. Explicit and logarithmically improved chromatic bounds for (P2∪ P3)-free graphs
    Lizhong Chen
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. Explicit Bounds on the Entropy of Piecewise Hölder Graphon Models
    Connor Loehde-Woolard, François G. Meyer
    arXivPreprintCC BY 4.0Full textProbabilityStatisticsarXiv
BibTeX
@misc{weingartner2026explicit,
  title = {{Explicit bounds for Dickman's function}},
  author = {Andreas Weingartner},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2606.07785},
  eprint = {2606.07785},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2606.07785},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Explicit bounds for Dickman's function
AU  - Andreas Weingartner
PY  - 2026
DA  - 2026/10/05
PB  - arXiv
DO  - 10.48550/arxiv.2606.07785
UR  - https://arxiv.org/abs/2606.07785
AB  - Dickman's function ρ(u) denotes the natural density of integers n whose largest prime factor does not exceed n^1/u. We establish numerically explicit upper and lower bounds for ρ(u), resulting in estimates with a relative error of less than 0.005/u^2 for all u≥ 5. This allows for an approximate evaluation of ρ(u) without the need to solve the delay differential equation numerically.
ER  -