Ramanujan Sum

In number theory, Ramanujan's sum, usually denoted ''c_q''(''n''), is a function of two positive integer variables ''q'' and ''n'' defined by the formula

: $c_q(n) = \sum_ e^,$

where (''a'', ''q'') = 1 means that ''a'' only takes on values coprime to ''q''.

Srinivasa Ramanujan mentioned the sums in a 1918 paper. In addition to the expansions discussed in this article, Ramanujan's sums are used in the proof of Vinogradov's theorem that every sufficiently large odd number is the sum of three primes.

Notation

For integers ''a'' and ''b'', $a\mid b$ is read "''a'' divides ''b''" and means that there is an integer ''c'' such that $\frac b a = c.$ Similarly, $a\nmid b$ is read "''a'' does not divide ''b''". The summation symbol

:$\sum_f(d)$

means that ''d'' goes through all the positive divisors of ''m'', e.g.

:$\sum_f(d) = f(1) + f(2) + f(3) + f(4) + f(6) + f(12).$

$(a,\,b)$ is the greatest common divisor,

$\phi(n)$ is Euler's totient function,

$\mu(n)$ is the Möbius function, and

$\zeta(s)$ is the Riemann zeta function.

Formulas for ''c''_''q''(''n'')

Trigonometry

These formulas come from the definition, Euler's formula $e^= \cos x + i \sin x,$ and elementary trigonometric identities.

:$\begin c_1(n) &= 1 \\ c_2(n) &= \cos n\pi \\ c_3(n) &= 2\cos \tfrac23 n\pi \\ c_4(n) &= 2\cos \tfrac12 n\pi \\ c_5(n) &= 2\cos \tfrac25 n\pi + 2\cos \tfrac45 n\pi \\ c_6(n) &= 2\cos \tfrac13 n\pi \\ c_7(n) &= 2\cos \tfrac27 n\pi + 2\cos \tfrac47 n\pi + 2\cos \tfrac67 n\pi \\ c_8(n) &= 2\cos \tfrac14 n\pi + 2\cos \tfrac34 n\pi \\ c_9(n) &= 2\cos \tfrac29 n\pi + 2\cos \tfrac49 n\pi + 2\cos \tfrac89 n\pi \\ c_(n)&= 2\cos \tfrac15 n\pi + 2\cos \tfrac35 n\pi \\ \end$

and so on (, , , ,.., ,...). ''c_q''(''n'') is always an integer.

Kluyver

Let $\zeta_q=e^.$ Then is a root of the equation . Each of its powers,

:$\zeta_q, \zeta_q^2, \ldots, \zeta_q^, \zeta_q^q = \zeta_q^0 =1$

is also a root. Therefore, since there are ''q'' of them, they are all of the roots. The numbers $\zeta_q^n$ where 1 ≤ ''n'' ≤ ''q'' are called the ''q''-th roots of unity. is called a primitive ''q''-th root of unity because the smallest value of ''n'' that makes $\zeta_q^n =1$ is ''q''. The other primitive ''q''-th roots of unity are the numbers $\zeta_q^a$ where (''a'', ''q'') = 1. Therefore, there are φ(''q'') primitive ''q''-th roots of unity.

Thus, the Ramanujan sum ''c_q''(''n'') is the sum of the ''n''-th powers of the primitive ''q''-th roots of unity.

It is a fact that the powers of are precisely the primitive roots for all the divisors of ''q''.

Example. Let ''q'' = 12. Then

:$\zeta_, \zeta_^5, \zeta_^7,$ and $\zeta_^$ are the primitive twelfth roots of unity,

:$\zeta_^2$ and $\zeta_^$ are the primitive sixth roots of unity,

:$\zeta_^3 = i$ and $\zeta_^9 = -i$ are the primitive fourth roots of unity,

:$\zeta_^4$ and $\zeta_^8$ are the primitive third roots of unity,

:$\zeta_^6 = -1$ is the primitive second root of unity, and

:$\zeta_^ = 1$ is the primitive first root of unity.

Therefore, if

:$\eta_q(n) = \sum_^q \zeta_q^$

is the sum of the ''n''-th powers of all the roots, primitive and imprimitive,

:$\eta_q(n) = \sum_ c_d(n),$

and by Möbius inversion,

:$c_q(n) = \sum_ \mu\left(\fracd\right)\eta_d(n).$

