The sieve of Eratosthenes (SoE) is a well-known method of extracting the set of prime numbers
from the set positive
integers
. Applying
the SoE again to the index of the prime numbers will result in the set of prime-indexed primes
. More generally, the
application of the SoE
-times
will yield the set
of
-th
order primes. In this paper, we give an upper bound for the
-th
-order
prime as well as some results relating to number-theoretic functions over
.
PDF Access Denied
We have not been able to recognize your IP address
18.97.9.171
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.