Related papers: Existence of primes between two consecutive square…
The Erd\H{o}s-Mollin-Walsh conjecture, asserting the nonexistence of three consecutive powerful integers, remains a celebrated open problem in number theory. A natural line of inquiry, following recent work by Chan (2025), is to investigate…
The paper substantiates the conjecture of the asymptotic behavior of the largest distance between consecutive primes: $sup_{p_i \leq x}(p_{i+1}-p_i) \sim 2e^{-\gamma} \log^2(x)$, where $\gamma$ is the Euler constant. The Hardy-Littlewood…
The twin prime conjecture asserts that there are infinitely many pairs of primes that differ by two. While recent advances have improved our understanding of bounded prime gaps, the conjecture remains unresolved. This paper refines the…
We measure whether there are numerous pairs of twin primes (hereafter referred to as twin prime pairs) according to the prime number inferred by sieve of Eratosthenes. In this study, we reveal at least three additional twin prime pairs…
In this paper, we show a new upper bound of prime gaps, that is the gap between a prime number and its consecutive prime number. We show that the gap between a prime number $p_n$ and its consecutive prime number is not larger than…
We propose the formula for the number of pairs of consecutive primes $p_n, p_{n+1}<x$ separated by gap $d=p_{n+1}-p_n$ expressed directly by the number of all primes $<x$, i.e. by $\pi(x)$. As the application of this formula we formulate 7…
We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…
A conjecture of Cai-Zhang-Shen for figurate primes says that every integer $k>1$ is the sum of two figurate primes. In this paper we give an equivalent proposition to the conjecture. By considering extreme value problems with constraints…
Scientific paper is devoted to establish connection of T-matrix - matrix of composite numbers 6h+1 v 6h-1 in special view - with Legendre's conjecture.
The most common difference that occurs among the consecutive primes less than or equal to $x$ is called a jumping champion. Occasionally there are ties. Therefore there can be more than one jumping champion for a given $x$. In 1999 A.…
In this paper, using the well known fact that the series of reciprocals of primes diverges, we obtain a general inequality for gaps of consecutive primes that holds for infinitely many primes. As it is shown the key ingredient for this…
Prime numbers are fascinating by the way they appear in the set of natural numbers. Despite several results enlighting us about their repartition, the set of prime numbers is often informally qualified as misterious. In the present paper,…
Dickson conjectured that a set of polynomials will take on infinitely many simultaneous prime values. Later others, such as Hardy and Littlewood, gave estimates for the number of these primes. In this article we look at this conjecture,…
This paper is devoted to the theory of prime numbers. In this paper we first introduce the notion of a matrix of prime numbers. Then, in order to investigate the density of prime numbers in separate rows of the matrix under consideration,…
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…
We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.
In this paper it was shown that all prime numbers lie on 96 half-lines. At the same time, it was shown that if a given number does not lie on any of the above half-lines, then it is a composite number. A corresponding linear mathematical…
Using evaluations of the difference between consecutive primes we develop another way of estimating of the number of primes in the interval $(n, 2n)$. We also discuss the ultra Cramer conjecture, $p_{n+1} - p_n = O(log^{1+\epsilon}p_n)$…
We give a new proof that there are infinitely many primes, relying on van der Waerden's theorem for coloring the integers, and Fermat's theorem that there cannot be four squares in an arithmetic progression. We go on to discuss where else…
Statistical distribution of the primes in an arithmetic progression is considered. The estimation of prime numbers is given and combinatorial methods are used to calculate the twin primes on the available interval. The distribution and…