Related papers: A note on the Cram\'er-Granville model

Using the Rowland idea, we find two infinite sets of generators of primes. We also pose some conjectures concerning twin primes.

We prove that there is a small but fixed positive integer e such that for every prime larger than a fixed integer, every subset S of the integers modulo p which satisfies |2S|<(2+e)|S| and 2(|2S|)-2|S|+2 < p is contained in an arithmetic…

Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of some specific prime numbers, which depends on…

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…

In this paper, we classify all $2$-blocks for which the defect groups are abelian and the inertial quotient has prime order. As a consequence, we prove that Brou\'e's abelian defect group conjecture holds for all blocks under consideration…

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 $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

For an irrational $\alpha\in \mathbb{R}$, we consider additive problems with the set of primes satisfying $\lVert\alpha p\rVert\leq \frac{1}{p^\tau}$ for some fixed $\tau>0$. In particular, we show that there exist infinitely many…

We give a version of Ax-Katz's $p$-adic congruences and Moreno-Moreno's $p$-weight refinement that holds over any finite commutative ring of prime characteristic. We deduce this from a purely group-theoretic result that gives a lower bound…

In this paper, we prove a congruence which confirms a conjecture of Adamchuk. For any prime $p\equiv1\pmod3$ and $a\in\mathbb{Z}^{+}$, we have \begin{align*} \sum_{k=1}^{\frac{2}3(p^a-1)}\binom{2k}k\equiv0\pmod{p^2}. \end{align*}

This paper deals with order identification for nested models in the i.i.d. framework. We study the asymptotic efficiency of two generalized likelihood ratio tests of the order. They are based on two estimators which are proved to be…

We approach a new proof of the strong Goldbach's conjecture for sufficiently large even integers by applying the Dirichlet's series. Using the Perron formula and the Residue Theorem in complex variable integration, one could show that any…

In this note we use recent developments in sieve theory to highlight the interplay between Goldbach and de Polignac numbers. Assuming that the primes have level of distribution greater than $1/2$, we show that at least one of two nice…

We prove that the error in the prime number theorem can be quantitatively improved beyond the Riemann Hypothesis bound by using versions of Montgomery's conjecture for the pair correlation of zeros of the Riemann zeta-function which are…

We provide an axiomatic system modeling conditional preference orders which is based on conditional set theory. Conditional numerical representations are introduced, and a conditional version of the theorems of Debreu on the existence of…

Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…

According to the similarity theorem on the distributions of the effective prime factors and by using two-part method, Goldbach theorem and, consequently, Goldbach conjecture was proved.

Let $A$ be a subset of $G$, where $G$ is a finite abelian group of torsion $r$. It was conjectured by Ruzsa that if $|A+A|\leq K|A|$, then $A$ is contained in a coset of $G$ of size at most $r^{CK}|A|$ for some constant $C$. The case $r=2$…

We state a general purpose algorithm for quickly finding primes in evenly divided sub-intervals. Legendre's conjecture claims that for every positive integer $n$, there exists a prime between $n^2$ and $(n+1)^2$. Oppermann's conjecture…

The Selberg sieve provides majorants for certain arithmetic sequences, such as the primes and the twin primes. We prove an L^2-L^p restriction theorem for majorants of this type. An immediate application is to the estimation of exponential…