Properties of higher-order prime number sequences
Let us consider the sequence of prime numbers \(\mathbb{P}=\{p_i\}_{i\geq 1}\) and let us denote by \(P^{(1)}=\mathbb{P}\) the set of prime numbers. Then, we define \(P^{(2)}\) the set of prime numbers \(\{p_j:j\in P^{(1)}\}\). In this manner we can recursively define a family of sets \(P^{(k)}=\{p_j:j\in P^{(k-1)}\}\) for every \(k\geq 2\). Several properties of these sets are studied. For example, the following interesting result is proved: There exists a unique \(I\subset\mathbb{P}\) such that \(\mathbb{P}=I\cup \{p_j:j\in I\}\) and \(I\cap \{p_j:j\in I\}=\emptyset\).
- Diophantine properties of the sequences of prime numbers
- Arithmetic functions of higher-order primes
- Sequences constructed by a modified inclusion-exclusion principle
- The new primer on prime numbers: sums of second derivatives
- Some properties of the sequence of prime numbers
- scientific article; zbMATH DE number 1418874 (Why is no real title available?)
- Relationship between the prime-counting function and a unique prime number sequence
This page was built for publication: Properties of higher-order prime number sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2072017)
