中文
相关论文

相关论文: There are infinitely many cousin primes

200 篇论文

We show that for every positive integer $k$, there exist $k$ consecutive primes having the property that if any digit of any one of the primes, including any of the infinitely many leading zero digits, is changed, then that prime becomes…

数论 · 数学 2021-01-25 Michael Filaseta , Jacob Juillerat

Let $k$ be an integer which is the difference between prime numbers infinitely often. It is known that there are infinitely many such $k$ and, in this paper, we give a new unconditional proof that these $k$ have positive density and improve…

数论 · 数学 2015-01-28 Stijn S. C. Hanson

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…

综合数学 · 数学 2023-07-31 Mbakiso Fix Mothebe

We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…

数论 · 数学 2013-03-01 Terence Tao , Tamar Ziegler

In this short paper we will show, via elementary arguments, the equivalence of the Twin Prime Conjecture to a problem which might be simpler to prove. Some conclusions are drawn, and it is shown that proving the Twin Prime Conjecture is…

综合数学 · 数学 2011-07-01 F. Balestrieri

An infinite family of nonschurian separable association schemes is constructed.

组合数学 · 数学 2021-05-26 Grigory Ryabov

The clasp number $c(K)$ of a knot $K$ is the minimum number of clasp singularities among all clasp disks bounded by $K$. It is known that the genus $g(K)$ and the unknotting number $u(K)$ are lower bounds of the clasp number, that is,…

几何拓扑 · 数学 2014-10-16 Teruhisa Kadokami , Kengo Kawamura

A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof for the…

综合数学 · 数学 2017-10-24 N. A. Carella

Infinite exponential sequences of distinct prime numbers of the form $\lfloor a c^{n^d}+b\rfloor$, $n\geq 0$, are proved to exist for well chosen real constants $a>0$, $b$, $c>1$, $d>1$, assuming Cramer's conjecture on prime gaps. There is…

数论 · 数学 2020-12-08 Bernard Montaron

A pair of odd primes is said to be symmetric if each prime is congruent to one modulo their difference. A theorem from 1996 by Fletcher, Lindgren, and the third author provides an upper bound on the number of primes up to x that belong to a…

数论 · 数学 2019-08-27 William Banks , Paul Pollack , Carl Pomerance

While the twin prime conjecture is still famously open, it holds true in the setting of finite fields: There are infinitely many pairs of monic irreducible polynomials over $\mathbb{F}_q$ that differ by a fixed constant, for each $q \geq…

数论 · 数学 2024-12-17 Claire Burrin , Matthew Issac

In 1737 Leonard Euler gave what we often now think of as a new proof, based on infinite series, of Euclid's theorem that there are infinitely many prime numbers. Our short paper uses a simple modification of Euler's argument to obtain new…

数论 · 数学 2007-05-23 Charles W. Neville

We show that there are infinitely many pairs of alternating pretzel knots whose Jones polynomials are identical.

几何拓扑 · 数学 2011-12-14 Masao Hara , Makoto Yamamoto

We prove that there exist infinitely many elliptic curves over $\mathbb{Q}(i)$ with $j$-invariant $1728$ and rank exactly $2$ which are not obtained by base change from $\mathbb{Q}$. The rank of each such curve is determined via 2-isogeny…

数论 · 数学 2025-08-22 Ben Savoie

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 $0.989<\gamma<1$, there exist infinitely many primes $p$ such that…

数论 · 数学 2024-06-13 Fei Xue , Jinjiang Li , Min Zhang

We recast Euclid's proof of the infinitude of prime numbers as a Euclidean Criterion for a domain to have infinitely many atoms. We make connections with Furstenberg's "topological" proof of the infinitude of prime numbers and show that our…

交换代数 · 数学 2016-05-05 Pete L. Clark

Suppose that $n$ is $0$ or $4$ modulo $6$. We show that there are infinitely many primes of the form $p^2 + nq^2$ with both $p$ and $q$ prime, and obtain an asymptotic for their number. In particular, when $n = 4$ we verify the `Gaussian…

数论 · 数学 2024-10-15 Ben Green , Mehtaab Sawhney

In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…

数论 · 数学 2024-01-04 Yuhui Liu

We show that there are four infinite prime graphs such that every infinite prime graph with no infinite clique embeds one of these graphs. We derive a similar result for infinite prime posets with no infinite chain or no infinite antichain.

组合数学 · 数学 2008-12-09 Maurice Pouzet , Imed Zaguia

Zhang has shown there are infinitely many intervals of bounded length containing two primes. It appears that the current techniques cannot prove that there are infinitely many intervals of bounded length containing three primes, even if…

数论 · 数学 2013-06-06 James Maynard