English
Related papers

Related papers: Squarefree Integers in Arithmetic Progressions to …

200 papers

We answer several questions of Erd\H{o}s regarding sequences of natural numbers $A$ whose translates $n+A$ intersect with the squarefree numbers in various specified ways. For instance, we show that if every translate only contains finitely…

Number Theory · Mathematics 2025-12-09 Wouter van Doorn , Terence Tao

In a recent paper, one of us posed three open problems concerning squarefree arithmetic progressions in infinite words. In this note we solve these problems and prove some additional results.

Combinatorics · Mathematics 2019-01-21 James Currie , Tero Harju , Pascal Ochem , Narad Rampersad

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

Given f in Z[x_1,...,x_n], we compute the density of x in Z^n such that f(x) is squarefree, assuming the abc conjecture. Given f,g in Z[x_1,...,x_n], we compute unconditionally the density of x in Z^n such that gcd(f(x),g(x))=1. Function…

Number Theory · Mathematics 2017-04-03 Bjorn Poonen

Let $\phi(n)$ be the Euler-phi function, define $\phi_0(n) = n$ and $\phi_{k+1}(n)=\phi(\phi_{k}(n))$ for all $k\geq 0$. We will determine an asymptotic formula for the set of integers $n$ less than $x$ for which $\phi_k(n)$ is $y$-smooth,…

Number Theory · Mathematics 2010-05-26 Youness Lamzouri

We study smoothness of densities for the solutions of SDEs whose coefficients are smooth and nondegenerate only on an open domain $D$. We prove that a smooth density exists on $D$ and give upper bounds for this density. Under some…

Probability · Mathematics 2011-08-24 Stefano De Marco

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the…

Number Theory · Mathematics 2018-11-29 Michael A. Bennett , Greg Martin , Kevin O'Bryant , Andrew Rechnitzer

We establish new estimates for the number of $m$-smooth polynomials of degree $n$ over a finite field $\mathbb{F}_q$, where the main term involves the number of $m$-smooth permutations on $n$ elements. Our estimates imply that the…

Number Theory · Mathematics 2023-10-04 Ofir Gorodetsky

A set of positive integers $A \subset \mathbb{Z}_{> 0}$ is \emph{log-sparse} if there is an absolute constant $C$ so that for any positive integer $x$ the sequence contains at most $C$ elements in the interval $[x,2x)$. In this note we…

Combinatorics · Mathematics 2021-04-20 Noga Alon , Ryan Alweiss , Yang P. Liu , Anders Martinsson , Shyam Narayanan

Let $\chi=\chi_q$ be a primitive character mod $q$ and fix $\Delta>0$. In 1989 Graham and Ringrose gave strong bounds on character sums $\sum_{M<n\leq M+N} \chi(n)$ in intervals of length $N=q^\Delta$ whenever $q$ is squarefree and is…

Number Theory · Mathematics 2026-01-19 Todd Cochrane , Andrew Granville , Junren Zheng

In this paper we present and prove rapidly convergent formulas for the distribution of the $3$-smooth, $5$-smooth, $7$-smooth and all other smooth numbers. One of these formulas is another version of a formula due to Hardy and Littlewood…

Number Theory · Mathematics 2016-10-25 Raphael Schumacher

In this paper, we improve the error term in a previous paper on an asymptotic formula for the number of squarefull numbers in an arithmetic progression.

Number Theory · Mathematics 2014-07-02 Tsz Ho Chan

In this paper, using a method of Luca and the author, we find all values $x$ such that the quadratic polynomials $x^2+1,$ $x^2+4,$ $x^2+2$ and $x^2-2$ are 200-smooth and all values $x$ such that the quadratic polynomial $x^2-4$ is…

Number Theory · Mathematics 2011-11-24 Filip Najman

The Thue--Morse sequence $t=01101001\cdots$ is an automatic sequence over the alphabet $\{0,1\}$. It can be defined as the binary sum-of-digits function $s:\mathbb N\rightarrow\mathbb N$, reduced modulo $2$, or by using the substitution…

Number Theory · Mathematics 2023-09-11 Lukas Spiegelhofer

Given a squarefree monomial ideal $I \subseteq R =k[x_1,\ldots,x_n]$, we show that $\widehat\alpha(I)$, the Waldschmidt constant of $I$, can be expressed as the optimal solution to a linear program constructed from the primary decomposition…

We study a function field version of a classical problem concerning square-free values of polynomials evaluated at primes. We show that for a square-free polynomial $f\in \mathbb{F}_q[t][x]$, there is a limiting density as $n\to \infty$ of…

Number Theory · Mathematics 2015-06-02 Guy Lando

We obtain the analog of the Bombieri-Vinogradov theorem for square moduli up to any power of x less than 1/2.

Number Theory · Mathematics 2016-02-11 Roger Baker

We use exponent pairs to establish the existence of many $x^a$-smooth numbers in short intervals $[x-x^b,x]$, when $a>1/2$. In particular, $b=1-a-a(1-a)^3$ is admissible. Assuming the exponent-pairs conjecture, one can take…

Number Theory · Mathematics 2021-08-18 Andreas Weingartner

We show how multiplier ideals can be used to obtain uniform multiplicative bounds for certain families of ideals on a smooth complex algebraic variety. In particular we prove a quick but rather surprising result about symbolic powers of…

Algebraic Geometry · Mathematics 2009-10-31 Lawrence Ein , Robert Lazarsfeld , Karen E. Smith

Let f\in Z[x], deg(f)=3. Assume that f does not have repeated roots. Assume as well that, for every prime q, the inequality f(x)\not\equiv 0 mod q^2 has at least one solution in (Z/q^2 Z)^*. Then, under these two necessary conditions, there…

Number Theory · Mathematics 2014-07-21 H. A. Helfgott
‹ Prev 1 3 4 5 6 7 10 Next ›