Related papers: A Prime-Representing Constant
We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…
In this research paper, relationship between every Mersenne prime and certain Natural numbers is explored. We begin by proving that every Mersenne prime is of the form {4n + 3,for some integer 'n'} and generalize the result to all powers of…
This paper presents a distinctive prime detection approach. This method use GM-(n+1) sequences to effectively eliminate complex numbers. The sequences, which consist of odd a number of (n+1), exclude all components except for the initial…
We present a natural, combinatorial problem whose solution is given by the meta-Fibonacci recurrence relation $a(n) = \sum_{i=1}^p a(n-i+1 - a(n-i))$, where $p$ is prime. This combinatorial problem is less general than those given in [3]…
If b^2 + 1 is prime then b must be even, hence we examine the form 4u^2 + 1. Rather than study primes of this form we study composites where the main theorem of this paper establishes that if 4u^2 + 1 is composite, then u belongs to a set…
We establish mean convergence for multiple ergodic averages with iterates given by distinct fractional powers of primes and related multiple recurrence results. A consequence of our main result is that every set of integers with positive…
In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…
There are two basic number sequences which play a major role in the prime number distribution. The first Number Sequence SQ1 contains all prime numbers of the form 6n+5 and the second Number Sequence SQ2 contains all prime numbers of the…
We study the rational dynamics of the map $\mathcal{T}(x)=\lfloor x\rfloor(1+\{x\})$, which appears in the recursive construction of the prime-representing constant of Fridman, Garbulsky, Glecer, Grime and Florentin. For a rational number…
We prove that for all $n$, simultaneously, we can choose prime filtrations of $R/I^n$ such that the set of primes appearing in these filtrations is finite.
The sequence $$ \mathbb{P}^{(c)}=(\lfloor p^c \rfloor)_{p\in \mathbb{P}}\quad (c>0,c\notin \mathbb{N}), $$ is an important subsequence of the well-known Piatetski-Shapiro sequence, where $\mathbb{P}$ is the set of prime numbers and $\lfloor…
The goal of this paper is to derive a simple recursion that generates a sequence of fractions approximating $\sqrt[n]{k}$ with increasing accuracy. The recursion is defined in terms of a series of first-order non-linear difference equations…
We define A_n=\sum_{i=1}^n (-1)^i\frac{1}{i} and we show that, for every prime p, there exists a number n such that A_n\equiv 0 (mod p).
We consider real sequences $(f_n)$ that satisfy a linear recurrence with constant coefficients. We show that the density of the positivity set of such a sequence always exists. In the special case where the sequence has no positive…
The pentagonal number theorem is extended to the sequence of the number of integer partitions with all parts equal. The new pentagonal number theorem implies that the distribution of the primes is just a specific detail of the application…
The undecidability of the additive theory of primes (with identity) as well as the theory Th(N,+, n -> p\_n), where p\_n denotes the (n+1)-th prime, are open questions. As a possible approach, we extend the latter theory by adding some…
Given a prime $p$, we consider the dynamical system generated by repeated exponentiations modulo $p$, that is, by the map $u \mapsto f_g(u)$, where $f_g(u) \equiv g^u \pmod p$ and $0 \le f_g(u) \le p-1$. This map is in particular used in a…
We introduce a rigorous arithmetic--spectral construction associating planar geometric objects with additive prime factor statistics. Let $\mathrm{sopfr}(n)$ denote the sum of prime factors of $n$, counted with multiplicity, and define the…
Let $[\, \cdot\,]$ be the floor function. In this paper we show that every sufficiently large positive integer $N$ can be represented in the form \begin{equation*} N=[p_1\log p_1]+[p_2\log p_2]+[p_3\log p_3], \end{equation*} where $p_1,\,…
The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the…