2019/09/26 by Błażej Żmija, Żmija, Błażej
Mathematics · #Advanced Mathematical Identities #Analytic Number Theory Research #FOS: Mathematics #Mathematics and Applications #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.1909.12139
openalex publication_date 2019/09/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let n,k∈ℕ and let pn denote the nth prime number. We define pn(k) recursively as pn(1):=pn and pn(k)=p_pn(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óth 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∞.