相关论文: The prime pairs are equidistributed among the cose…
Let $t \in \mathbb{N}$, $\eta >0$. Suppose that $x$ is a sufficiently large real number and $q$ is a natural number with $q \leq x^{5/12-\eta}$, $q$ not a multiple of the conductor of the exceptional character $\chi^*$ (if it exists).…
Let $A\subset [1,x]$ be a non-empty set of primes with $|A|= \alpha x(\log x)^{-1}$. We prove that there exist absolute constants $c_1,c_2>0$ such that, as $x$ gets sufficiently large, we have $|A+A|\geq c_1(\log x)(\log \log…
Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be Chebyshev's prime-counting function for primes congruent to $a$ modulo $q$. We show that under the assumption of an…
We investigate the first moment of primes in progressions $$ \sum_{\substack{q\leq x/N \\ (q,a)=1}} \Big(\psi(x; q, a) - \frac x{\varphi(q)}\Big) $$ as $x, N \to \infty$. We show unconditionally that, when $a=1$, there is a significant bias…
The Brun-Titchmarsh theorem shows that the number of primes $\le x$ which are congruent to $a\pmod{q}$ is $\le (C+o(1))x/(\phi(q)\log{x})$ for some value $C$ depending on $\log{x}/\log{q}$. Different authors have provided different…
Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be, as usual, Chebyshev's prime-counting function for the primes of the arithmetic progression $a$ (mod $q$) with $(a,q)=1$. For…
For $(M,a)=1$, put \begin{equation*} G(X;M,a)=\sup_{p^\prime_n\leq X}(p^\prime_{n+1}-p^\prime_n), \end{equation*} where $p^\prime_n$ denotes the $n$-th prime that is congruent to $a\pmod{M}$. We show that for any positive $C$, provided $X$…
We show that the congruence lattice of a semilattice satsifies a form of distributivity relative to principal congruences of the form $ \Theta_{t \odot s, s}$. Particularly, we establish that semilattice congruences obey the ``pairwise…
For arbitrary $c_0>0$, if $A$ is a subset of the primes less than $x$ with cardinality $\delta x (\log x)^{-1}$ with $\delta\geq (\log x)^{-c_0}$, then there exists a positive constant $c$ such that the cardinality of $A+A$ is larger than…
We prove some results concerning the distribution of primes on the Riemann hypothesis. First, we prove the explicit result that there exists a prime in the interval $(x-\frac{4}{\pi} \sqrt{x} \log x,x]$ for all $x \geq 2$; this improves a…
We show that if $\frac{L}{\varphi(q)\log X}\to\infty$ as $X\to\infty$, almost all $(a, x)\in (\mathbb Z/q\mathbb Z)^\times\times [X, 2X]$ are such that there exists a product of at most two primes in $[x, x + L]$ congruent to $a\mod{q}$.
Let $\Psi$ be a system of linear forms with finite complexity. In their seminal paper, Green and Tao showed the following prime number theorem for values of the system $\Psi$: $$\sum_{x\in [-N,N]^d} \prod_{i=1}^t…
We prove that a positive proportion of the intervals of any fixed scalar multiple of $\log(X)$ in the dyadic interval $[X,2X]$ contain a prime number. We also show that a positive proportion of the congruence classes modulo $q$ contain a…
Two topics of the number theory are discussed in this paper. First, we prove that given each natural number $x\geq10^{3}$, we have \[ |{\rm Li}(x)-\pi(x)|\leq c\sqrt{x}\log x\texttt{ and } \pi(x)={\rm Li}(x)+O(\sqrt{x}\log x) \] where $c$…
By a sphere-packing argument, we show that there are infinitely many pairs of primes that are close to each other for some metrics on the integers. In particular, for any numeration basis $q$, we show that there are infinitely many pairs of…
We prove that $\mathop{\mathbb{E}}_{m \leq M} \mathop{\mathbb{E}}_{n \leq N} \Lambda(n) \Lambda\bigl(n + \lfloor m^c \rfloor\bigr) = 1 + \rm{O}(\log^{2 - Bc} N)$, where $c > 2$ is a non-integer, $B \geq 3/c$, and $M$ is of order $N^{1/c}…
This note investigates the prime values of the polynomial $f(t)=qt^2+a$ for any fixed pair of relatively prime integers $ a\geq 1$ and $ q\geq 1$ of opposite parity. For a large number $x\geq1$, an asymptotic result of the form $\sum_{n\leq…
We show that if $A\subset \{1,\ldots,N\}$ has no solutions to $a-b=n^2$ with $a,b\in A$ and $n\geq 1$ then \[|A|\ll \frac{N}{(\log N)^{c\log\log \log N}}\] for some absolute constant $c>0$. This improves upon a result of…
Let $x\geq 1$ be a large number, and let $1 \leq a <q $ be integers such that $\gcd(a,q)=1$ and $q=O(\log^c)$ with $c>0$ constant. This note proves that the counting function for the number of primes $p \in \{p=qn+a: n \geq1 \}$ with a…
We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…