相关论文: A random analogue of Gilbreath's conjecture

Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…

A calculation was performed to verify Proth-Gilbraith's conjecture for all prime numbers up to 0$^{14}$. The previous calculation was performed by Andrew Odlyzko in 1993 up to 0$^{13}$. This involves calculating the differences between…

Let $n\in\mathbb{Z}^+$. In [8] we ask the question whether any sequence of $n$ consecutive integers greater than $n^2$ and smaller than $(n+1)^2$ contains at least one prime number, and we show that this is actually the case for every…

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

The idea of generating prime numbers through sequence of sets of co-primes was the starting point of this paper that ends up by proving two conjectures, the existence of infinitely many twin primes and the Goldbach conjecture. The main idea…

Let $p_{1}$, ..., $p_{k}$ be the first $k$ odd primes in succession. Let $n$ be an even integer such that $n > p_{k}$. We conjecture that if none of $n - p_{1}$, ..., $n - p_{k}$ are prime, then at least one of them has a prime factor which…

In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…

Let $g(n)$ be the largest positive integer $k$ such that there are distinct primes $p_i$ for $1\leq i\leq k$ so that $p_i |n+i$. This function is related to a celebrated conjecture of C.A. Grimm. We establish upper and lower bounds for…

Let $p$ be a sufficiently large prime number, $r$ be any given positive integer. Suppose that $a_1,\,\dots,\,a_r$ are pairwise distinct and not zero modulo $p$. Let $N(a_1,\,\dots,\,a_r;\,p)$ denote the number of…

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…

Legendre's conjecture states that there is a prime number between n^2 and (n+1)^2 for every positive integer n. We consider the following question : for all integer n>1 and a fixed integer k<=n does there exist a prime number such that kn <…

A primorial prime is a prime number of the form $p_n\# \pm 1$ where $p_n\#$ denotes the product of all primes less than or equal to $p_{n}$, the $n$-th prime. We show that the probability along the lines of Mertens' Theorem that either…

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

We prove the Ribenboim hypothesis, which states that if, starting from some integer $N$, consecutive prime numbers $p_ {n}$, $p_{n+1}$ satisfy the inequality $\sqrt {p_ {n+1}}-\sqrt{p_{n}} <1$, then the Landau problem # 4 (1912) has a…

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

This paper proves Firoozbakht's conjecture using Rosser and Schoenfelds' inequality on the distribution of primes. This inequality is valid for all natural numbers ${n\geq 21}$. Firoozbakht's conjecture states that if $ {p_{n}}$ and…

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…

Consider the operation of adding the same number of identical digits to the left and to the right of a number n. In OEIS sequence A090287, it was conjectured that this operation will not produce a prime if and only if n is a palindrome with…

Let 0 < a < b be two relatively prime integers and let <a,b> be the numerical semigroup generated by a and b with Frobenius number g(a,b)=ab-a-b. In this note, we prove that there exists a prime number p in <a,b> with p < g(a,b) when the…

In this article we study in depth the Dirichlet theorem, which states that if a, b are relative prime integers, the sequence p = an + b contains infinite prime numbers, we simplify and generalize this theorem, we enunciate some special…