相关论文: Vinogradov's three primes theorem with almost twin…

Let $M_n$ and $T_n$ denote the $n$th Motzkin number and the $n$th central trinomial coefficient respectively. We prove that for any prime $p\ge 5$, \begin{align*} &\sum_{k=0}^{p-1}M_k^2\equiv…

We show that every $N \geq 2$ can be written as the sum of positive integers $a$ and $b$ where $\Omega(ab) \leq 40$. The result is obtained through the direct application of an explicit lower bound Selberg sieve along with some computation…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that, for $12\leqslant b\leqslant 35$ and for every sufficiently large odd integer $N$, the equation…

We prove that assuming the Generalized Riemann Hypothesis every even integer larger than $\exp(\exp(15.85))$ can be written as the sum of a prime number and a number that has at most two prime factors.

A number $n$ is practical if every integer in $[1,n]$ can be expressed as a subset sum of the positive divisors of $n$. We consider the distribution of practical numbers that are also shifted primes, improving a theorem of Guo and…

Let $E_k$ be the set of positive integers having exactly $k$ prime factors. We show that almost all intervals $[x,x+\log^{1+\varepsilon} x]$ contain $E_3$ numbers, and almost all intervals $[x,x+\log^{3.51} x]$ contain $E_2$ numbers. By…

A classical theorem in number theory due to Euler states that a positive integer $z$ can be written as the sum of two squares if and only if all prime factors $q$ of $z$, with $q\equiv 3 \pmod{4}$, have even exponent in the prime…

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…

Let $m>2$ and $q>0$ be integers with $m$ even or $q$ odd. We show the supercongruence $$\sum_{k=0}^{p-1}(-1)^{km}\binom{p/m-q}{k}^m\equiv0\pmod{p^3}.$$ for any prime $p>mq$. This confirms a conjecture of Sun.

It is proven that, in any given base, there are infinitely many palindromic numbers having at most six prime divisors, each relatively large. The work involves equidistribution estimates for the palindromes in residue classes to large…

We show that for any $P= 6^{m+1}.N -1 $ is a prime number for any $1 < N \le 13$ , $N \ne 8$ and $N \ne i^{m+1}Mod(6i+1) $ where $ i \in Z^+ $ and $ m \in $ $odd$ $Z^+ $ for $1 < N \le 13$ and $N \ne 8$ and also we further discussed that…

A new and exciting breakthrough due to Maynard establishes that there exist infinitely many pairs of distinct primes $p_1,p_2$ with $|p_1-p_2|\leq 600$ as a consequence of the Bombieri-Vinogradov Theorem. In this paper, we apply his general…

For n=1,2,3,... let p_n be the n-th prime. We mainly show that p_n>n+sum_{k=1}^n p_k/k for all n>124, and sum_{k=1}^n kp_k<n^2p_n/3 for all n>30.

We take the pre-sieved set to be all natural numbers $N=\{1,2,3,\dots\}$ with a sieve system:single sieve,double sieve,.... With single sieve, i.e. , remove out the multiple of a prime, we derive all the primes. With double sieve, i.e. ,…

We introduce the concept of an almost prime number generalizing a prime number. It turns out that a composite almost prime number must be a Carmichael number, in case it exists. We prove several properties of almost prime numbers and…

We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…

The abc conjecture, one of the most famous open problems in number theory, claims that three positive integers satisfying a+b=c cannot simultaneously have significant repetition among their prime factors; in particular, the product of the…

Let $N(x,y)$ denote the number of integers $n\le x$ which are divisible by a shifted prime $p-1$ with $p>y$, $p$ prime. Improving upon recent bounds of McNew, Pollack and Pomerance, we establish the exact order of growth of $N(x,y)$ for all…

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…

Let ${{\overline{p}}_{3}}(n)$ be the number of overpartition triples of $n$. By elementary series manipulations, we establish some congruences for ${\overline{p}}_{3}(n)$ modulo small powers of 2, such as…