Any classical sifting problem equipped with a Bombieri-Vinogradov error term can be made fully effective by adjusting the sieve bounds to avoid Siegel-zero complications, preserving the original asymptotic form.
On the representation of a number as the sum of two squares and a prime
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An effective Bombieri-Vinogradov error term for sifting problems
Any classical sifting problem equipped with a Bombieri-Vinogradov error term can be made fully effective by adjusting the sieve bounds to avoid Siegel-zero complications, preserving the original asymptotic form.