On sign-changes in the remainder-term of the prime-number formula, III
2000 Mathematics Subject Classification: Primary: 42A05. Secondary: 42A82, 11N05.The prime number theorem with error term presents itself as &pi'(x) = ∫2x [dt/ logt] + O ( x e- K logL x). In 1909, Edmund Landau provided a systematic analysis of the proof seeking better values of L and K. At a key point of his 1899 proof de la Vallée Poussin made use of the nonnegative trigonometric polynomial 2/3 (1+cos x)2 = 1+4/3 cosx +1/3 cos2x. Landau considered more general positive definite nonnegative...
The Brun-Titchmarsh theorem shows that the number of primes which are less than x and congruent to a modulo q is less than (C+o(1))x/(ϕ(q)logx) for some value C depending on logx/logq. Different authors have provided different estimates for C in different ranges for logx/logq, all of which give C>2 when logx/logq is bounded. We show that one can take C=2 provided that logx/logq ≥ 8 and q is sufficiently large. Moreover, we also produce a lower bound of size when logx/logq ≥ 8 and is bounded....