On the Brun-Titchmarsh theorem

James Maynard

Displaying similar documents to “On the Brun-Titchmarsh theorem”

Consecutive primes in tuples

William D. Banks, Tristan Freiberg, Caroline L. Turnage-Butterbaugh (2015)

Acta Arithmetica

Similarity:

In a stunning new advance towards the Prime k-Tuple Conjecture, Maynard and Tao have shown that if k is sufficiently large in terms of m, then for an admissible k-tuple $(x) = {g x + h_{j}}_{j = 1}^{k}$ of linear forms in ℤ[x], the set $(n) = {g n + h_{j}}_{j = 1}^{k}$ contains at least m primes for infinitely many n ∈ ℕ. In this note, we deduce that $(n) = {g n + h_{j}}_{j = 1}^{k}$ contains at least m consecutive primes for infinitely many n ∈ ℕ. We answer an old question of Erdős and Turán by producing strings of m + 1 consecutive primes whose successive gaps $δ_{1}, . . ., δ_{m}$ form an increasing...

On integers of the form $p + 2^{k}$

Laurent Habsieger, Xavier-François Roblot (2006)

Acta Arithmetica

Similarity:

The binary Goldbach conjecture with primes in arithmetic progressions with large modulus

Claus Bauer, Yonghui Wang (2013)

Acta Arithmetica

Similarity:

It is proved that for almost all prime numbers $k \leq N^{1 / 4 - ϵ}$ , any fixed integer b₂, (b₂,k) = 1, and almost all integers b₁, 1 ≤ b₁ ≤ k, (b₁,k) = 1, almost all integers n satisfying n ≡ b₁ + b₂ (mod k) can be written as the sum of two primes p₁ and p₂ satisfying $p_{i} \equiv b_{i} (m o d k)$ , i = 1,2. For the proof of this result, new estimates for exponential sums over primes in arithmetic progressions are derived.

Sums of positive density subsets of the primes

Kaisa Matomäki (2013)

Acta Arithmetica

Similarity:

We show that if A and B are subsets of the primes with positive relative lower densities α and β, then the lower density of A+B in the natural numbers is at least $(1 - o (1)) α / (e^{γ} l o g l o g (1 / β))$ , which is asymptotically best possible. This improves results of Ramaré and Ruzsa and of Chipeniuk and Hamel. As in the latter work, the problem is reduced to a similar problem for subsets of $ℤ *_{m}$ using techniques of Green and Green-Tao. Concerning this new problem we show that, for any square-free m and any $A, B \subseteq ℤ *_{m}$ of densities α...

Infinitude of Wilson primes for $_{q} [t]$

Jim Sauerberg, Linghsueh Shu, Dinesh S. Thakur, George Todd (2013)

Acta Arithmetica

Similarity:

Goldbach’s problem with primes in arithmetic progressions and in short intervals

Karin Halupczok (2013)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Some mean value theorems in the style of Bombieri-Vinogradov’s theorem are discussed. They concern binary and ternary additive problems with primes in arithmetic progressions and short intervals. Nontrivial estimates for some of these mean values are given. As application inter alia, we show that for large odd $n \neg \equiv 1 (6)$ , Goldbach’s ternary problem $n = p_{1} + p_{2} + p_{3}$ is solvable with primes $p_{1}, p_{2}$ in short intervals $p_{i} \in [X_{i}, X_{i} + Y]$ with $X_{i}^{θ_{i}} = Y$ , $i = 1, 2$ , and $θ_{1}, θ_{2} \geq 0.933$ such that $(p_{1} + 2) (p_{2} + 2)$ has at most $9$ prime factors.

Density of solutions to quadratic congruences

Neha Prabhu (2017)

Czechoslovak Mathematical Journal

Similarity:

A classical result in number theory is Dirichlet’s theorem on the density of primes in an arithmetic progression. We prove a similar result for numbers with exactly $k$ prime factors for $k > 1$ . Building upon a proof by E. M. Wright in 1954, we compute the natural density of such numbers where each prime satisfies a congruence condition. As an application, we obtain the density of squarefree $n \leq x$ with $k$ prime factors such that a fixed quadratic equation has exactly $2^{k}$ solutions modulo $n$ . ...

Associated primes, integral closures and ideal topologies

Reza Naghipour (2006)

Colloquium Mathematicae

Similarity:

Let ⊆ be ideals of a Noetherian ring R, and let N be a non-zero finitely generated R-module. The set Q̅*(,N) of quintasymptotic primes of with respect to N was originally introduced by McAdam. Also, it has been shown by Naghipour and Schenzel that the set $A *_{a} (, N) : = ⋃_{n \geq 1} A s s_{R} R / {(ⁿ)}_{a}^{(N)}$ of associated primes is finite. The purpose of this paper is to show that the topology on N defined by ${{(ⁿ)}_{a}^{(N)} :_{R} ⟨ ⟩}_{n \geq 1}$ is finer than the topology defined by ${(ⁿ)}_{a}^{(N)}_{n \geq 1}$ if and only if $A *_{a} (, N)$ is disjoint from the quintasymptotic primes of with respect to N. Moreover,...

Some properties of the class of arithmetic functions $T_{r} (N)$

R. P. Pakshirajan (1963)

Annales Polonici Mathematici

Similarity:

Aposyndesis in $ℕ$

José del Carmen Alberto-Domínguez, Gerardo Acosta, Maira Madriz-Mendoza (2023)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We consider the Golomb and the Kirch topologies in the set of natural numbers. Among other results, we show that while with the Kirch topology every arithmetic progression is aposyndetic, in the Golomb topology only for those arithmetic progressions $P (a, b)$ with the property that every prime number that divides $a$ also divides $b$ , it follows that being connected, being Brown, being totally Brown, and being aposyndetic are all equivalent. This characterizes the arithmetic progressions which are...

