English
Related papers

Related papers: Explicit bounds for prime K-tuplets

200 papers

We prove a bound on the number of primes with a given splitting behaviour in a given field extension. This bound generalises the Brun-Titchmarsh bound on the number of primes in an arithmetic progression. The proof is set up as an…

Number Theory · Mathematics 2017-03-10 Korneel Debaene

In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.

Number Theory · Mathematics 2007-05-23 L. J. P. Kilford

Let $\chi$ be a Dirichlet character modulo a prime~$p$. We give explicit upper bounds on $q_1<q_2<\dots<q_n$, the $n$ smallest prime nonresidues of $\chi$. More precisely, given $n_0$ and $p_0$ there exists an absolute constant…

Number Theory · Mathematics 2019-08-12 Shilin Ma , Kevin J. McGown , Devon Rhodes , Mathias Wanner

For $m,q \in \mathbb{N}$, we call an $m$-tuple $(a_1,\ldots,a_m) \in \prod_{i=1}^m (\mathbb{Z}/q\mathbb{Z})^\times$ good if there are infinitely many consecutive primes $p_1,\ldots,p_m$ satisfying $p_i \equiv a_i \pmod{q}$ for all $i$. We…

Number Theory · Mathematics 2024-09-20 Cheuk Fung Lau

Every natural number greater than $2$ can be written as the sum of a prime and a square-free number, and recent work has imposed additional divisibility conditions on the square-free number. We overcome limitations in these works to prove…

Number Theory · Mathematics 2026-03-31 Ethan S. Lee , Rowan O'Clarey

We showed that the prime gap for a prime number p is less than or equal to the prime count of the prime number.

General Mathematics · Mathematics 2020-07-31 Ya-Ping Lu , Shu-Fang Deng

We prove that for all $n$, simultaneously, we can choose prime filtrations of $R/I^n$ such that the set of primes appearing in these filtrations is finite.

Commutative Algebra · Mathematics 2017-05-17 Craig Huneke , Ilya Smirnov

Let $A$ be the product of an abelian variety and a torus defined over a number field $K$. Fix some prime number $\ell$. If $\alpha \in A(K)$ is a point of infinite order, we consider the set of primes $\mathfrak p$ of $K$ such that the…

Number Theory · Mathematics 2023-06-22 Davide Lombardo , Antonella Perucca

Assuming a $q$-variant of the prime $k$-tuple conjecture uniformly, we compute mixed moments of the number of primes in disjoint short intervals and progressions, respectively. This involves estimating the mean of singular series along…

Number Theory · Mathematics 2024-11-26 Sun-Kai Leung

This paper introduces a new method to find the next prime number after a given prime ${P}$. The proposed method is used to derive a system of inequalities, that serve as constraints which should be satisfied by all primes whose successor is…

General Mathematics · Mathematics 2020-05-07 Reema Joshi

Let $\omega(n)$ denote the number of distinct prime factors of $n$. Then for any given $K\geq 2$, small $\epsilon>0$ and sufficiently large (only depending on $K$ and $\epsilon$) $x$, there exist at least $x^{1-\epsilon}$ integers…

Number Theory · Mathematics 2009-08-06 Hao Pan

The purpose of this paper is to give explicit methods for bounding the number of vertices of finite $k$-regular graphs with given second eigenvalue. Let $X$ be a finite $k$-regular graph and $\mu_1(X)$ the second largest eigenvalue of its…

Combinatorics · Mathematics 2018-10-23 Joseph Richey , Noah Shutty , Matthew Stover

We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…

Number Theory · Mathematics 2024-01-04 Cathal O'Sullivan , Jonathan P. Sorenson , Aryn Stahl

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…

Number Theory · Mathematics 2013-03-01 Terence Tao , Tamar Ziegler

We furnish an explicit bound for the prime number theorem in short intervals on the assumption of the Riemann hypothesis.

Number Theory · Mathematics 2022-04-18 Michaela Cully-Hugill , Adrian W. Dudek

For r \ge 2, let X be the number of r-armed stars K_{1,r} in the binomial random graph G_{n,p}. We study the upper tail \Pr(X \ge (1+\epsilon)\E X), and establish exponential bounds which are best possible up to constant factors in the…

Probability · Mathematics 2021-04-06 Matas Šileikis , Lutz Warnke

We develop the foundations of a general framework for producing optimal upper and lower bounds on the sum $\sum_p a_p$ over primes $p$, where $(a_n)_{x/2<n\le x}$ is an arbitrary non-negative sequence satisfying Type I and Type II…

Number Theory · Mathematics 2024-07-22 Kevin Ford , James Maynard

For any number field k, upper bounds are established for the number of k-rational points of bounded height on non-singular del Pezzo surfaces defined over k, which are equipped with suitable conic bundle structures over k.

Number Theory · Mathematics 2013-11-08 T. D. Browning , M. Swarbrick Jones

We conjecture average counting functions for prime $k$-tuples based on a gamma distribution hypothesis for prime powers. The conjecture is closely related to the Hardy-Littlewood conjecture for $k$-tuples but yields better estimates.…

Number Theory · Mathematics 2018-10-26 J. LaChapelle

Let $A/K$ be an absolutely simple abelian surface defined over a number field $K$. We give unconditional upper bounds for the number of prime ideals $\mathfrak{p}$ of $K$ with norm up to $x$ such that $A$ has supersingular reduction at…

Number Theory · Mathematics 2025-07-10 Tian Wang