The author uses an explicit formula of Shevelev on the best possible exponent in the error term of an asymptotic formula of Gelfond for the number of integers in a given residue class and a given parity on the sum of its binary digits and proves unconditionally that this exponent is small for the majority of all primes. This improves on the work of Shevelev who proved, among other things, a similar result by assuming Artin's conjecture on primitive roots.
Recommendations
- Exponential Gelfond–Khovanskii formula in dimension one
- scientific article; zbMATH DE number 39943
- Gelfand numbers and widths
- A remark on Gelfand-Kirillov dimension
- On the exponent of Bogomolov multipliers
- On the Łojasiewicz exponent
- On Gelfand-Kirillov dimension and related topics
- The Feichtinger conjecture for exponentials
- Generalized Gelfand measures
- Quantitative problems on the size of \(G\)-operators
Cites work
- ESTIMATES FOR THE NUMBER OF SUMS AND PRODUCTS AND FOR EXPONENTIAL SUMS IN FIELDS OF PRIME ORDER
- Exact exponent in the remainder term of Gelfond's digit theorem in the binary case
- scientific article; zbMATH DE number 1339097 (Why is no real title available?)
- scientific article; zbMATH DE number 5176842 (Why is no real title available?)
- Multilinear exponential sums in prime fields under optimal entropy condition on the sources
- New bounds for Gauss sums derived from KTH powers, and for Heilbronn's exponential sum
- On a variant of sum-product estimates and explicit exponential sum bounds in prime fields
- Sequences, discrepancies and applications
- Sur les nombres qui ont des propriétés additives et multiplicatives données
This page was built for publication: On the size of the Gelfond exponent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963005)
