Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Mathematical Object

Ramanujan's Sum

Number Theory

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. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Facts
Origin Year
1918 1
Srinivasa Ramanujan mentioned the sums in a 1918 paper
Classification
Object Kind
Function 1
Connections

In Branch

Source Ramanujan's Sum (Wikipedia)

Is Kind Of Object

Functions, Concepts

Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.

Named After

Srinivasa Ramanujan, Mathematicians

Derived from the object's own name (unambiguous possessive-token match to exactly one live mathematician entity, w-bfill-g5-0924 browse backfill)

Sources
1. Ramanujan's Sum (Wikipedia)
In Branch: Number Theory, Lead sentence
Quote, 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 Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.