Generalizing a theorem of Schur

Lenny Jones (2014)

Czechoslovak Mathematical Journal

Similarity:

In a letter written to Landau in 1935, Schur stated that for any integer $t > 2$ , there are primes $p_{1} < p_{2} < \dots < p_{t}$ such that $p_{1} + p_{2} > p_{t}$ . In this note, we use the Prime Number Theorem and extend Schur’s result to show that for any integers $t \geq k \geq 1$ and real $ϵ > 0$ , there exist primes $p_{1} < p_{2} < \dots < p_{t}$ such that $p_{1} + p_{2} + \dots + p_{k} > (k - ϵ) p_{t} .$

On q-orders in primitive modular groups

Jacek Pomykała (2014)

Acta Arithmetica

Similarity:

We prove an upper bound for the number of primes p ≤ x in an arithmetic progression 1 (mod Q) that are exceptional in the sense that $ℤ *_{p}$ has no generator in the interval [1,B]. As a consequence we prove that if $Q > e x p [c (l o g p) / (l o g B) (l o g l o g p)]$ with a sufficiently large absolute constant c, then there exists a prime q dividing Q such that $ν_{q} (o r d_{p} b) = ν_{q} (p - 1)$ for some positive integer b ≤ B. Moreover we estimate the number of such q’s under suitable conditions.

On the weak pigeonhole principle

Jan Krajíček (2001)

Fundamenta Mathematicae

Similarity:

We investigate the proof complexity, in (extensions of) resolution and in bounded arithmetic, of the weak pigeonhole principle and of the Ramsey theorem. In particular, we link the proof complexities of these two principles. Further we give lower bounds to the width of resolution proofs and to the size of (extensions of) tree-like resolution proofs of the Ramsey theorem. We establish a connection between provability of WPHP in fragments of bounded arithmetic and cryptographic assumptions...

A structure theorem for sets of small popular doubling

Przemysław Mazur (2015)

Acta Arithmetica

Similarity:

We prove that every set A ⊂ ℤ satisfying $\sum_{x} m i n (1_{A} * 1_{A} (x), t) \leq (2 + δ) t | A |$ for t and δ in suitable ranges must be very close to an arithmetic progression. We use this result to improve the estimates of Green and Morris for the probability that a random subset A ⊂ ℕ satisfies |ℕ∖(A+A)| ≥ k; specifically, we show that $ℙ (| ℕ ∖ (A + A) | \geq k) = Θ (2^{- k / 2})$ .

Carmichael numbers composed of primes from a Beatty sequence

William D. Banks, Aaron M. Yeager (2011)

Colloquium Mathematicae

Similarity:

Let α,β ∈ ℝ be fixed with α > 1, and suppose that α is irrational and of finite type. We show that there are infinitely many Carmichael numbers composed solely of primes from the non-homogeneous Beatty sequence $ℬ_{α, β} = {(⌊ α n + β ⌋)}_{n = 1}^{\infty}$ . We conjecture that the same result holds true when α is an irrational number of infinite type.

On a certain class of arithmetic functions

Antonio M. Oller-Marcén (2017)

Mathematica Bohemica

Similarity:

A homothetic arithmetic function of ratio $K$ is a function $f : ℕ \to R$ such that $f (K n) = f (n)$ for every $n \in ℕ$ . Periodic arithmetic funtions are always homothetic, while the converse is not true in general. In this paper we study homothetic and periodic arithmetic functions. In particular we give an upper bound for the number of elements of $f (ℕ)$ in terms of the period and the ratio of $f$ .

On generalized square-full numbers in an arithmetic progression

Angkana Sripayap, Pattira Ruengsinsub, Teerapat Srichan (2022)

Czechoslovak Mathematical Journal

Similarity:

Let $a$ and $b \in ℕ$ . Denote by $R_{a, b}$ the set of all integers $n > 1$ whose canonical prime representation $n = p_{1}^{α_{1}} p_{2}^{α_{2}} \dots p_{r}^{α_{r}}$ has all exponents $α_{i}$ $(1 \leq i \leq r)$ being a multiple of $a$ or belonging to the arithmetic progression $a t + b$ , $t \in ℕ_{0} : = ℕ \cup {0}$ . All integers in $R_{a, b}$ are called generalized square-full integers. Using the exponent pair method, an upper bound for character sums over generalized square-full integers is derived. An application on the distribution of generalized square-full integers in an arithmetic progression is given. ...

Lower and upper bounds for the provability of Herbrand consistency in weak arithmetics

Zofia Adamowicz, Konrad Zdanowski (2011)

Fundamenta Mathematicae

Similarity:

We prove that for i ≥ 1, the arithmetic $I Δ ₀ + Ω_{i}$ does not prove a variant of its own Herbrand consistency restricted to the terms of depth in $(1 + ε) l o g^{i + 2}$ , where ε is an arbitrarily small constant greater than zero. On the other hand, the provability holds for the set of terms of depths in $l o g^{i + 3}$ .

On a recursive formula for the sequence of primes and applications to the twin prime problem

Giovanni Fiorito (2006)

Bollettino dell'Unione Matematica Italiana

Similarity:

In this paper we give a recursive formula for the sequence of primes $\{p_{n}\}$ and apply it to find a necessary and sufficient condition in order that a prime number $p_{n+1}$ is equal to $p_{n}+2$ . Applications of previous results are given to evaluate the probability that $p_{n+1}$ is of the form $p_{n}+2$ ; moreover we prove that the limit of this probability is equal to zero as $n$ goes to $\infty$ . Finally, for every prime $p_{n}$ we construct a sequence whose terms that are in the interval $[p_{n}^{2}-2,p_{n+1}^{2}-2[$ are the first terms of two twin primes. This...