Related papers: Properties of Higher-Order Prime Number Sequences
In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…
The prime numbers have been a source of fascination for millenia and continue to surprise us. Motivated by the hyperuniformity concept, which has attracted recent attention in physics and materials science, we show that the prime numbers in…
For the sequence defined by \[ a(n) = \frac{n^2 - n - 1}{\gcd\big(n^2 - n - 1,\, b(n-3) + n\,b(n-4)\big)} \] Where $b(n) = (n+2)\big(b(n-1) - b(n-2)\big),$ with initial conditions $b(-1) = 0$ and $b(0) = 1$, we find that $a(n)$ contains…
Prime number multiplet classifications and patterns are extended to negative integers. The extension from prime numbers to single prime powers is also studied. Prime number septets at equal distance are given. It is also shown that each…
In this paper, we introduce a certain method to construct polynomials producing many absolute pseudoprimes. By this method, we give new polynomials producing absolute pseudoprimes with any fixed number of prime factors which can be viewed…
We describe recurring patterns of numbers that survive each wave of the Sieve of Eratosthenes, including symmetries, uniform subdivisions, and quantifiable, predictive cycles that characterize their distribution across the number line. We…
In this article, we derive a congruence property of particular sum rules involving prime numbers. The resulting expression involves Bernoulli numbers and polynomials, for which we obtain, as a consequence, a general congruence relation as…
On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.
In this paper we study the Fibonacci numbers and derive some interesting properties and recurrence relations. We prove some charecterizations for $F_p$, where $p$ is a prime of a certain type. We also define period of a Fibonacci sequence…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
In the present work the existence of some patterns of primes is shown which generalize the celebrated result of Green and Tao according to which there are arbitrarily long arithmetic progressions in the sequence of primes
For positive integers $q$, Dirichlet's theorem states that there are infinitely many primes in each reduced residue class modulo $q$. A stronger form of the theorem states that the primes are equidistributed among the $\varphi(q)$ reduced…
We investigate strong divisibility sequences and produce lower and upper bounds for the density of integers in the sequence which only have (somewhat) large prime factors. We focus on the special cases of Fibonacci numbers and elliptic…
We improve a result of Bennett concerning certain sequences involving sums of powers of positive integers.
We describe a straightforward method to generate a random prime q such that the multiplicative group GF(q)* also has a random large prime-order subgroup. The described algorithm also yields this order p as well as a p'th primitive root of…
We construct an analogue of the ring of algebraic numbers, living in a quotient of the product of all finite fields of prime order. We use this ring to deduce some results about linear recurrent sequences.
Characterizations of finite sequences $\beta_{1}<\cdots<\beta_{n}$ representing expected values of order statistics from a random sample of size $n$ are given. As a by-product, a characterization of binomial mixtures, when the mixing random…
The difference between two consecutive prime numbers is called the distance between the primes. We study the statistical properties of the distances and their increments (the difference between two consecutive distances) for a sequence…
Comparative prime number theory is the study of the {\em{discrepancies}} of distributions when we compare the number of primes in different residue classes. This work presents a list of the problems being investigated in comparative prime…
We present a constant and a recursive relation to define a sequence $f_n$ such that the floor of $f_n$ is the $n$th prime. Therefore, this constant generates the complete sequence of primes. We also show this constant is irrational and…