Primes of the form \([n^ c]\) (Q5906692): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jnth.1995.1020 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1983096841 / rank | |||
Normal rank |
Latest revision as of 22:51, 19 March 2024
scientific article; zbMATH DE number 729077
Language | Label | Description | Also known as |
---|---|---|---|
English | Primes of the form \([n^ c]\) |
scientific article; zbMATH DE number 729077 |
Statements
Primes of the form \([n^ c]\) (English)
0 references
2 March 1995
0 references
The Piatetski-Shapiro prime number theorem states that \[ \pi_ c(x)= \#\{ p=[ n^ c], n\leq x\}\sim {x\over {c\log x}}, \] for \(1<c <\gamma\) for some \(\gamma>1\). The best result so far obtained is \(\gamma= {{6121} \over {5302}}\) [\textit{S. W. Graham} and \textit{G. Kolesnik}, Van der Corput's method for exponential sums (1991; Zbl 0713.11001)]. By combining sieve methods and exponential sum techniques the authors prove \[ \pi_ c (x)> {x\over {4c\log x}} \qquad \text{for} \quad 1<c\leq {20 \over 17} \quad \text{and} \quad x\geq x_ 0 (c). \]
0 references
Piatetski-Shapiro prime number theorem
0 references
exponential sums
0 references
sieve methods
0 references