中文
相关论文

相关论文: Linear Equations in Primes

200 篇论文

Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much…

数论 · 数学 2015-03-17 Benoit Cloitre

Taking $r>0$, let $\pi_{2r}(x)$ denote the number of prime pairs $(p, p+2r)$ with $p\le x$. The prime-pair conjecture of Hardy and Littlewood (1923) asserts that $\pi_{2r}(x)\sim 2C_{2r} {\rm li}_2(x)$ with an explicit constant $C_{2r}>0$.…

数论 · 数学 2015-05-13 Jaap Korevaar , Herman te Riele

The binary Goldbach conjecture asserts that every even integer greater than $4$ is the sum of two primes. In a preceding paper we have proved that there exists a positive integer $K_\alpha$ such that every even integer $x > p_k^2$ can be…

综合数学 · 数学 2023-04-25 Ricardo Barca

Let $E$ be an elliptic curve defined over the rational numbers and $r$ a fixed integer. Using a probabilistic model consistent with the Chebotarev theorem for the division fields of $E$ and the Sato-Tate distribution, Lang and Trotter…

数论 · 数学 2008-10-26 Stephan Baier , Nathan Jones

In [10] the third author of this paper presented two conjectures on the additive decomposability of the sequence of ''smooth'' (or ''friable'') numbers. Elsholtz and Harper [4] proved (by using sieve methods) the second (less demanding)…

数论 · 数学 2020-06-30 K. Győry , L. Hajdu , A. Sárközy

The Goldbach conjecture states that every even integer greater than 2 can be expressed as the sum of two prime numbers. This conjecture was first proposed by German mathematician Christian Goldbach in 1742 and, despite being obviously true,…

综合数学 · 数学 2025-08-12 Kenneth A. Watanabe

In this work we use the number classification in families of the form 6n+1, and 6n+5 with n integer (Such families contain all odd prime numbers greater than 3 and other compound numbers related with primes). We will use this kind of…

综合数学 · 数学 2007-09-04 G. Funes , D. Gulich , L. Garvaglia , M. Garvaglia

We consider a translation and dilation invariant system consisting of k diagonal equations of degrees 1,2,...,k with integer coefficients in s variables, where s is sufficiently large in terms of k. We show via the Hardy-Littlewood circle…

数论 · 数学 2010-10-11 Matthew L. Smith

For primes $q \equiv 7 \mod 16$, the present manuscript shows that elementary methods enable one to prove surprisingly strong results about the Iwasawa theory of the Gross family of elliptic curves with complex multiplication by the ring of…

数论 · 数学 2020-08-25 John Coates , Jianing Li , Yongxiong Li

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

Let $\pi(x;\gamma_1,\gamma_2)$ denote the number of primes $p$ with $p\leqslant x$ and $p=\lfloor n^{1/\gamma_1}_1\rfloor=\lfloor n^{1/\gamma_2}_2\rfloor$, where $\lfloor t\rfloor$ denotes the integer part of $t\in\mathbb{R}$ and…

数论 · 数学 2023-10-02 Xiaotian Li , Wenguang Zhai , Jinjiang Li

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

数论 · 数学 2022-02-08 Anne-Maria Ernvall-Hytönen , Neea Palojärvi

The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…

综合数学 · 数学 2026-01-12 Yasuo Nishii

In this paper characters of the normaliser of $d$-split Levi subgroups in $\mathrm {SL}_n(q)$ and $\mathrm {SU}_n(q)$ are parametrized with a particular focus on the Clifford theory between the Levi subgroup and its normalizer.These results…

表示论 · 数学 2019-01-16 Julian Brough , Britta Späth

Defining a family of recurrences, we generalize Comtet's formula for the generating function of the enumeration of indecomposable permutations. Consequently, we generalize Panaitopol's asymptotic expansion for the prime counting function,…

组合数学 · 数学 2024-12-31 Glenn Bruda

Let a and f be coprime positive integers. Let g be an integer. Under the Generalized Riemann Hypothesis (GRH) it follows by a result of H.W. Lenstra that the set of primes p such that p=a(mod f) and g is a primitive root modulo p has a…

数论 · 数学 2012-07-30 Pieter Moree

The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…

数论 · 数学 2022-08-17 Michael Drmota , Clemens Müllner , Lukas Spiegelhofer

In this paper we prove that the binary Goldbach conjecture for sufficiently large even integers would follow under the assumption that both the Elliott-Halberstam conjecture and a variant of the Elliott-Halberstam conjecture twisted by the…

数论 · 数学 2022-08-30 Jing-Jing Huang , Huixi Li

Landau-Ginzburg mirror symmetry predicts isomorphisms between graded Frobenius algebras (denoted $\mathcal{A}$ and $\mathcal{B}$) that are constructed from a nondegenerate quasihomogeneous polynomial $W$ and a related group of symmetries…

代数几何 · 数学 2018-06-29 Nathan Cordner

The main conjectures of Iwasawa theory provide the only general method known at present for studying the mysterious relationship between purely arithmetic problems and the special values of complex L-functions, typified by the conjecture of…

数论 · 数学 2010-06-29 J. Coates , T. Fukaya , K. Kato , R. Sujatha , O. Venjakob