In this paper, we establish some nontrivial and effective upper bounds for the least common multiple of consecutive terms of a finite arithmetic progression. Precisely, we prove that for any two coprime positive integers $a$ and $b$, with $b\geq 2$, we have \[\mathrm{lcm}\left(a,a+b,\dots,a+nb\right) \leq \left(c_1\cdot b\log b\right)^{n+\left\lfloor \frac{a}{b}\right\rfloor}~~~~(\forall n\geq b+1),\] where $c_1=41.30142$. If in addition $b$ is a prime number and $a<b$, then we prove that for any $n\geq b+1$, we have $\mathrm{lcm}\left(a,a+b,\dots,a+nb\right) \leq \left(c_2\cdot b^{\frac{b}{b-1}}\right)^n$, where $c_2=12.30641$. Finally, we apply those inequalities to estimate the arithmetic function $M$ defined by $M(n):=\frac{1}{φ(n)}\sum_{\substack{1\leq\ell\leq n \\ \ell \wedge n=1}}\frac{1}{\ell}$ ($\forall n \geq 1$), as well as some values of the generalized Chebyshev function $θ(x;k,\ell)$.
We develop a theory of multiplicative functions (with values inside or on the unit circle) in arithmetic progressions analogous to the well-known theory of primes in arithmetic progressions.
Euler showed that there can be no more than three integer squares in arithmetic progression. In quadratic number fields, Xarles has shown that there can be arithmetic progressions of five squares, but not of six. Here, we prove that there are no cubic number fields which contain five squares in arithmetic progression.
We show that there exists a positive constant C such that the following holds: Given an infinite arithmetic progression A of real numbers and a sufficiently large integer n (depending on A), there needs at least Cn geometric progressions to cover the first n terms of A. A similar result is presented, with the role of arithmetic and geometric progressions reversed.
Green and Tao proved that the primes contains arbitrarily long arithmetic progressions. We show that, essentially the same proof leads to the following result: The primes in an short interval contains many arithmetic progressions of any given length.
In this paper we continue the investigations about unlike powers in arithmetic progression. We provide sharp upper bounds for the length of primitive non-constant arithmetic progressions consisting of squares/cubes and $n$-th powers.
We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic progressions is also given.
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.
In this paper we investigate the recent advances by Zhang, Maynard and Pintz towards Polignac's conjecture and give some new results concerning the relationship between Polignac numbers and arithmetic progressions.
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 arithmetic progressions that satisfy additional congruence conditions and provide asymptotic approximations.
We prove a result on the distribution of the general divisor functions in arithmetic progressions to smooth moduli which exceed the square root of the length.
We prove that if $A\subseteq \{1,\dots,N\}$ does not contain any non-trivial three-term arithmetic progression, then $$|A|\ll \frac{(\log\log N)^{3+o(1)}}{\log N}N\,.$$
We implement the Maynard-Tao method of detecting primes in tuples to investigate small gaps between primes in arithmetic progressions, with bounds that are uniform over a range of moduli.
Let $γ<1<c$ and $19(c-1)+171(1-γ)<9$. In this paper, we establish an asymptotic formula for exponential sums over Piatetski-Shapiro primes $p=[n^{1/γ}]$ in arithmetic progressions.
In this paper we deal with composite rational functions having zeros and poles forming consecutive elements of an arithmetic progression. We also correct a result published earlier related to composite rational functions having a fixed number of zeros and poles.
We show that if besides the primes some other sequences (involving the Liouville function and the primes) have a common distribution level exceeding 0.7231 then for any positive even integer $h$ there are arbitrarily long arithmetic progressions of primes $p$ such that $p+h$ is also prime for each element of the progression. In case of $h=2$ this means that under some plausible unproved hypotheses about regular distribution of the primes and other sequences in arithmetic progressions we really have arbitrarily long arithmetic progressions in the sequence of twin primes.
The goal of this article is to study the discrepancy of the distribution of arithmetic sequences in arithmetic progressions. We will fix a sequence $\A=\{\a(n)\}_{n\geq 1}$ of non-negative real numbers in a certain class of arithmetic sequences. For a fixed integer $a\neq 0$, we will be interested in the behaviour of $\A$ over the arithmetic progressions $a \bmod q$, on average over $q$. Our main result is that for certain sequences of arithmetic interest, the value of $a$ has a significant influence on this distribution, even after removing the first term of the progressions.
We answer a number of questions of Erdős on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a variety of arithmetic constraints upon such progressions, under the assumption of the $abc$-conjecture of Masser and Oesterlé.
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 progressions consisting of four squares over Q(sqrt{d}).
We obtain an asymptotic formula, in the spirit of the Montgomery-Hooley refinement of the Barban-Davenport-Halberstam Theorem, for the variance associated with tuples of k-free numbers in arithmetic progressions.
In this paper we give a very elementary proof that if A and B are subsets of {1,2,...,N}, each having at least 5N^{1 - (4(k-1))^{-1}} elements, then the sumset A+B has a k-term arithmetic progression.
I show that a trivial modification of a standard proof of the Roth's Theorem on triples in arithmetic progression would lead to the following Theorem: If A is a "large set" that is its elements are monotone increasing integers and the sum of reciprocals of its elements diverges then the sequence contains an arithmetic progression of length three.
In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.
Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic progression in short intervals. Previous results were averaged over all progression of a given modulus. The method uses a short divisor sum approximation for the von Mangoldt function, together with some new results for binary correlations of this divisor sum approximation in arithmetic progressions.
We find a lower bound for the number of Chen primes in the arithmetic progression $a \bmod q$, where $(a,q)=(a+2,q)=1$. Our estimate is uniform for $q \leq \log^M x$, where $M>0$ is fixed.
As the conclusion of a line of investigation undertaken in two previous papers, we compute asymptotic frequencies for the values taken by numerators of differences of consecutive Farey fractions with denominators restricted to lie in arithmetic progression.
An asymptotic formula for the variance of squarefree numbers in arithmetic progressions of given modulus was obtained by Nunes (see reference [3]). We improve one of the error terms.
We prove an explicit error term for the $ψ(x,χ)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.
We give asymptotics for correlation sums linked with the distribution of squarefree numbers in arithmetic progressions over a fixed modulus. As a particular case we improve a result of Blomer concerning the variance.
We obtain an asymptotic formula for the second discrete moment of the Riemann zeta function over the arithmetic progression $\frac{1}{2} + in$. It shows that the first main term is equal to that of the continuous mean value.
We show estimates for the distribution of $k$-free numbers in short intervals and arithmetic progressions. We argue that, at least in certain ranges, these estimates agree with a conjecture by H. L. Montgomery.
In this paper, we study $k$-term arithmetic progressions $N, N+d, ..., N+(k-1)d$ of powerful numbers. Under the $abc$-conjecture, we obtain $d \gg_εN^{1/2 - ε}$. On the other hand, there exist infinitely many $3$-term arithmetic progressions of powerful numbers with $d \ll N^{1/2}$ unconditionally. We also prove some partial results when $k \ge 4$ and pose some open questions.
We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$, extending the Bombieri-Vinogradov theorem to moduli of size $x^{1/2+δ}$ which have conveniently sized divisors. The main feature of these estimates is that they are completely uniform with respect to the residue classes considered, unlike previous works on primes in arithmetic progressions to large moduli.
We consider the reduction of an elliptic curve defined over the rational numbers modulo primes in a given arithmetic progression and investigate how often the subgroup of rational points of this reduced curve is cyclic as a special case of Serre's Cyclicity Conjecture.
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, this improves significantly upon an earlier result of Dey and Thangadurai.
We study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument is based on getting an upper bound for the l1 norm of the Fourier coefficients of a generalized arithmetic progression. Our method also applies to give upper bounds for polynomial exponential sums.
Fix coprime natural numbers $a,q$. Assuming the Prime $k$-tuple Conjecture, we show that there exist arbitrarily long arithmetic progressions of Carmichael numbers, each of which lies in the reduced residue class $a$ mod $q$ and is a product of three distinct prime numbers.
We show that smooth-supported multiplicative functions $f$ are well-distributed in arithmetic progressions $a_1a_2^{-1} \pmod q$ on average over moduli $q\leq x^{3/5-\varepsilon}$ with $(q,a_1a_2)=1$.
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 that $q$ has a certain factorisation.
Let a be an integer and q a prime number. In this paper, we find an asymptotic formula for the number of positive integers n < x with the property that no divisor d > 1 of n lies in the arithmetic progression a modulo q.
In this paper we present some new results about unlike powers in arithmetic progression. We prove among other things that for given $k\geq 4$ and $L\geq 3$ there are only finitely many arithmetic progressions of the form $(x_0^{l_0},x_1^{l_1},...,x_{k-1}^{l_{k-1}})$ with $x_i\in{\Bbb Z},$ gcd$(x_0,x_1)=1$ and $2\leq l_i\leq L$ for $i=0,1,...,k-1.$ Furthermore, we show that, for L=3, the progression $(1,1,...,1)$ is the only such progression up to sign.
Iannucci considered the positive divisors of a natural number $n$ that do not exceed $\sqrt{n}$ and found all forms of numbers whose such divisors are in arithmetic progression. In this paper, we generalize Iannucci's result by excluding the trivial divisors $1$ and $\sqrt{n}$ (when $n$ is a square). Surprisingly, the length of our arithmetic progression cannot exceed $5$.
In this paper, we study how close the terms of a finite arithmetic progression can get to a perfect square. The answer depends on the initial term, the common difference and the number of terms in the arithmetic progression.
We consider weighted averages of the number of representations of an even integer as a sum of two prime numbers, where each summand lies in a given arithmetic progression modulo a common integer $q$. Our result is uniform in a suitable range for $q$.
We look for elliptic curves featuring rational points whose coordinates form two arithmetic progressions, one for each coordinate. A constructive method for creating such curves is shown, for lengths up to 5.
A positive integer n is called r-free if n is not divisible by the r-th power of a prime. Generalizing earlier work of Orr, we provide an upper bound of Bombieri-Vinogradov type for the r-free numbers in arithmetic progressions.
