English

A note on primes with prime indices

Number Theory 2022-01-06 v1

Abstract

Let n,kNn,k\in\mathbb{N} and let pnp_{n} denote the nnth prime number. We define pn(k)p_{n}^{(k)} recursively as pn(1):=pnp_{n}^{(1)}:=p_{n} and pn(k)=ppn(k1)p_{n}^{(k)}=p_{p_{n}^{(k-1)}}, that is, pn(k)p_{n}^{(k)} is the pn(k1)p_{n}^{(k-1)}th prime. In this note we give answers to some questions and prove a conjecture posed by Miska and T\'{o}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)p_{n}^{(k)}. We also study the behaviour of the counting functions of the sequences (pn(k))k=1(p_{n}^{(k)})_{k=1}^{\infty} and (pk(k))k=1(p_{k}^{(k)})_{k=1}^{\infty}.

Keywords

Cite

@article{arxiv.1909.12139,
  title  = {A note on primes with prime indices},
  author = {Błażej Żmija},
  journal= {arXiv preprint arXiv:1909.12139},
  year   = {2022}
}

Comments

arXiv admin note: substantial text overlap with arXiv:1908.10421