中文
相关论文

相关论文: A proof of the strong twin prime conjecture

200 篇论文

Using evaluations of the difference between consecutive primes we develop another way of estimating of the number of primes in the interval $(n, 2n)$. We also discuss the ultra Cramer conjecture, $p_{n+1} - p_n = O(log^{1+\epsilon}p_n)$…

数论 · 数学 2015-07-28 Felix Sidokhine

Statistical distribution of the primes in an arithmetic progression is considered. The estimation of prime numbers is given and combinatorial methods are used to calculate the twin primes on the available interval. The distribution and…

综合数学 · 数学 2019-02-28 Nurlan N. Tashatov , Alua S. Turginbayeva , Serik A. Altynbek

In this paper, we confirm some congruences conjectured by V.J.W. Guo and M.J. Schlosser recently. For example, we show that for primes $p>3$, $$…

数论 · 数学 2020-06-30 Chen Wang

It is an open problem whether $ \binom{2n}{n} $ is divisible by 4 or 9 for all $n>256$. In connection with this, we prove that for a fixed uneven $m$ the asymptotic density of $k$'s such that $ m \nmid \binom{2^{k+1}}{2^{k}} $ is 0. To do…

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…

数论 · 数学 2015-11-03 Efrat Bank , Lior Bary-Soroker , Lior Rosenzweig

We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…

数论 · 数学 2017-12-04 Zhi-Wei Sun

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

数论 · 数学 2025-05-15 Daniel R. Johnston , Simon N. Thomas

For an integer $k\ge2$, a tuple of $k$ positive integers $(M_i)_{i=1}^{k}$ is called an amicable $k$-tuple if the equation \[ \sigma(M_1)=\cdots=\sigma(M_k)=M_1+\cdots+M_k \] holds. This is a generalization of amicable pairs. An amicable…

数论 · 数学 2017-11-21 Yuta Suzuki

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…

数论 · 数学 2018-04-13 Romeo Meštrović

A sieve is constructed for twin primes at distance 4, which are of the form 3(2m+1)+/-2, and are characterized by their twin-4 rank 2m+1. It has no parity problem. Non-ranks are identified as all other odd numbers and counted using odd…

数论 · 数学 2012-04-25 H. J. Weber

Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{2k}{k}/2^k=(-1)^{(p-1)/2}-p^2E_{p-3} (mod p^3),$$ $$\sum_{k=1}^{(p-1)/2}\binom{2k}{k}/k=(-1)^{(p+1)/2}8/3*pE_{p-3} (mod p^2),$$…

数论 · 数学 2015-05-18 Zhi-Wei Sun

We proved that there are infinitely many pairs of twin prime.

综合数学 · 数学 2007-05-23 Zhanle Du , Shouyu Du

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

数论 · 数学 2025-05-14 Likun Xie

In this paper, we mainly prove two congruence conjecture of Z.-W. Sun. Let $p\equiv3\pmod 4$ be a prime. Then $$\sum_{k=0}^{p-1}\frac{\binom{2k}k^2}{8^k}\equiv-\sum_{k=0}^{p-1}\frac{\binom{2k}k^2}{(-16)^k}\pmod{p^3}.$$ And for any odd prime…

数论 · 数学 2023-04-11 Guo-Shuai Mao

It is known that $\sum_{k=0}^\infty\binom{2k}{k}/((2k+1)4^k)=\pi/2$ and $\sum_{k=0}^\infty\binom{2k}{k}/((2k+1)16^k)=\pi/3$. In this paper we obtain their p-adic analogues such as…

数论 · 数学 2011-08-03 Zhi-Wei Sun

We bring to bear an empirical model of the distribution of twin primes and produce two distinct results. The first is that we can make a quantitative probabilistic prediction of the occurrence of gaps in the sequence of twins within the…

数论 · 数学 2016-09-07 P. F. Kelly , Terry Pilling

This work proposes elementary proofs of several related primes counting problems, based on an elementary weighted sieve. The subsets of primes considered here are the followings: the subset of twin primes PT = {p and p + 2 are primes}, the…

综合数学 · 数学 2012-08-29 N. A. Carella

Let $p$ be a large prime number and $g$ be any integer of multiplicative order $T$ modulo $p$. We obtain a new estimate of the double exponential sum $$ S=\sum_{n\in \mathcal{N}}\left|\sum_{m\in \mathcal{M} }e_p(an g^{m})\right|, \quad \gcd…

数论 · 数学 2018-10-16 M. Z. Garaev

Twin prime number problem is mainly the structure of the twin prime numbers and whether there are infinitely many prime twins group. In this paper, by constructing a special cluster number set(see formula(2.3)in the paper), proves that the…

综合数学 · 数学 2014-05-14 Zhang Baoshan

It is well-known that for any distinct positive integers $k$ and $n$, the numbers $2^{2^k}+1$ and $2^{2^n}+1$ are relatively prime. In this paper we consider the situation when 1 is replaced by some positive integer $d>1$

数论 · 数学 2016-01-26 Tigran Hakobyan