Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T17:45:17.041Z Has data issue: false hasContentIssue false

Primes of the form [pc] and related questions

Published online by Cambridge University Press:  18 May 2009

Glyn Harman
Affiliation:
School of Mathematics, UWCC, Senghennydd Road, P.O. Box 926, Cardiff CF2 4YH
Joël Rivat
Affiliation:
Bâtiment 425, Université de Paris Sud, 91405 Orsay, France, rivat@matups.matups.fr
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Much interest has been shown in determining the range of values of c for which the sequence [n]c contains infinitely many primes. The result is an elementary deduction from the prime number theorem, of course, of 0<c≤l. In 1953, Piatetski–Shapiro [9] showed that

for 1<c<12/11, where xc(X) stands for the number of primes in the set {[nc]n≤x}.

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1995