A note on primes with prime indices

preprint2019arXivOpen access

Abstract

Let n,k∈Nn,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(k−1)p_{n}^{(k)}=p_{p_{n}^{(k-1)}}, that is, pn(k)p_{n}^{(k)} is the pn(k−1)p_{n}^{(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)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}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.