论文部分内容阅读
The k-dimensional Piatetski-Shapiro prime number problem for k≥3 is studied. Let π(x; c<sub>1</sub>,…,c<sub>k</sub>)denote the number of primes p with p≤x, p=[n<sub>1</sub><sup>c<sub>1</sub></sup>