In this paper we study the Diophantine equation \begin{align*} b^k + \left(a+b\right)^k + &\left(2a+b\right)^k + \ldots + \left(a\left(x-1\right) + b\right)^k = \\ &y\left(y+c\right) \left(y+2c\right) \ldots \left(y+ \left(\ell-1\right)c\right), \end{align*} where $a,b,c,k,\ell$ are given integers under natural conditions. We prove some effective results for special values for $c,k$ and $\ell$ and obtain a general ineffective result based on Bilu-Tichy method.
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.
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 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.
We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression. Based on this distribution, a general formula was obtained for the asymptotic estimate of the sums of functions of primes, and also asymptotics was found for the sums of various functions of primes on a geometric progression. Several assertions about asymptotics of sums of functions of prime numbers on a geometric progression are proved. Necessary and sufficien…
Let $l$ and $m$ be two integers with $l>m\ge 0$, and let $f(x)$ be the product of two linear polynomials with integer coefficients. In this paper, we show that $\log {\rm lcm}_{mn<i\le ln}\{f(i)\}=An+o(n)$, where $A$ is a constant depending only on $l$, $m$ and $f$.
Let $l$ and $m$ be two integers with $l>m\ge 0$, and let $a$ and $b$ be integers with $a\ge 1$ and $a+b\ge 1$. In this paper, we prove that $\log {\rm lcm}_{mn<i\le ln}\{ai+b\} =An+o(n)$, where $A$ is a constant depending on $l, m$ and $a$.
In this paper we construct $q$-Genocchi numbers and polynomials. By using these numbers and polynomials, we investigate the $q$-analogue of alternating sums of powers of consecutive integers due to Euler.
Sums of the singular series constants that appear in the Hardy--Littlewood $k$-tuples conjectures have long been studied in connection to the distribution of primes. We study constrained sums of singular series, where the sum is taken over sets whose elements are specified modulo $r$ or weighted by smooth functions. We show that the value of the sum is governed by incidences modulo $r$ of elements of the set in the case of arithmetic progressions and by pairings of the smooth functions in the case of weights. These sums shed light on sums of singular series in other formats.
We consider Mertens' function M(x,q,a) in arithmetic progression, Assuming the generalized Riemann hypothesis (GRH), we show an upper bound that is uniform for all moduli which are not too large. For the proof, a former method of K. Soundararajan is extended to L-series.
For finite sums of non-negative powers of arithmetic progressions the generating functions (ordinary and exponential ones) for given powers are computed. This leads to a two parameter generalization of Stirling and Eulerian numbers. A direct generalization of Bernoulli numbers and their polynomials follows. On the way to find the Faulhaber formula for these sums of powers in terms of generalized Bernoulli polynomials one is led to a one parameter generalization of Bernoulli numbers and their polynomials. Generalized Lah numbers are also considered.
We prove that the equation $(x-2r)^3 + (x-r)^3 + x^3 + (x+r)^3 + (x+2r)^3= y^p$ only has solutions which satisfy $xy=0$ for $1\leq r\leq 10^6$ and $p\geq 5$ prime.
In this paper we construct a new q-Euler numbers and polynomials. By using these numbers and polynomials, we give the interesting formulae related to alternating sums of powers of consecutive q-integers following an idea due to Euler.
We study the variance of sums of the $k$-fold divisor function $d_k(n)$ over sparse arithmetic progressions, with averaging over both residue classes and moduli. In a restricted range, we confirm an averaged version of a recent conjecture about the asymptotics of this variance. This result is closely related to moments of Dirichlet $L$-functions and our proof relies on the asymptotic large sieve.
We determine primitive solutions to the equation $(x-r)^2 + x^2 + (x+r)^2 = y^n$ for $1 \le r \le 5,000$, making use of a factorization argument and the Primitive Divisors Theorem due to Bilu, Hanrot and Voutier.
In this paper we construct the q-analogue of Barnes' Bernoulli numbers and plynomials of degree 2, which is an answer to a part of Schlosser's question. Finally, we treat the q-analogue of the sums of powers of consecutive integrs.
Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph is the hypergraph of sums of $k$ ($k\geq 1$ fixed) arithmetic progressions. The hyperedges of this hypergraph are of the form $A_{1}+A_{2}+\hdots+A_{k}$ in $[N]$, where the $A_{i}$ are arithmetic progressions. For this hypergraph Hebbinghaus (2004) proved a lower bound of $Ω(N^{k/(2k+2)})$. Note that the probabilistic method gives an upper bound of order $O…
Euler noted the relation $6^3=3^3+4^3+5^3$ and asked for other instances of cubes that are sums of consecutive cubes. Similar problems have been studied by Cunningham, Catalan, Gennochi, Lucas, Pagliani, Cassels, Uchiyama, Stroeker and Zhongfeng Zhang. In particular Stroeker determined all squares that can be written as a sum of at most $50$ consecutive cubes. We generalize Stroeker's work by determining all perfect powers that are sums of at most $50$ consecutive cubes. Our methods include descent, linear forms in two logarithms, and Frey-Hellegouarch curves.
We give a characterization of all pairs $(k,n)$ of positive integers for which the ratio $$ \frac{1^k-2^k+3^k-\dots+(-1)^{n+1} n^k}{1^k-2^k+3^k-\dots+(-1)^{n}(n-1)^k} $$ of two consecutive alternating power sums is an integer.
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. Moreover, we prove a necessary and sufficient condition for the integrity of these coefficients.
In this paper we construct the $q$-analogue of Barnes's Bernoulli numbers and polynomials of degree 2, for positive even integers, which is an answer to a part of Schlosser's question. For positive odd integers, Schlosser's question is still open. Finally, we will treat the $q$-analogue of the sums of powers of consecutive integers.
Arithmetic progressions of integers that are relatively prime to their digital sums
The College of Idaho（爱达荷学院）；Cedar Crest College（雪松crest学院）；Bryn Mawr College（布林茅尔学院）；University of Michigan（密歇根大学）；Kutztown University of Pennsylvania（宾夕法尼亚库兹敦大学）
In a surprising recent work, Lemke Oliver and Soundararajan noticed how experimental data exhibits erratic distributions for consecutive pairs of primes in arithmetic progressions, and proposed a heuristic model based on the Hardy--Littlewood conjectures containing a large secondary term, which fits the data very well. In this paper, we study consecutive pairs of sums of squares in arithmetic progressions, and develop a similar heuristic model based on the Hardy--Littlewood conjecture for sums of squares, which also explain the biases in the experimental data. In the process, we prove several …
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 sums of exponential sums which resemble Kloosterman sums, going beyond what can be obtained by the Polya-Vinogradov completion method.
We show that the diophantine equation $n^\ell+(n+1)^\ell + ...+ (n+k)^\ell=(n+k+1)^\ell+ ...+ (n+2k)^\ell$ has no solutions in positive integers $k,n \ge 1$ for all $\ell \ge 3$.
We obtain several asymptotic formulas for the sum of the divisor function $τ(n)$ with $n \le x$ in an arithmetic progressions $n \equiv a \pmod q$ on average over $a$ from a set of several consecutive elements from set of reduced residues modulo $q$ and on average over arbitrary sets. The main goal is to obtain nontrivial results for $q \ge x^{2/3}$ with the small amount of averaging over $a$. We recall that for individual values of $a$ the limit of our current methods is $q \le x^{2/3-\varepsilon}$ for an arbitrary fixed $\varepsilon> 0$. Our method builds on an approach due to Blomer (2008) …
We give explicit numerical values with 100 decimal digits for the Mertens constant involved in the asymptotic formula for $\sum\limits_{\substack{p\leq x p\equiv a \bmod{q}}}1/p$ and, as a by-product, for the Meissel-Mertens constant defined as $\sum_{p\equiv a \bmod{q}} (\log(1-1/p)+1/p)$, for $q \in \{3$, ..., $100\}$ and $(q, a) = 1$.
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given explicitly in terms of partial Bell polynomials that depend on at most d-1 terms of the generalized Lucas sequence associated with the given recurrence. We also provide an elegant formula for the partial sums of such sequences and illustrate all of our results with examples of various orders, including common generalizations of the Fibonacci numbers.
We study the probabilistic behavior of sums of Fourier coefficients in arithmetic progressions. We prove a result analogous to previous work of Fouvry-Ganguly-Kowalski-Michel and Kowalski-Ricotta in the context of half-integral weight holomorphic cusp forms and for prime power modulus. We actually show that these sums follow in a suitable range a mixed Gaussian distribution which comes from the asymptotic mixed distribution of Salié sums.
We prove a bound for quintilinear sums of Kloosterman sums, with congruence conditions on the "smooth" summation variables. This generalizes classical work of Deshouillers and Iwaniec, and is key to obtaining power-saving error terms in applications, notably the dispersion method. As a consequence, assuming the Riemann hypothesis for Dirichlet $L$-functions, we prove a power-saving error term in the Titchmarsh divisor problem of estimating $\sum_{p\leq x}τ(p-1)$. Unconditionally, we isolate the possible contribution of Siegel zeroes, showing it is always negative. Extending work of Fouvry and …
Let $k \ge 2$ be even, and let $r$ be a non-zero integer. We show that for almost all $d \ge 2$ (in the sense of natural density), the equation $$ x^k+(x+r)^k+\cdots+(x+(d-1)r)^k=y^n, \qquad x,~y,~n \in \mathbb{Z}, \qquad n \ge 2, $$ has no solutions.
We compute the variances of sums in arithmetic progressions of arithmetic functions associated with certain $L$-functions of degree two and higher in $\mathbb{F}_q[t]$, in the limit as $q\to\infty$. This is achieved by establishing appropriate equidistribution results for the associated Frobenius conjugacy classes. The variances are thus related to matrix integrals, which may be evaluated. Our results differ significantly from those that hold in the case of degree-one $L$-functions (i.e. situations considered previously using this approach). They correspond to expressions found recently in the…
In this paper we consider the Diophantine equation \begin{align*}b^k +\left(a+b\right)^k &+ \cdots + \left(a\left(x-1\right) + b\right)^k=\\ &=d^l + \left(c+d\right)^l + \cdots + \left(c\left(y-1\right) + d\right)^l, \end{align*} where $a,b,c,d,k,l$ are given integers. We prove that, under some reasonable assumptions, this equation has only finitely many integer solutions.
Using only elementary arguments, Cassels and Uchiyama (independently) determined all squares that are sums of three consecutive cubes. Zhongfeng Zhang extended this result and determined all perfect powers that are sums of three consecutive cubes. Recently, the equation $(x-r)^k + x^k + (x+r)^k$ has been studied for $k=4$ by Zhongfeng Zhang and for $k=2$ by Koutsianas. In this paper, we complement the work of Cassels, Koutsianas and Zhang by considering the case when $k=3$ and showing that the equation $(x-r)^3+x^3+(x+r)^3=y^n$ with $n\geq 5$ a prime and $0 < r \leq 10^6$ only has trivial solu…
For $q$ prime, $X \geq 1$ and coprime $u,v \in \mathbb{N}$ we estimate the sums \begin{equation*} \sum_{\substack{p \leq X \substack p \equiv u \hspace{-0.25cm} \mod{v} p \text{ prime}}} \text{Kl}_2(p;q), \end{equation*} where $\text{Kl}_2(p;q)$ denotes a normalised Kloosterman sum with modulus $q$. This is a sparse analogue of a recent theorem due to Blomer, Fouvry, Kowalski, Michel and Milićević showing cancellation amongst sums of Kloosterman sums over primes in short intervals. We use an optimisation argument inspired by Fouvry, Kowalski and Michel. Our argument compares three different bo…
We present an elementary proof that if $A$ is a finite set of numbers, and the sumset $A+_GA$ is small, $|A+_GA|\leq c|A|$, along a dense graph $G$, then $A$ contains $k$-term arithmetic progressions.
Let $k$ be an arbitrary given positive integer and let $f(x)\in {\mathbb Z}[x]$ be a quadratic polynomial with $a$ and $D$ as its leading coefficient and discriminant, respectively. Associated to the least common multiple ${\rm lcm}_{0\le i\le k}\{f(n+i)\}$ of any $k+1$ consecutive terms in the quadratic progression $\{f(n)\}_{n\in \mathbb{N}^*}$, we define the function $g_{k, f}(n):=(\prod_{i=0}^{k}|f(n+i)|)/{\rm lcm}_{0\le i\le k}\{f(n+i)\}$ for all integers $n\in \mathbb{N}^*\setminus Z_{k, f}$, where $Z_{k,f}:=\bigcup_{i=0}^k\{n\in \mathbb{N}^*: f(n+i)=0\}$. In this paper, we first show th…
We study the surface arising from the diophantine equation $m^3+(m+1)^3+...+(m+k-1)^3=l^2$. It turns out that this is a $K3$ surface with Picard number 20. We stduy its aritmetic properties in detail. We construct elliptic fibrations on it, and we find a parametric solution to the original equation. Also, we determine the Hasse-Weil zeta function of the surface over $Q$.
In recent work, we considered the frequencies of patterns of consecutive primes $\pmod{q}$ and numerically found biases toward certain patterns and against others. We made a conjecture explaining these biases, the dominant factor in which permits an easy description but fails to distinguish many patterns that have seemingly very different frequencies. There was a secondary factor in our conjecture accounting for this additional variation, but it was given only by a complicated expression whose distribution was not easily understood. Here, we study this term, which proves to be connected to bot…
Consider the congruence class R_m(a)={a+im:i\in Z} and the infinite arithmetic progression P_m(a)={a+im:i\in N_0}. For positive integers a,b,c,d,m the sum of products set R_m(a)R_m(b)+R_m(c)R_m(d) consists of all integers of the form (a+im)(b+jm)+(c+km)(d+\ell m) for some i,j,k,\ell\in Z. It is proved that if gcd(a,b,c,d,m)=1, then R_m(a)R_m(b)+R_m(c)R_m(d) is equal to the congruence class R_m(ab+cd), and that the sum of products set P_m(a)P_m(b)+P_m(c)P_m(d) eventually coincides with the infinite arithmetic progression P_m(ab+cd).
In this paper, we determine all primitive solutions to the equation $(x+r)^2 +(x+2r)^2 +\cdots +(x+dr)^2 = y^n$ for $2\leq d\leq 10$ and for $1\leq r\leq 10^4$. We make use of a factorization argument and the Primitive Divisors Theorem due to Bilu, Hanrot and Voutier.
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 compute the variances of sums in arithmetic progressions of generalised k-divisor functions related to certain L-functions in $\mathbb{F}_q(t)$, in the limit as $q\to\infty$. This is achieved by making use of recently established equidistribution results for the associated Frobenius conjugacy classes. The variances are thus expressed, when $q\to\infty$, in terms of matrix integrals, which may be evaluated. Our results extend those obtained previously in the special case corresponding to the usual $k$-divisor function, when the L-function in question has degree one. They illustrate the role …
We prove upper bounds for the error term of the distribution of squarefree numbers up to $X$ in arithmetic progressions modulo $q$ making progress towards two well-known conjectures concerning this distribution and improving upon earlier results by Hooley. We make use of recent estimates for short exponential sums by Bourgain-Garaev and for exponential sums twisted by the Möbius function by Bourgain and Fouvry-Kowalski-Michel.
