Related papers: Arithmetic Progressions in Squarefull Numbers

A conjecture of Erd\H{o}s states that, for any large prime $q$, every reduced residue class $\pmod q$ can be represented as a product $p_1p_2$ of two primes $p_1,p_2\leq q$. We establish a ternary version of this conjecture, showing that,…

Let $I(b,d,k)$ be the subseries of the harmonic series keeping the integers having exactly $k$ occurrences of the digit $d$ in base $b$. We prove the existence of an asymptotic expansion to all orders in descending powers of $b$, for fixed…

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…

This is the second of two coupled papers estimating the mean values of multiplicative functions, of unknown support, on arithmetic progressions with large differences. Applications are made to the study of primes in arithmetic progression…

We investigate the coefficients of the polynomial \[ S_{m,r}^n(\ell)=r^n+(m+r)^n+(2m+r)^n+\cdots+((\ell-1)m+r)^n. \] We prove that these can be given in terms of Stirling numbers of the first kind and $r$-Whitney numbers of the second kind.…

In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmetic progressions. Our aim in this paper is to strengthen this…

Let $f(x)\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $d\ge 1$. Let $k\ge2$ be an integer. The number of integers $n$ such that $f(n)$ is $k$-free is widely studied in the literature. In principle, one expects that $f(n)$ is…

We evaluate asymptotically the variance of the number of squarefree integers up to $x$ in short intervals of length $H < x^{6/11 - \varepsilon}$ and the variance of the number of squarefree integers up to $x$ in arithmetic progressions…

For an integer $b\geq 2$, we call a positive integer $b$-anti-Niven if it is relatively prime to the sum of the digits in its base-$b$ representation. In this article, we investigate the maximum lengths of arithmetic progressions of…

We prove an upper bound for the length of an arithmetic progression represented by an irreducible integral binary quadratic form or a norm form, which depends only on the form and the progression's common difference. For quadratic forms,…

For coprime positive integers $a, b, c$, where $a+b=c$, $\gcd(a,b,c)=1$ and $1\leq a < b$, the famous $abc$ conjecture (Masser and Oesterl\`e, 1985) states that for $\varepsilon > 0$, only finitely many $abc$ triples satisfy $c >…

We prove a modification as well as an improvement of a result of K. Ford, D. R. Heath-Brown and S. Konyagin concerning prime avoidance of square-free numbers and perfect powers of prime numbers.

We show that smooth numbers are equidistributed in arithmetic progressions to moduli of size $x^{66/107-o(1)}$. This overcomes a longstanding barrier of $x^{3/5-o(1)}$ present in previous works of Bombieri-Friedlander-Iwaniec,…

The purpose of this note is to verify that the results attained in [6] admit an extension to the multidimensional setting. Namely, for subsets of the two dimensional torus we find the sharp growth rate of the step(s) of a generalized…

We show that any proper symmetric two dimensional arithmetic progression contained in the interval $[-T,T]$ which avoids non-zero perfect squares has at most $O_\varepsilon(T^{20/27+\varepsilon})$ elements. This improves on a result of…

For $q>1$ we consider expansions in base $q$ over the alphabet $\{0,1,q\}$. Let $\mathcal{U}_q$ be the set of $x$ which have a unique $q$-expansions. For $k=2, 3,\cdots,\aleph_0$ let $\mathcal{B}_k$ be the set of bases $q$ for which there…

We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

In 1975 Szemer\'edi proved that a set of integers of positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman showed in 1996 that the common difference of the arithmetic progression can be a square, a…

Let $\mathbb{Z}^{+}$ be the set of positive integers. Let $C_{k}$ denote all subsets of $\mathbb{Z}^{+}$ such that neither of them contains $k + 1$ pairwise coprime integers and $C_k(n)=C_k\cap \{1,2,\ldots,n\}$. Let $f(n, k) =…