English
Related papers

Related papers: On Improving Roth's Theorem in the Primes

200 papers

Let $p_n$ denote the $n$-th prime number, and let $d_n=p_{n+1}-p_{n}$. Under the Hardy--Littlewood prime-pair conjecture, we prove \begin{align*} \sum_{n\le X}\frac{\log^{\alpha}d_n}{d_n} \sim\begin{cases} \frac{X\log\log\log X}{\log…

Number Theory · Mathematics 2018-08-28 Nian Hong Zhou

Green and Tao famously proved in 2005 that any subset of the primes of fixed positive density contains arbitrarily long arithmetic progressions. Green had previously shown that in fact any subset of the primes of relative density tending to…

Number Theory · Mathematics 2019-06-14 Luka Rimanic , Julia Wolf

We fix a non-zero integer $a$ and consider arithmetic progressions $a \bmod q$, with $q$ varying over a given range. We show that for certain specific values of $a$, the arithmetic progressions $a \bmod q$ contain, on average, significantly…

Number Theory · Mathematics 2019-12-19 Daniel Fiorilli

Let $w(n)$ be an additive non-negative integer-valued arithmetic function which is equal to $1$ on primes. We study the distribution of $n + w(n)$ $\pmod p$ and give a lower bound for the density of the set of numbers which are not…

Number Theory · Mathematics 2022-11-29 Petr Kucheriaviy

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

Number Theory · Mathematics 2019-04-01 Lucile Devin

Let P denote the set of all primes. Suppose that P_1, P_2, P_3 are three subsets of P with the sum of their lower densities relative to P is greater than 2. We prove that for sufficiently large odd integer n, there exist p_i\in P_i such…

Number Theory · Mathematics 2008-12-06 Hongze Li , Hao Pan

A nonempty finite set of positive integers A is relatively prime if gcd(A) = 1 and it is relatively prime to n if gcd(A [ fng) = 1. The number of nonempty subsets of A which are relatively prime to n is \Phi(A, n) and the number of such…

Number Theory · Mathematics 2009-10-27 Mohamed El Bachraoui

Given an integer $t\ge 1$, a rational number $g$ and a prime $p\equiv 1({\rm mod} t)$ we say that $g$ is a near-primitive root of index $t$ if $\nu_p(g)=0$, and $g$ is of order $(p-1)/t$ modulo $p$. In the case $g$ is not minus a square we…

Number Theory · Mathematics 2020-08-27 Pieter Moree

Let $\Phi(x,y)$ denote the number of integers $n\in[1,x]$ free of prime factors $\le y$. We show that but for a few small cases, $\Phi(x,y)<.6x/\log y$ when $y\le\sqrt{x}$.

Number Theory · Mathematics 2023-08-15 Steve Fan , Carl Pomerance

Given a density t in (0,1], and a prime p, let S be any subset of F_p having at least tp elements, and having the least number of three-term arithmetic progressions mod p among all subsets of F_p with at least tp elements. Define N(t,p) to…

Combinatorics · Mathematics 2007-05-23 Ernie Croot

Let $d_n = p_{n+1} - p_n$, where $p_n$ denotes the $n$th smallest prime, and let $R(T) = \log T \log_2 T\log_4 T/(\log_3 T)^2$ (the "Erd{\H o}s--Rankin" function). We consider the sequence $(d_n/R(p_n))$ of normalized prime gaps, and show…

Number Theory · Mathematics 2015-10-29 Roger Baker , Tristan Freiberg

In this paper we show that certain sets are dense in $\mathbb{R}$. We give some applications. For example, we show an analytical proof that $q^{\frac{1}{n}}$, $q$ is a prime number and $e$; are irrational numbers. As another application we…

Classical Analysis and ODEs · Mathematics 2016-03-21 Manas R. Sahoo

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : \Omega(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$\pi_k(x):=\ \mid\{n\leq x :…

Number Theory · Mathematics 2014-01-14 Martin Belton

Suppose $A$ is a subset of $\{1, \dotsc, N\}$ which does not contain any configurations of the form $x,x+\lfloor n^c \rfloor$ where $n \neq 0$ and $1<c<\frac{6}{5}$. We show that the density of $A$ relative to the first $N$ integers is…

Number Theory · Mathematics 2024-11-19 Maximilian O'Keeffe

Consider the partially ordered set on $[t]^n:=\{0,\dots,t-1\}^n$ equipped with the natural coordinate-wise ordering. Let $A(t,n)$ denote the number of antichains of this poset. The quantity $A(t,n)$ has a number of combinatorial…

Combinatorics · Mathematics 2023-10-20 Victor Falgas-Ravry , Eero Räty , István Tomon

Let $\mathcal{P}$ be the set of primes and $\mathbb{N}$ the set of positive integers. Let also $r_1,...,r_t$ be positive real numbers and $R_2(r_1,...,r_t)$ the set of odd integers which can be represented as $$ p+2^{\lfloor…

Number Theory · Mathematics 2024-12-17 Yuchen Ding , Wenguang Zhai

For pure extensions $K=\mathbb{Q}(\alpha)$ with $\alpha^n=m$, we give a short proof, based only on Dedekind's index theorem, of the $\alpha$-monogeneity criterion: $\mathbb{Z}[\alpha]=\mathcal{O}_K$ if and only if $m$ is square-free and…

Number Theory · Mathematics 2026-01-09 Khai-Hoan Nguyen-Dang , Nguyen Thai Hung

We investigate the approximation to the number of primes in arithmetic progressions given by Vaughan. Instead of averaging the expected error term over all residue classes to modules in a given range, here we only consider subsets of…

Number Theory · Mathematics 2022-01-31 Claus Bauer

We prove that if $\alpha$ is a non-zero algebraic number of degree $d \geq 2$ which is not a root of unity, then $dh(\alpha)>(1/4) (\log(\log (d))/\log(d))^3.

Number Theory · Mathematics 2021-06-15 Paul Voutier

We consider the problem of finding small prime gaps in various sets of integers $\mathcal{C}$. Following the work of Goldston-Pintz-Yildirim, we will consider collections of natural numbers that are well-controlled in arithmetic…

Number Theory · Mathematics 2014-05-15 Jacques Benatar
‹ Prev 1 4 5 6 7 8 10 Next ›