PreprintarXiv licencearXiv
On the counting function of square-full numbers
Abstract
We study the distribution of square-full numbers under the assumptions of Riemann hypothesis and that the zeros of ζ(s) are simple. Thus the error term is improved to a considerable extent with an extra main term.
Related
- An incremental approximation to the prime-counting function via polygonal numbers
- Counting Cylinders on Z-covers of Genus 2 Square-tiled Surfaces
- Square root cancellation in the hyperbolic lattice counting problem over cocompact groups
- A counting proof for the smallest critical set in a Latin square
- Equilibrium Numbers in Non-Square Bimatrix Games
BibTeX
@misc{sankaranarayanan2026counting,
title = {{On the counting function of square-full numbers}},
author = {Ayyadurai Sankaranarayanan and P. Akhilesh},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.02327},
eprint = {2609.02327},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.02327},
}
RIS
TY - UNPB
TI - On the counting function of square-full numbers
AU - Ayyadurai Sankaranarayanan
AU - P. Akhilesh
PY - 2026
DA - 2026/09/23
PB - arXiv
DO - 10.48550/arxiv.2609.02327
UR - https://arxiv.org/abs/2609.02327
AB - We study the distribution of square-full numbers under the assumptions of Riemann hypothesis and that the zeros of ζ(s) are simple. Thus the error term is improved to a considerable extent with an extra main term.
ER -