It follows from the identity ''x''^''q'' − 1 = (''x'' − 1)(''x''^{''q''−1} + ''x''^{''q''−2} + ... + ''x'' + 1) that

:$\eta_q(n) = \begin 0 & q\nmid n\\ q & q\mid n\\ \end$

and this leads to the formula

:$c_q(n)=\sum_ \mu\left(\frac\right) d,$

published by Kluyver in 1906.

This shows that ''c''_''q''(''n'') is always an integer. Compare it with the formula

:$\phi(q)=\sum_\mu\left(\frac\right) d.$

von Sterneck

It is easily shown from the definition that ''c''_''q''(''n'') is multiplicative when considered as a function of ''q'' for a fixed value of ''n'':Schwarz & Spilken (1994) p.16 i.e.

:$\mbox \;(q,r) = 1 \;\mbox\; c_q(n)c_r(n)=c_(n).$

From the definition (or Kluyver's formula) it is straightforward to prove that, if ''p'' is a prime number,

:$c_p(n) = \begin -1 &\mboxp\nmid n\\ \phi(p)&\mboxp\mid n\\ \end ,$

and if ''p''^''k'' is a prime power where ''k'' > 1,

:$c_(n) = \begin 0 &\mboxp^\nmid n\\ -p^ &\mboxp^\mid n \mboxp^k\nmid n\\ \phi(p^k) &\mboxp^k\mid n\\ \end .$

This result and the multiplicative property can be used to prove

:$c_q(n)= \mu\left(\frac\right)\frac.$

This is called von Sterneck's arithmetic function. The equivalence of it and Ramanujan's sum is due to Hölder.

Other properties of ''c''_''q''(''n'')

For all positive integers ''q'',

:$\begin c_1(q) &= 1 \\ c_q(1) &= \mu(q) \\ c_q(q) &= \phi(q) \\ c_q(m) &= c_q(n) && \text m \equiv n \pmod q \\ \end$

For a fixed value of ''q'' the absolute value of the sequence $\$ is bounded by φ(''q''), and for a fixed value of ''n'' the absolute value of the sequence $\$ is bounded by ''n''.

If ''q'' > 1

:$\sum_^ c_q(n)=0.$

Let ''m''₁, ''m''₂ > 0, ''m'' = lcm(''m''₁, ''m''₂). Then Ramanujan's sums satisfy an orthogonality property:

:$\frac\sum_^m c_(k) c_(k) = \begin \phi(m) & m_1=m_2=m,\\ 0 & \text \end$

Let ''n'', ''k'' > 0. Then

:$\sum_\stackrel d\;\frac =\frac,$

known as the Brauer - Rademacher identity.

If ''n'' > 0 and ''a'' is any integer, we also have

:$\sum_\stackrel c_n(k-a) = \mu(n)c_n(a),$

due to Cohen.

Table

Ramanujan expansions

If ''f''(''n'') is an arithmetic function (i.e. a complex-valued function of the integers or natural numbers), then a convergent infinite series of the form:

:$f(n)=\sum_^\infty a_q c_q(n)$

or of the form:

:$f(q)=\sum_^\infty a_n c_q(n)$

where the , is called a Ramanujan expansion of ''f''(''n'').

Ramanujan found expansions of some of the well-known functions of number theory. All of these results are proved in an "elementary" manner (i.e. only using formal manipulations of series and the simplest results about convergence).

The expansion of the zero function depends on a result from the analytic theory of prime numbers, namely that the series

:$\sum_^\infty\frac$

converges to 0, and the results for ''r''(''n'') and ''r''′(''n'') depend on theorems in an earlier paper.

All the formulas in this section are from Ramanujan's 1918 paper.

Generating functions

The generating functions of the Ramanujan sums are Dirichlet series:

:$\zeta(s) \sum_ \mu\left(\frac\right) \delta^ = \sum_^\infty \frac$

is a generating function for the sequence ''c_q''(1), ''c_q''(2), ... where ''q'' is kept constant, and

:$\frac= \sum_^\infty \frac$

is a generating function for the sequence ''c''₁(''n''), ''c''₂(''n''), ... where ''n'' is kept constant.

There is also the double Dirichlet series

:$\frac= \sum_^\infty \sum_^\infty \frac.$

σ_''k''(''n'')

σ_''k''(''n'') is the divisor function (i.e. the sum of the ''k''-th powers of the divisors of ''n'', including 1 and ''n''). σ₀(''n''), the number of divisors of ''n'', is usually written ''d''(''n'') and σ₁(''n''), the sum of the divisors of ''n'', is usually written σ(''n'').

If ''s'' > 0,

:$\begin \sigma_s(n) &= n^s \zeta(s+1) \left(\frac+ \frac+ \frac+\cdots\right) \\ \sigma_(n) &=\zeta(s+1)\left(\frac+\frac+\frac+\cdots\right) \end$

Setting ''s'' = 1 gives

:$\sigma(n)= \fracn \left(\frac+ \frac+ \frac+ \cdots \right).$

If the Riemann hypothesis is true, and -\tfrac12

:$\sigma_s(n) = \zeta(1-s) \left(\frac+ \frac+ \frac+ \cdots \right) = n^s \zeta(1+s) \left( \frac+ \frac+ \frac+ \cdots \right).$

''d''(''n'')

''d''(''n'') = σ₀(''n'') is the number of divisors of ''n'', including 1 and ''n'' itself.

:$\begin -d(n) &= \fracc_1(n)+ \fracc_2(n)+ \fracc_3(n)+ \cdots \\ -d(n)(2\gamma+\log n) &= \fracc_1(n)+ \fracc_2(n)+ \fracc_3(n)+ \cdots \end$

where γ = 0.5772... is the Euler–Mascheroni constant.

''φ''(''n'')

Euler's totient function φ(''n'') is the number of positive integers less than ''n'' and coprime to ''n''. Ramanujan defines a generalization of it, if

:$n=p_1^p_2^p_3^\cdots$

is the prime factorization of ''n'', and ''s'' is a complex number, let

:$\varphi_s(n)=n^s(1-p_1^)(1-p_2^)(1-p_3^)\cdots,$

so that ''φ''₁(''n'') = ''φ''(''n'') is Euler's function.

He proves that

:$\frac= \sum_^\infty \frac$

and uses this to show that

:$\frac=\frac+\frac+\frac+\cdots.$

Letting ''s'' = 1,

:$\varphi(n) = \fracn \left(c_1(n) -\frac -\frac -\frac+\frac - \frac +\frac -\cdots \right).$

Note that the constant is the inverse of the one in the formula for σ(''n'').

Λ(''n'')

Von Mangoldt's function unless ''n'' = ''p^k'' is a power of a prime number, in which case it is the natural logarithm log ''p''.

:$-\Lambda(m) = c_m(1)+ \frac c_m(2)+ \frac13c_m(3)+\cdots$

Zero

For all ''n'' > 0,

:$0= c_1(n)+ \frac12c_2(n)+ \frac13c_3(n)+ \cdots.$

This is equivalent to the prime number theorem.

''r''_2''s''(''n'') (sums of squares)

''r''_2''s''(''n'') is the number of way of representing ''n'' as the sum of 2''s'' squares, counting different orders and signs as different (e.g., ''r''₂(13) = 8, as 13 = (±2)² + (±3)² = (±3)² + (±2)².)

Ramanujan defines a function δ_2''s''(''n'') and references a paperRamanujan, ''On Certain Arithmetical Functions'' in which he proved that ''r''_2''s''(''n'') = δ_2''s''(''n'') for ''s'' = 1, 2, 3, and 4. For ''s'' > 4 he shows that δ_2''s''(''n'') is a good approximation to ''r''_2''s''(''n'').

''s'' = 1 has a special formula:

:$\delta_2(n)= \pi \left(\frac- \frac+ \frac- \cdots \right).$

In the following formulas the signs repeat with a period of 4.

:\begin
\delta_(n) &= \frac \left( \frac+ \frac+ \frac+\frac+ \frac+ \frac+ \frac+ \frac+ \cdots \right) && s \equiv 0 \pmod 4 \\ pt\delta_(n) &= \frac \left( \frac- \frac+ \frac- \frac+ \frac- \frac+ \frac- \frac+ \cdots \right) && s \equiv 2 \pmod 4 \\ pt\delta_(n) &= \frac \left( \frac+ \frac- \frac+ \frac+ \frac+ \frac- \frac+ \frac+ \cdots \right) && s \equiv 1 \pmod 4 \text s > 1 \\ pt\delta_(n) &= \frac \left(\frac- \frac- \frac- \frac+ \frac-\frac-\frac-\frac+ \cdots \right) && s \equiv 3 \pmod 4 \\
\end

and therefore,

:\begin
r_2(n) &= \pi \left(\frac- \frac+ \frac- \frac+ \frac-\frac+ \frac - \frac + \cdots \right) \\ ptr_4(n) &= \pi^2 n \left( \frac- \frac+ \frac- \frac+ \frac- \frac+ \frac- \frac+ \cdots \right) \\ ptr_6(n) &= \frac \left( \frac- \frac- \frac- \frac+ \frac- \frac- \frac - \frac+ \cdots \right) \\ ptr_8(n) &= \frac \left(\frac+ \frac+ \frac+ \frac+ \frac+ \frac+ \frac+ \frac+ \cdots \right)
\end

$r'_(n)$ (sums of triangles)

$r'_(n)$ is the number of ways ''n'' can be represented as the sum of 2''s'' triangular numbers (i.e. the numbers 1, 3 = 1 + 2, 6 = 1 + 2 + 3, 10 = 1 + 2 + 3 + 4, 15, ...; the ''n''-th triangular number is given by the formula ''n''(''n'' + 1)/2.)

The analysis here is similar to that for squares. Ramanujan refers to the same paper as he did for the squares, where he showed that there is a function $\delta'_(n)$ such that $r'_(n) = \delta'_(n)$ for ''s'' = 1, 2, 3, and 4, and that for ''s'' > 4, $\delta'_(n)$ is a good approximation to $r'_(n).$

Again, ''s'' = 1 requires a special formula:

:$\delta'_2(n)= \frac \left(\frac-\frac+ \frac- \frac+ \cdots \right).$

If ''s'' is a multiple of 4,

:\begin
\delta'_(n) &= \frac\left(n+\frac4\right)^ \left( \frac+ \frac+ \frac+ \cdots \right) && s \equiv 0 \pmod 4 \\ pt\delta'_(n) &= \frac\left(n+\frac4\right)^ \left( \frac+ \frac+ \frac+ \cdots \right) && s \equiv 2 \pmod 4 \\ pt\delta'_(n) &= \frac\left(n+\frac4\right)^ \left(\frac- \frac+\frac- \cdots \right) && s \equiv 1 \pmod 2 \text s >1
\end

Therefore,

:\begin
r'_2(n) &= \frac \left(\frac- \frac+ \frac- \frac+ \cdots \right) \\ ptr'_4(n) &= \left(\frac\right)^2\left(n+\frac12\right) \left(\frac+\frac+ \frac+ \cdots \right) \\ ptr'_6(n) &= \frac\left(n+\frac34\right)^2 \left(\frac-\frac+ \frac-\cdots \right)\\ ptr'_8(n) &= \frac(n+1)^3 \left(\frac+ \frac+ \frac+ \cdots \right)
\end

Sums

Let

:$\begin T_q(n) &= c_q(1) + c_q(2) + \cdots + c_q(n) \\ U_q(n) &= T_q(n) + \tfrac12\phi(q) \end$

Then for ,

:$\begin \sigma_(1) + \cdots + \sigma_(n) &= \zeta(s+1) \left(n+ \frac+ \frac+\frac +\cdots \right) \\ &= \zeta(s+1) \left(n+\tfrac12+ \frac+ \frac+ \frac +\cdots \right)- \tfrac12\zeta(s) \\ d(1)+ \cdots+ d(n) &= - \frac - \frac - \frac - \cdots \\ d(1)\log 1 + \cdots + d(n)\log n &= -\frac -\frac -\frac -\cdots \\ r_2(1)+ \cdots+ r_2(n) &= \pi \left(n -\frac +\frac -\frac +\cdots \right) \end$

See also

*Gaussian period
*Kloosterman sum

Notes

References

*

*
*

*.
*

* (pp. 179–199 of his ''Collected Papers'')

* (pp. 136–163 of his ''Collected Papers'')

*

*

External links

* {{cite journal, first1=László , last1= Tóth , title=Sums of products of Ramanujan sums , journal= Annali dell'universita' di Ferrara , arxiv=1104.1906 , year=2011 , doi=10.1007/s11565-011-0143-3 , volume=58 , pages=183–197, s2cid= 119134250

Number theory
Squares in number theory
Srinivasa Ramanujan