A note on primes with prime indices

Abstract

Let n,k∈N and let pn denote the nth prime number. We define pn(k) recursively as pn(1):=pn and pn(k)=ppn(k-1), that is, pn(k) is the pn(k-1)th prime. In this note we give answers to some questions and prove a conjecture posed by Miska and T\'oth in their recent paper concerning subsequences of the sequence of prime numbers. In particular, we establish explicit upper and lower bounds for pn(k). We also study the behaviour of the counting functions of the sequences (pn(k))k=1∞ and (pk(k))k=1∞.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…