Ramanujan's sum

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

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

Srinivasa Ramanujan mentioned the sums in a 1918 paper.[1] 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.[2]

  1. ^ Ramanujan, On Certain Trigonometric Sums ...

    These sums are obviously of great interest, and a few of their properties have been discussed already. But, so far as I know, they have never been considered from the point of view which I adopt in this paper; and I believe that all the results which it contains are new.

    (Papers, p. 179). In a footnote cites pp. 360–370 of the Dirichlet–Dedekind Vorlesungen über Zahlentheorie, 4th ed.
  2. ^ Nathanson, ch. 8.

© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search