Let $\gcd(k,j)$ denote the greatest common divisor of the integers $k$ and $j$, and let $r$ be any fixed positive integer. Define $$ M_r(x; f) := \sum_{k\leq x}\frac{1}{k^{r+1}}\sum_{j=1}^{k}j^{r}f(\gcd(j,k)) $$ for any large real number $x\geq 5$, where $f$ is any arithmetical function. Let $ϕ$, and $ψ$ denote the Euler totient and the Dedekind function, respectively. In this paper, we refine asymptotic expansions of $M_r(x; {\rm id})$, $M_r(x;ϕ)$ and $M_r(x;ψ)$. Furthermore, under the Riemann Hypothesis and the simplicity of zeros of the Riemann zeta-function, we establish the asymptotic formula of $M_r(x;{\rm id})$ for any large positive number $x>5$ satisfying $x=[x]+\frac{1}{2}$.
In this note we prove a new estimate on so-called GCD sums (also called Gál sums), which, for certain coefficients, improves significantly over the general bound due to de la Bretèche and Tenenbaum. We use our estimate to prove new results on the equidistribution of sequences modulo 1, improving over a result of Aistleitner, Larcher, and Lewko on how the metric poissonian property relates to the notion of additive energy. In particular, we show that arbitrary subsets of the squares are metric poissonian.
Let $\gcd(j,k)$ be the greatest common divisor of the integers $j$ and $k$. In this paper, we give several interesting asymptotic formulas for weighted averages of the $\gcd$-sum function $f(\gcd(j,k)) $ and the function $\sum_{d|k, d^{s}|j}(f*μ)(d) $ for any positive integers $j$ and $k$, namely $$ \sum_{k\leq x}\frac{1}{k^{r+1}}\sum_{j=1}^{k}j^{r}f(\gcd(j,k)) \quad \text{and} \quad \sum_{k\leq x}\frac{1}{k^{s(r+1)}}\sum_{j=1}^{k^s}j^{r} \sum_{\substack{d|k d^{s}|j}}(f*μ)(d), $$ with any fixed integer $s> 1$ and any arithmetical function $f$. We also establish mean value formulas for the erro…
Let $\gcd(k,j)$ be the greatest common divisor of the integers $k$ and $j$. For any arithmetical function $f$, we establish several asymptotic formulas for weighted averages of gcd-sum functions with weight concerning logarithms, that is $$\sum_{k\leq x}\frac{1}{k} \sum_{j=1}^{k}f(\gcd(k,j)) \log j.$$ More precisely, we give asymptotic formulas for various multiplicative functions such as $f=id$, $ϕ$, $id_{1+a}$ and $ϕ_{1+a}$ with $-1<a<0$. We also establish some formulas of Dirichlet series having coefficients of the sum function $\sum_{j=1}^{k}s_{k}(j)\log j$ where $s_{k}(j)$ is Anderson--Ap…
We use elementary arguments to prove results on the order of magnitude of certain sums concerning the gcd's and lcm's of $k$ positive integers, where $k\ge 2$ is fixed. We refine and generalize an asymptotic formula of Bordellès (2007), and extend certain related results of Hilberdink and Tóth (2016). We also formulate some conjectures and open problems.
We study the distribution of the generalized gcd and lcm functions on average. The generalized gcd function, denoted by $(m,n)_b$, is the largest $b$-th power divisor common to $m$ and $n$. Likewise, the generalized lcm function, denoted by $[m,n]_b$, is the smallest $b$-th power multiple common to $m$ and $n$. We derive asymptotic formulas for the average order of the arithmetic, geometric, and harmonic means of $(m,n)_b$. Additionally, we also deduce asymptotic formulas with error terms for the means of $(n_1,n_2,\cdots, n_k)_b$, and $[n_1,n_2,\cdots, n_k]_b$ over a set of lattice points, th…
We prove that \[ \sum_{k,{\ell}=1}^N\frac{(n_k,n_{\ell})^{2α}}{(n_k n_{\ell})^α} \ll N^{2-2α} (\log N)^{b(α)} \] holds for arbitrary integers $1\le n_1<\cdots < n_N$ and $0<α<1/2$ and show by an example that this bound is optimal, up to the precise value of the exponent $b(α)$. This estimate complements recent results for $1/2\le α\le 1$ and shows that there is no "trace" of the functional equation for the Riemann zeta function in estimates for such GCD sums when $0<α<1/2$.
We obtain asymptotic formulas with remainder terms for the hyperbolic summations $\sum_{mn\le x} f((m,n))$ and $\sum_{mn\le x} f([m,n])$, where $f$ belongs to certain classes of arithmetic functions, $(m,n)$ and $[m,n]$ denoting the gcd and lcm of the integers $m,n$. In particular, we investigate the functions $f(n)=τ(n), \log n, ω(n)$ and $Ω(n)$. We also define a common generalization of the latter three functions, and prove a corresponding result.
It is shown that the maximum of $|ζ(1/2+it)|$ on the interval $T^{1/2}\le t \le T$ is at least $\exp\left((1/\sqrt{2}+o(1)) \sqrt{\log T \log\log\log T/\log\log T}\right)$. Our proof uses Soundararajan's resonance method and a certain large GCD sum. The method of proof shows that the absolute constant $A$ in the inequality \[ \sup_{1\le n_1<\cdots < n_N} \sum_{k,{\ell}=1}^N\frac{\gcd(n_k,n_{\ell})}{\sqrt{n_k n_{\ell}}} \ll N \exp\left(A\sqrt{\frac{\log N \log\log\log N}{\log\log N}}\right), \] established in a recent paper of ours, cannot be taken smaller than $1$.
It is proved that \[ \sum_{k,{\ell}=1}^N\frac{\gcd(n_k,n_{\ell})}{\sqrt{n_k n_{\ell}}} \ll N\exp\left(C\sqrt{\frac{\log N \log\log\log N}{\log\log N}}\right) \] holds for arbitrary integers $1\le n_1<\cdots < n_N$. This bound is essentially better than that found in a recent paper of Aistleitner, Berkes, and Seip and can not be improved by more than possibly a power of $1/\sqrt{\log\log\log N}$. The proof relies on ideas from classical work of Gál, the method of Aistleitner, Berkes, and Seip, and a certain completeness property of extremal sets of square-free numbers.
In this paper, we establish the following two identities involving the Gamma function and Bernoulli polynomials, namely $$ \sum_{k\leq x}\frac{1}{k^s} \sum_{j=1}^{k^s}\logΓ\left(\frac{j}{k^s}\right) \sum_{\substack{d|k \\ d^{s}|j}}f*μ(d) \quad {\rm and } \quad \sum_{k\leq x}\frac{1}{k^s}\sum_{j=0}^{k^{s}-1} B_{m}\sum_{\substack{d|k \\ d^{s}|j}} f*μ(d) $$ with any fixed integer $s> 1$ and any arithmetical function $f$. We give asymptotic formulas for them with various multiplicative functions $f$. We also consider several formulas of the Dirichlet series associated with the above identities. Th…
For a nonempty finite set $A$ of positive integers, let $\gcd\left(A\right)$ denote the greatest common divisor of the elements of $A$. Let $f\left(n\right)$ and $Φ\left(n\right)$ denote, respectively, the number of subsets $A$ of $\left\{1, 2, \ldots, n\right\}$ such that $\gcd\left(A\right) = 1$ and the number of subsets $A$ of $\left\{1, 2, \ldots, n\right\}$ such that $\gcd\left(A\cup\left\{n\right\}\right) =1$. Let $D\left(n\right)$ be the divisor sum of $f\left(n\right)$. In this article, we obtain partial sums of $f\left(n\right)$, $Φ\left(n\right)$ and $D\left(n\right)$. We also obtain…
We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these established expansions generating sums of the form $\sum_{d: (d,n)=1} f(d)$ (type I) and the Anderson-Apostol sums $\sum_{d|(m,n)} f(d) g(n/d)$ (type II) for any arithmetic functions $f$ and $g$. Our treatment of the type II sums includes a matrix-based factorization method relating the partition function $p(n)$ to arbitrary arithmetic functions $f$. We also conclude…
In 2021, Guyer and Mbirika gave two equivalent formulas that computed the greatest common divisor (GCD) of all sums of $k$ consecutive terms in the generalized Fibonacci sequence $\left(G_n\right)_{n \geq 0}$ given by the recurrence $G_n = G_{n-1} + G_{n-2}$ for all $n \geq 2$ with integral initial conditions $G_0$ and $G_1$. In this current paper, we extend their results to the GCD of all sums of $k$ consecutive squares of these numbers. Denoting these GCD values by the symbol $\mathcal{G}_{G_0, G_1}^2\!(k)$, we prove $\mathcal{G}_{G_0, G_1}^2\!(k) = \gcd\left(G_k G_{k+1} - G_0 G_1,\; G_{k+1}…
Using GCD sums, we show that the set of the primes has small common multiplicative energy with an arbitrary exponentially big integer set $S$ and, in particular, size of any arithmetic progression in $S$ having the beginning at zero, is at most $O(\log |S| \cdot \log \log |S|)$. This result can be considered as an integer analogue of Vinogradov's question about the least quadratic non--residue. The proof rests on a certain repulsion property of the function $f(x)=\log x$. Also, we consider the case of general $k$--convex functions $f$ and obtain a new incidence result for collections of the cu…
In recent years the question of maximizing GCD sums regained interest due to its firm link with large values of $L$-functions. In the present paper we initiate the study of minimizing for positive weights~$w$ of normalized $L^1$- norm the sum $\sum_{m_1 , m_2 \leqslant N} w({m_1})w({m_2})\frac{(m_1,m_2)}{\sqrt{m_1m_2}} $. We consider as well the intertwined question of minimizing a weighted version of the usual multiplicative energy. We give three applications of our results. Firstly we obtain a logarithmic refinement of Burgess' bound on character sums $\displaystyle{\sum_{M<n\leqslant M+N}χ(…
We explore the sums of $k$ consecutive terms in the generalized Fibonacci sequence $\left(G_n\right)_{n \geq 0}$ given by the recurrence $G_n = G_{n-1} + G_{n-2}$ for all $n \geq 2$ with integral initial conditions $G_0$ and $G_1$. In particular, we give precise values for the greatest common divisor (GCD) of all sums of $k$ consecutive terms of $\left(G_n\right)_{n \geq 0}$. When $G_0 = 0$ and $G_1 = 1$, we yield the GCD of all sums of $k$ consecutive Fibonacci numbers, and when $G_0 = 2$ and $G_1 = 1$, we yield the GCD of all sums of $k$ consecutive Lucas numbers. Denoting the GCD of all sum…
Upper bounds for GCD sums of the form [\sum_{k,{\ell}=1}^N\frac{(\gcd(n_k,n_{\ell}))^{2α}}{(n_k n_{\ell})^α}] are proved, where $(n_k)_{1 \leq k \leq N}$ is any sequence of distinct positive integers and $0<α\le 1$; the estimate for $α=1/2$ solves in particular a problem of Dyer and Harman from 1986, and the estimates are optimal except possibly for $α=1/2$. The method of proof is based on identifying the sum as a certain Poisson integral on a polydisc; as a byproduct, estimates for the largest eigenvalues of the associated GCD matrices are also found. The bounds for such GCD sums are used to …
In a paper in the American Mathematical Monthly, the corresponding author asks for an asymptotic of a gcd-sum function \begin{align}\sum_{ab\leq N}τ(\gcd(a,b))\label{eqn:taugcdsum}\end{align} We extensively study generalizations of the sum in the aforementioned paper and establish asymptotic results using elementary methods only.
Let $\gcd(d_{1},\ldots,d_{k})$ be the greatest common divisor of the positive integers $d_{1},\ldots,d_{k}$, for any integer $k\geq 2$, and let $τ$ and $μ$ denote the divisor function and the Möbius function, respectively. For an arbitrary arithmetic function $g$ and for any real number $x>5$ and any integer $k\geq 3$, we define the sum $$ S_{g,k}(x) :=\sum_{n\leq x}\sum_{d_{1}\cdots d_{k}=n} g(\gcd(d_{1},\ldots,d_{k})) $$ In this paper, we give asymptotic formulas for $S_{τ,k}(x)$ and $S_{μ,k}(x)$ for $k\geq 3$.
The explicit formulas for the sums of positive powers of the integers $s_i$ unrepresentable by the triple of integers $d_1,d_2,d_3\in {\mathbb N}, \gcd(d_1,d_2,d_3)=1$, are derived.
Menon's identity is a classical identity involving gcd sums and the Euler totient function $ϕ$. In a recent paper, Zhao and Cao derived the Menon-type identity $\sum\limits_{\substack{k=1}}^{n}(k-1,n)χ(k) = ϕ(n)τ(\frac{n}{d})$, where $χ$ is a Dirichlet character mod $n$ with conductor $d$. We derive an identity similar to this replacing gcd with a generalization it. We also show that some of the arguments used in the derivation of Zhao-Cao identity can be improved if one uses the method we employ here.
We investigate an arithmetic function representing a generalization of the gcd-sum function, considered by Kurokawa and Ochiai in 2009 in connection with the multivariable global Igusa zeta function for a finite cyclic group. We show that the asymptotic properties of this function are closely connected to the Piltz divisor function. A generalization of Menon's identity is also considered.
We give a simple proof and a multivariable generalization of an identity due to E. Alkan concerning a weighted average of the Ramanujan sums. We deduce identities for other weighted averages of the Ramanujan sums with weights concerning logarithms, values of arithmetic functions for gcd's, the Gamma function, the Bernoulli polynomials, and binomial coefficients.
Let $q$ be a positive integer, $χ$ a nontrivial character mod $q$, $\mathcal{I}$ an interval of length not exceeding $q.$ In this paper we shall study the character sum analogue of the well-known Kloosterman sum,\[\sum_{\substack{a\in\mathcal{I} \gcd(a,q)=1}}χ(ma+n\overline{a}),\] where $\overline{a}$ is the multiplicative inverse of $a\bmod q$. The mean square values and bilinear forms for such sums are proved.
For the Gauss sums which are defined by S_n(a,q) := \sum_{x (mod q)} e(ax^n/q), Stechkin (1975) conjectured that the quantity A := \sup_{n,q\ge 2} \max_{\gcd(a,q)=1} |S_n(a,q)|/q^(1-1/n) is finite. Shparlinski (1991) proved that A is finite, but in the absence of effective bounds on the sums S_n(a,q) the precise determination of A has remained intractable for many years. Using recent work of Cochrane and Pinner (2011) on Gauss sums with prime moduli, in this paper we show that with the constant given by A = |S_6(4787,4606056)|/4606056^(5/6) = 4.709236... one has the sharp inequality |S_n(a,q)|…
Let $q$ be an integer $\geq 2$ and let $S_q(n)$ denote the sum of digits of $n$ in base $q$. For \[ α=[0;\overline{1,m}],\ m\geq 2, \] let $S_α(n)$ denote the sum of digits in the Ostrowski $α$-representation of $n$. Let $m_1,m_2\geq 2$ be integers with $$\gcd(q-1,m_1)=\gcd(m,m_2)=1.$$ We prove that there exists $δ>0$ such that for all integers $a_1,a_2$, \begin{eqnarray*} &&|\{0\leq n<N: S_{q}(n)\equiv a_1\pmod{m_1},\ S_α(n)\equiv a_2\pmod{m_2}\}| &=&\frac{N}{m_1m_2}+O(N^{1-δ}). \end{eqnarray*} The asymptotic relation implied by this equality was proved by Coquet, Rhin & Toffin and the equali…
We present an explicit evaluation of the double Gauss sum $\displaystyle G(a,b,c;S;p^n):=\sum_{x,y=0}^{p^n-1} e^{2πi S(ax^2+bxy+cy^2)/p^n}$, where $a, b, c$ are integers such that $\gcd(a,b,c)=1$, $p$ is a prime, $n$ is a positive integer, and $S$ is an integer coprime to $p$.
Let $n\ge 1, e\ge 1, k\ge 2$ and $c$ be integers. An integer $u$ is called a unit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(u, n)=1$. A unit $u$ is called an exceptional unit in the ring $\mathbb{Z}_n$ if $\gcd(1-u,n)=1$. We denote by $\mathcal{N}_{k,c,e}(n)$ the number of solutions $(x_1,...,x_k)$ of the congruence $x_1^e+...+x_k^e\equiv c \pmod n$ with all $x_i$ being exceptional units in the ring $\mathbb{Z}_n$. In 2017, Mollahajiaghaei presented a formula for the number of solutions $(x_1,...,x_k)$ of the congruence $x_1^2+...+x_k^2\equiv c\pmod n$ with all $x_i$ be…
If $k$ is a sufficiently large positive integer, we show that the Diophantine equation $$n (n+d) \cdots (n+ (k-1)d) = y^{\ell}$$ has at most finitely many solutions in positive integers $n, d, y$ and $\ell$, with $\operatorname{gcd}(n,d)=1$ and $\ell \geq 2$. Our proof relies upon Frey-Hellegouarch curves and results on supersingular primes for elliptic curves without complex multiplication, derived from upper bounds for short character sums and sieves, analytic and combinatorial.
Let $S(a,b)$ denote the normalized Dedekind sum. We study the range of possible values for $S(a,b)=\frac{k}{q}$ with $\gcd(k,q)=1$. Girstmair proved local restrictions on $k$ depending on $q\pmod{12}$ and whether $q$ is a square and conjectured that these are the only restrictions possible. We verify the conjecture in the cases $q$ even, $q$ a square divisible by $3$ or $5$, and $2\le q\le 200$ (the latter by computer), and provide progress towards a general approach.
Menon's identity is a classical identity involving gcd sums and the Euler totient function $ϕ$. A natural generalization of $ϕ$ is the Klee's function $Φ_s$. In this paper we derive a Menon-type identity using Klee's function and a generalization of the gcd function. This identity generalizes an identity given by Lee and Kim in [\textit{J. Number Theory 175, 42--50(2017)}].
We compute the "moments" and its continuous analogue of the random variable $\N \ni l \mapsto \gcd(l,n_1) \gcd(l, n_2) ... \gcd(l, n_k) \in \N$ by a purely elementary method. This generalizes a result of Deitmar-Koyama-Kurokawa, which computed its "average" using some analysis involving L-function. We show this average is nothing but the invariant $μ(A) := \sum_{a\in A} \frac{1}{| a |}$ for a finite abelian group $A = \prod_{j=1)^k Z/n_j$. In ArXiv-0910.3879v1, this invariant plays an important role in the Soulé type zeta functions for Noetherian $F_1$-schemes in the sense of Connes-Consani.
We deduce asymptotic formulas for the alternating sums $\sum_{n\le x} (-1)^{n-1} f(n)$ and $\sum_{n\le x} (-1)^{n-1} \frac1{f(n)}$, where $f$ is one of the following classical multiplicative arithmetic functions: Euler's totient function, the Dedekind function, the sum-of-divisors function, the divisor function, the gcd-sum function. We also consider analogs of these functions, which are associated to unitary and exponential divisors, and other special functions. Some of our results improve the error terms obtained by Bordellès and Cloitre. We formulate certain open problems.
Let $p$ be a large prime number and $g$ be any integer of multiplicative order $T$ modulo $p$. We obtain a new estimate of the double exponential sum $$ S=\sum_{n\in \mathcal{N}}\left|\sum_{m\in \mathcal{M} }e_p(an g^{m})\right|, \quad \gcd (a,p)=1, $$ where $\mathcal{N}$ and $\mathcal{M}$ are intervals of consecutive integers with $|\mathcal{N}|=N$ and $|\mathcal{M}|=M<T$ elements. One representative example is the following consequence of the main result: if $N=M\approx p^{1/3}$, then $|S|< N^{2-1/8 + o(1)}$. We then apply our estimate to obtain new results on additive congruences involving …
Let $p$ be a prime number, $q=p^f$ for some positive integer $f$, $N$ be a positive integer such that $\gcd(N,p)=1$, and let $\k$ be a primitive multiplicative character of order $N$ over finite field $\fq$. This paper studies the problem of explicit evaluation of Gauss sums in "\textsl{index 2 case}" (i.e. $f=\f{\p(N)}{2}=[\zn:\pp]$, where $\p(\cd)$ is Euler function). Firstly, the classification of the Gauss sums in index 2 case is presented. Then, the explicit evaluation of Gauss sums $G(\k^\la) (1\laN-1)$ in index 2 case with order $N$ being general even integer (i.e. $N=2^{r}\cd N_0$ wher…
We establish a connection between the $L^2$ norm of sums of dilated functions whose $j$th Fourier coefficients are $\mathcal{O}(j^{-α})$ for some $α\in (1/2,1)$, and the spectral norms of certain greatest common divisor (GCD) matrices. Utilizing recent bounds for these spectral norms, we obtain sharp conditions for the convergence in $L^2$ and for the almost everywhere convergence of series of dilated functions.
In this paper we mainly study sums of four rational squares with certain restrictions. Let $\mathbb Q_{\ge0}$ be the set of nonnegative rational numbers. We establish the following four-square theorem for rational numbers: For any $a,b,c,d\in\mathbb Q_{\ge0}$, each $r\in\mathbb Q_{\ge0}$ can be written as $x^2+y^2+z^2+w^2$ with $x,y,z,w\in\mathbb Q_{\ge0}$ such that $ax+by+cz+dw$ is a rational square (or a rational cube). This paper also contains many conjectures; for example, for any positive integers $a$ and $b$ with $\gcd(a,b)=1$, we conjecture that each $r\in\mathbb Q_{\ge0}$ can be writte…
We obtain asymptotic formulas for the sums $\sum_{n_1,\ldots,n_k\le x} f((n_1,\ldots,n_k))$ and $ \sum_{n_1,\ldots,n_k\le x} f([n_1,\ldots,n_k])$ involving the gcd and lcm of the integers $n_1,\ldots,n_k$, where $f$ belongs to certain classes of additive arithmetic functions. In particular, we consider the generalized omega function $Ω_{\ell}(n)= \sum_{p^ν\mid\mid n} ν^{\ell}$ investigated by Duncan (1962) and Hassani (2018), and the functions $A(n)=\sum_{p^ν\mid\mid n} νp$, $A^*(n)= \sum_{p \mid n} p$, $B(n)=A(n)-A^*(n)$ studied by Alladi and Erdős (1977). As a key auxiliary result we use an …
For a prime $p$ and an integer $u$ with $\gcd(u,p)=1$, we define Fermat quotients by the conditions $$ q_p(u) \equiv \frac{u^{p-1} -1}{p} \pmod p, \qquad 0 \le q_p(u) \le p-1. $$ D. R. Heath-Brown has given a bound of exponential sums with $N$ consecutive Fermat quotients that is nontrivial for $N\ge p^{1/2+ε}$ for any fixed $ε>0$. We use a recent idea of M. Z. Garaev together with a form of the large sieve inequality due to S. Baier and L. Zhao, to show that on average over $p$ one can obtain a nontrivial estimate for much shorter sums starting with $N\ge p^ε$. We also obtain lower bounds on …
We give a complete and elementary proofs of "Jordan's sums" and study Euler's types sums. In particular we give a formula for the sum of series with same weight, which is similar to this one of classical 2-Euler's sums.
Let $c_q(n)$ be the Ramanujan sums and let $S(m,n;q)$ be the Kloosterman sums. We study the eigenvalues of $q \times q$ matrices whose $(m,n)$ entry is $c_q (m-n)$ or $S(m,n;q)$ where $q$ is a fixed positive integer. We also study the eigenvalues of matrices whose entries are sums of Ramanujan sums or sums of Kloosterman sums.
In this paper, we present several explicit formulas of the sums and hyper-sums of the powers of the first (n+1)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials.
Let $c_q(n)$ denote the Ramanujan sum modulo $q$, and let $x$ and $y$ be large reals, with $x = o(y)$. We obtain asymptotic formulas for the sums $$\sum_{n \le y}(\sum_{q \le x} c_q(n))^k \qquad (k = 1, 2).$$
Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be the minimum of $(n_1+\cdots+n_l)/\ord(g)$ over all possible $g\in G$ such that $\langle g \rangle =G$. A conjecture on the index of length four sequences says that every minimal zero-sum sequence of length 4 over a finite cyclic group $G$ with $\gcd(|G|, 6)=1$ has index 1. The conjecture was confirmed recently for the case when $|G|$ is a product of at most two prime powers…
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).
Let~$A$ be a set of nonnegative integers. Let~$(h A)^{(t)}$ be the set of all integers in the sumset~$hA$ that have at least~$t$ representations as a sum of~$h$ elements of~$A$. In this paper, we prove that, if~$k \geq 2$, and~$A=\left\{a_{0}, a_{1}, \ldots, a_{k}\right\}$ is a finite set of integers such that~$0=a_{0}<a_{1}<\cdots<a_{k}$ and $\gcd\left(a_{1}, a_2,\ldots, a_{k}\right)=1,$ then there exist integers ~$c_{t},d_{t}$ and sets~$C_{t}\subseteq[0, c_{t}-2]$, $D_{t} \subseteq[0, d_{t}-2]$ such that $$(h A)^{(t)}=C_{t} \cup\left[c_{t}, h a_{k}-d_{t}\right] \cup\left(h a_{k-1}-D_{t}\righ…
The Menon-Sury's identity is as follows: \begin{equation*} \sum_{\substack{1 \leq a, b_1, b_2, \ldots, b_r \leq n\\\mathrm{gcd}(a,n)=1}} \mathrm{gcd}(a-1,b_1, b_2, \ldots, b_r,n)=φ(n) σ_r(n), \end{equation*} where $φ$ is Euler's totient function and $σ_r(n)=\sum_{d\mid n}{d^r}$. Recently, Li, Hu and Kim \cite{L-K} extended the above identity to a multi-variable case with a Dirichlet character, that is, they proved \begin{equation*} \sum_{\substack{a\in\Bbb Z_n^\ast \\ b_1, \ldots, b_r\in\Bbb Z_n}} \mathrm{gcd}(a-1,b_1, b_2, \ldots, b_r,n)χ(a)=φ(n)σ_r{\left(\frac{n}{d}\right)}, \end{equation*} …
The Ramanujan sum $c_n(k)$ is defined as the sum of $k$-th powers of the primitive $n$-th roots of unity. We investigate arithmetic functions of $r$ variables defined as certain sums of the products $c_{m_1}(g_1(k))...c_{m_r}(g_r(k))$, where $g_1,..., g_r$ are polynomials with integer coefficients. A modified orthogonality relation of the Ramanujan sums is also derived.
In this paper, we investigate the distribution of the maximum of partial sums of families of $m$-periodic complex valued functions satisfying certain conditions. We obtain precise uniform estimates for the distribution function of this maximum in a near optimal range. Our results apply to partial sums of Kloosterman sums and other families of $\ell$-adic trace functions, and are as strong as those obtained by Bober, Goldmakher, Granville and Koukoulopoulos for character sums. In particular, we improve on the recent work of the third author for Birch sums. However, unlike character sums, we are…
A formula of Kuznetsov allows one to interpret a smooth sum of Kloosterman sums as a sum over the spectrum of $GL(2)$ automorphic forms. In this paper, we construct a similar formula for the first hyper-Kloosterman sums using $GL(3)$ automorphic forms, resolving a long-standing problem of Bump, Friedberg and Goldfeld. Along the way, we develop what are apparently new bounds for the order derivatives of the classical $J$-Bessel function, and we conclude with a discussion of the original method of Bump, Friedberg and Goldfeld.
We give a simple proof of a well-known theorem of Gál and of the recent related results of Aistleitner, Berkes and Seip [1] regarding the size of GCD sums. In fact, our method obtains the asymptotically sharp constant in Gál's theorem, which is new. Our approach also gives a transparent explanation of the relationship between the maximal size of the Riemann zeta function on vertical lines and bounds on GCD sums; a point which was previously unclear. Furthermore we obtain sharp bounds on the spectral norm of GCD matrices which settles a question raised in [2]. We use bounds for the spectral nor…
