Primes with an average sum of digits

42Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

The main goal of this paper is to provide asymptotic expansions for the numbers #{p ≤ s: p prime,sq(p)=k} for k close to ((q-1)/2)log qx, where sq(n) denotes the q-ary sum-of-digits function. The proof is based on a thorough analysis of exponential sums of the form ∑p≤xe(αsq(p))(where the sum is restricted to p prime), for which we have to extend a recent result by the second two authors. Copyright © 2009 Foundation Compositio Mathematica.

Cite

CITATION STYLE

APA

Drmota, M., Mauduit, C., & Rivat, J. (2009). Primes with an average sum of digits. Compositio Mathematica, 145(2), 271–292. https://doi.org/10.1112/S0010437X08003898

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free