On the counting function of square-full numbers
Ayyadurai Sankaranarayanan, P. Akhilesh
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.
Create a lesson
Related papers
A new proof that more than 2/3 of the zeros of the Riemann zeta function are simple and on the critical line
Youness Lamzouri
Petersson-Rigid Lattices in a Census of 100 Rank-Three Root Bases
Eungang Cho
Adelic points and unmramified Brauer approximation for classifying stacks
Ajneet Dhillon
On divergence related to Riemann--von Mangoldt's explicit formula of the prime-counting function
Harald Grobner
On the occurrence of congruence multiplicities between Ramanujan's theta functions
Shane Chern, Nicolas Allen Smoot, Dazhao Tang
Improved Weyl bounds on short intervals
Xiyu Hu