In many treatments of Vinogradov's three prime theorem, one considers the summation $S(\alpha) = \sum_{k \leq N}\Lambda(k)e^{2\pi i\alpha k}$ in place of $T(\alpha) = \sum_{p \leq N}e^{2\pi i\alpha p}$ (where this sum runs over primes). I assume these two expressions are roughly the same, but I can't seem to be able to estimate $|S(\alpha) - T(\alpha)|$. Can anyone give an estimate?
2026-04-29 15:17:02.1777475822
Von Mangoldt function estimate
416 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ANALYTIC-NUMBER-THEORY
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- Is there a trigonometric identity that implies the Riemann Hypothesis?
- question regarding nth prime related to Bertrands postulate.
- Alternating sequence of ascending power of 2
- Reference for proof of Landau's prime ideal theorem (English)
- Does converge $\sum_{n=2}^\infty\frac{1}{\varphi(p_n-2)-1+p_n}$, where $\varphi(n)$ is the Euler's totient function and $p_n$ the $n$th prime number?
- On the behaviour of $\frac{1}{N}\sum_{k=1}^N\frac{\pi(\varphi(k)+N)}{\varphi(\pi(k)+N)}$ as $N\to\infty$
- Analytic function to find k-almost primes from prime factorization
- Easy way to prove that the number of primes up to $n$ is $\Omega(n^{\epsilon})$
- Eisenstein Series, discriminant and cusp forms
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The reason we consider $\Lambda(n)$ rather that just the sum over primes is because this new sum is slightly nicer to work with. The idea here is that we may freely weight by a smooth function without affecting the end result significantly.
We should expect that $|S(\alpha,N)-\log N T(\alpha,N)|$ to be small, and one can try to manipulate it with partial summation. However that misses the point, and is in some sense the wrong "time" to compare the two sums.
In Vinogradov's theorem, we are looking at the primes which satisfy $k_1+k_2+k_3=N$, and we look at the slightly weighted version $$\sum_{k_1+k_2+k_3=N}\Lambda(k_1)\Lambda(k_2)\Lambda(k_3).$$ Let $\chi_{\mathcal{P}}$ be the characteristic function for the primes. Then lets it is not hard to see how the above relates to $$\sum_{k_1+k_2+k_3=N}\chi_{\mathcal{P}}(k_1)\chi_{\mathcal{P}}(k_2)\chi_{\mathcal{P}}(k_3),$$ at least in terms of the order of magnitude. This connection is easier to prove things about, rather than comparing the exponential sums.