相关论文: Primes in Tuples II

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…

Given good knowledge on the even moments, we derive asymptotic formulas for $\lambda$-th moments of primes in short intervals and prove "equivalence" result on odd moments. We also provide numerical evidence in support of these results.

Let $m$ and $n$ be positive integers with $m,n \geq 2$. The second Hardy-Littlewood conjecture states that the number of primes in the interval $(m,m+n]$ is always less than or equal to the number of primes in the interval $[2,n]$. Based on…

Legendre's conjecture states that there exists a prime between $n^2$ and $(n+1)^2$, for every positive integer $n$. Here I prove that for sufficiently large $n$, there is a prime number between $n^2$ and $(n+1)^2$. The proof relies on the…

In this paper we show that for every positive integer $n$ there exists a prime number in the interval $[n,9(n+3)/8]$. Based on this result, we prove that if $a$ is an integer greater than 1, then for every integer $n>14.4a$ there are at…

Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…

Is it true that for all $n\geq k\geq 2$ there exists a prime number between $kn$ and $(k+1)n$? In this paper we show that there is always a prime number between $4n$ and $5n$ for all $n>2$. We also show there are at least seven prime…

The article presents a generalization of the classical Hardy-Littlewood conjecture concerning the density of prime tuples to the case of tuples consisting of almost-prime numbers (numbers with a specified quantity of prime divisors). The…

Let $\lfloor t\rfloor$ denote the integer part of $t\in\mathbb{R}$ and $\|x\|$ the distance from $x$ to the nearest integer. Suppose that $1/2<\gamma_2<\gamma_1<1$ are two fixed constants. In this paper, it is proved that, whenever $\alpha$…

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.…

Assuming Dickson's conjecture, we obtain multidimensional analogues of recent results on the behavior of certain multiplicative arithmetic functions near twin-prime arguments. This is inspired by analogous unconditional theorems of Schinzel…

We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…

Every natural number greater than $2$ can be written as the sum of a prime and a square-free number, and recent work has imposed additional divisibility conditions on the square-free number. We overcome limitations in these works to prove…

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 show that there exists pairs of consecutive primes less than $x$ whose difference is larger than $t(1+o(1))(\log{x})(\log\log{x})(\log\log\log\log{x})(\log\log\log{x})^{-2}$ for any fixed $t$. Our proof works by incorporating recent…

Let $k$ be an integer which is the difference between prime numbers infinitely often. It is known that there are infinitely many such $k$ and, in this paper, we give a new unconditional proof that these $k$ have positive density and improve…

Consider the set of all natural numbers that are co-prime to primes less than or equal to a given prime. Then given a consecutive pair of numbers in that set with an arbitrary even gap, we prove there exists an unbounded number of actual…

We create a simple test for distinguishing between sets of primes and random numbers using just the sum-of-digits function. We find that the sum-of-the-digits of prime numbers does not have an equal probability of being odd or even. The…

In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…

Let $(X,B_X,\mu,T)$ be a measure-preserving probability system with $T$ is invertible. Suppose that $A\in B_X$ with $\mu(A)>0$ and $\epsilon>0$. For any $m\geq 1$, there exist infinitely many primes $p_0,p_1,\ldots,p_m$ with…