Ramanujans sum, written c sub q of n, is a function of two positive integers q and n defined in number theory as the sum, over every integer a from 1 to q that is coprime to q, of the exponential term e raised to 2 pi i times a over q times n. Srinivasa Ramanujan introduced these sums in a 1918 paper, remarking that they seemed to be of great interest and appeared not to have been studied before. The sums always take integer values, are multiplicative as functions of q for a fixed n, and satisfy orthogonality relationships that make them useful throughout analytic number theory, including in the study of divisor functions, the distribution of primes, and the representation of integers as sums of squares or triangular numbers. Ramanujans sums also play a key role in proving Vinogradovs theorem, which shows that every sufficiently large odd number can be written as the sum of three primes.
Facts
Origin YearSrinivasa Ramanujan mentioned the sums in a 1918 paper Ramanujan's Sum
Filter Results1 entry
Connections
Attributed To
Source Ramanujan's Sum (Wikipedia)
In Branch
Source Ramanujan's Sum (Wikipedia)
Is Kind Of Object
Named After
Principal Result Of
Source Ramanujan's Sum (Wikipedia)
Sources
1. Ramanujan's Sum (Wikipedia)
Lead section
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 c q ( n) = ∑ 1 ≤ a ≤ q ( a, q) = 1 e 2 π i a q n, {\displaystyle c_{q}(n)=\sum _{1\leq a\leq q \atop (a,q)=1}e^{2\pi i{\tfrac {a}{q}}n},} where (a, q) = 1 means that a only takes on values coprime to q.
Attributed To: Srinivasa Ramanujan, Lead sentence
Srinivasa Ramanujan mentioned the sums in a 1918 paper.
Principal Result Of: Srinivasa Ramanujan, Lead sentence of the article on the result
Srinivasa Ramanujan mentioned the sums in a 1918 paper.
In Branch: Number Theory, Lead sentence
In number theory, Ramanujan's sum, usually denoted cq(n), is a function of two positive integer variables q and n defined by the f
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.