Related papers: A Note on the least squarefree number in an arithm…
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.
The main objective of this article is to study the asymptotic behavior of Salie sums over arithmetic progressions. We deduce from our asymptotic formula that Salie sums possess a bias of being positive. The method we use is based on…
$ $The aim of this thesis is to lower the bound on square-free primitive roots modulo primes. Let $g^{\Box}(p)$ be the least square-free primitive root modulo $p$. We have proven the following two theorems. Theorem 0.1. $$g^{\Box}(p) <…
We prove that the average error term when counting square-free values of polynomials is the quartic root of the main term.
By means of a Fourier optimization framework, we improve the current asymptotic bounds under GRH for two classical problems in number theory: the problem of estimating the least quadratic non-residue modulo a prime, and the problem of…
Let $s_1, s_2, s_3, \cdots$ be the set of squarefree numbers in ascending order. In this paper, we prove that the following asymptotic on moments of gaps between squarefree numbers \[ \sum_{s_{k+1} \le x} (s_{k+1} - s_k)^\gamma \sim…
We calculate the mean and variance of sums of the M\"obius function and the indicator function of the squarefrees, in both short intervals and arithmetic progressions, in the context of the ring of polynomials over a finite field of $q$…
We use a function field analogue of a method of Selberg to derive an asymptotic formula for the number of (square-free) monic polynomials in $\mathbb{F}_q[X]$ of degree $n$ with precisely $k$ irreducible factors, in the limit as $n$ tends…
We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…
A classical problem in number theory is showing that the mean value of an arithmetic function is asymptotic to its mean value over a short interval or over an arithmetic progression, with the interval as short as possible or the modulus as…
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…
Based on work of P. Balister, B. Bollob\'as, R. Morris, J. Sahasrabudhe and M. Tiba, we show that if a covering system has distinct squarefree moduli, then the minimum modulus is at most 118. We also show that in general the $k^{\rm th}$…
By using the $q$-analogue of van der Corput's method we study the divisor function in an arithmetic progression to modulus $q$. We show that the expected asymptotic formula holds for a larger range of $q$ than was previously known, provided…
We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…
Schur introduced the problem on the smallest limit point for the arithmetic means of totally positive conjugate algebraic integers. This area was developed further by Siegel, Smyth and others. We consider several generalizations of the…
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,…
Let $N$ be a large prime and $P, Q \in \mathbb{Z}[x]$ two linearly independent polynomials with $P(0) = Q(0) = 0$. We show that if a subset $A$ of $\mathbb{Z}/N\mathbb{Z}$ lacks a progression of the form $(x, x + P(y), x + Q(y), x + P(y) +…
In this paper we obtain a new fully explicit constant for the P\'olya-Vinogradov inequality for squarefree modulus. Given a primitive character $\chi$ to squarefree modulus $q$, we prove the following upper bound \begin{align*} \left|…
Let d be a squarefree integer. Does there exist four squares in arithmetic progression over Q(sqrt{d})? We shall give a partial answer to this question, depending on the value of d. In the affirmative case, we construct explicit arithmetic…
We prove a new equidistribution estimate for the divisor function in arithmetic progression to moduli that have two small factors. We give two applications. First, we show an asymptotic formula for the divisor function over arithmetic…