On oscillation of the number of primes in an arithmetical progression (Q5552812)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3267428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On oscillation of the number of primes in an arithmetical progression |
scientific article; zbMATH DE number 3267428 |
Statements
1968
0 references
oscillation
0 references
number of primes in arithmetic progression
0 references
0.796071469783783
0 references
0.7944676876068115
0 references
0.7928292751312256
0 references
0.7859997749328613
0 references
On oscillation of the number of primes in an arithmetical progression (English)
0 references
The author proves some theorems of following type. Theorem 1. For every \(T>c_0\) the inequalities \[ \max_{T\le x\le T^k} \frac{\pi(x, h,3) - \tfrac12 \text{li }x}{\sqrt{x}/\log x} > \delta, \] \[ \min_{T\le x\le T^k} \frac{\pi(x, h,3) - \tfrac12 \text{li }x}{\sqrt{x}/\log x} < -\delta \] hold, where \(\delta\) and \(c_0\) are explicitly calculable numerical constants and \(k= (2+\sqrt 3)^2)\), \(\pi(x,h,3)\) is the number of primes \(\equiv 3(4)\) not exceeding \(x)\). Theorem 5. For every pair of \(\ell_1,\ell_2 =3,5,7\), \(\ell_1\ne \ell_2\) \[ \max_{T\le x\le T^k} \frac{\log x}{\sqrt x} \left(\sigma(x,8,\ell_1) - \sigma(x,8,\ell_2)\right)>\delta \] for \(T> c_0\). \(\delta,c_0,k\) as above, \(\displaystyle\sigma(x,8,\ell) = \sum_{p\equiv \ell\pmod 8} e^{-p/x}\).
0 references