Related papers: Squarefree numbers in short intervals
In this paper, we show that, for some constant $C > 0$, the interval $(x, x + C x^{5/26}]$ always contains a squarefree number when $x$ is sufficiently large (in terms of $C$). Our improvement comes from establishing asymptotic relations…
We obtain explicit forms of the current best known asymptotic upper bounds for gaps between squarefree integers. In particular we show, for any $x \ge 2$, that every interval of the form $(x, x + 11x^{1/5}\log x]$ contains a squarefree…
In this paper, we study the variance of the number of squarefull numbers in short intervals. As a result, we are able to prove that, for any $0 < \theta < 1/2$, almost all short intervals $(x, x + x^{1/2 + \theta}]$ contain about…
We cosider the number of r-tuples of squarefree numbers in a short interval. We prove that it cannot be much bigger than the expected value and we also estabish an asymptotic formula if the interval is not very short.
Let $\epsilon > 0$ be sufficiently small and let $0 < \eta < 1/522$. We show that if $X$ is large enough in terms of $\epsilon$ then for any squarefree integer $q \leq X^{196/261-\epsilon}$ that is $X^{\eta}$-smooth one can obtain an…
We develop a general approach for showing when a set of integers $\mathscr{A}$ has infinitely many $k^{th}$ powerfree numbers without relying on equidistribution estimates for $\mathscr{A}$. In particular, we show that if the Fourier…
We show that counts of squarefree integers up to $X$ in short intervals of size $H$ tend to a Gaussian distribution as long as $H\rightarrow\infty$ and $H = X^{o(1)}$. This answers a question posed by R.R. Hall in 1989. More generally we…
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…
We present an algorithm, based on the explicit formula for $L$-functions and conditional on GRH, for proving that a given integer is squarefree with little or no knowledge of its factorization. We analyze the algorithm both theoretically…
We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992).…
We show that the exponent of distribution of the sequence of squarefree numbers in arithmetic progressions of prime modulus is $\geq 2/3 + 1/57$, improving a result of Prachar from 1958. Our main tool is an upper bound for certain bilinear…
We investigate the error term of the asymptotic formula for the number of squarefree integers up to some bound, and lying in some arithmetic progression a (mod q). In particular, we prove an upper bound for its variance as a varies over…
In the present paper we prove that for any fixed $1<c<7/6$ there exist infinitely many consecutive square-free numbers of the form $[n^c], [n^c]+1$ and we also establish an asymptotic formula in given interval.
We study representation of square-free polynomials in the polynomial ring F[t] over a finite field F by polynomials in F[t][x]. This is a function field version of the well-studied problem of representing squarefree integers by integer…
Let $x$ be a positive real number, and $\mathcal{P} \subset [2,\lambda(x)]$ be a set of primes, where $\lambda(x) \in \Omega(x^\varepsilon)$ is a monotone increasing function with $\varepsilon \in (0,1)$. We examine $Q_{\mathcal{P}}(x)$,…
This paper reports the results of a search for first occurrences of square-free gaps using an algorithm based on the sieve of Eratosthenes. Using Qgap(L) to denote the starting number of the first gap having exactly the length L, the…
In this paper, we consider a variant of Tur\'an's problem on the distance from an integer polynomial in $\mathbb{Z}[x]$ to the nea\-rest irreducible polynomial in $\mathbb{Z}[x]$. We prove that for any polynomial $f \in \mathbb{Z}[x]$,…
We study few properties of square-free integers in certain equations. Using this property, we derive some infinite products in powers of square free numbers. Also, we present a method, to convert power series and trigonometric series to…
For nonempty subsets $S_0, \dots, S_{n-1}$ of a (large enough) finite field $\mathbb{F}$ satisfying $$|S_1|, \dots, |S_{n-1}| > 2 \quad \mathrm{or} \quad |S_1|,|S_{n-1}| > n - 1,$$ we show that there exist $a_0 \in S_0, \dots, a_{n-1} \in…
We use Bourgain's recent bound for short exponential sums to prove certain independence results related to the distribution of squarefree numbers in arithmetic progressions.