Math 2.0

Number theory Definition

Kloosterman sum

Builds on Exponential sumIntegers modulo nComplex exponential

Definition

Let m≥1m \ge 1 be an integer, and let a,b∈ℤa, b \in \Z. For a real tt, write e(t)=e2πite(t) = e^{2\pi i t}. For an integer xx coprime to mm, let xˉ\bar{x} be an integer with xxˉ≡1(modm)x \bar{x} \equiv 1 \pmod{m}. The Kloosterman sum is K(a,b;m)=∑xmodmgcd⁡(x,m)=1e ⁣(ax+bxˉm),K(a, b; m) = \sum_{\substack{x \bmod m \\ \gcd(x, m) = 1}} e\!\left(\frac{a x + b \bar{x}}{m}\right), where xx runs over a set of representatives of the invertible classes of the integers modulo m.

Remarks

The value does not depend on the choice of representatives or of xˉ\bar{x}, since the phase is defined modulo 11. Example: m=5m = 5, a=b=1a = b = 1. The pairs (x,xˉ)(x, \bar{x}) are (1,1),(2,3),(3,2),(4,4)(1, 1), (2, 3), (3, 2), (4, 4), so the phases are 2/5,1,1,8/52/5, 1, 1, 8/5 and K(1,1;5)=e(2/5)+2+e(3/5)=2+2cos⁡(4π/5)≈0.382.K(1, 1; 5) = e(2/5) + 2 + e(3/5) = 2 + 2\cos(4\pi/5) \approx 0.382. Non-example: the sum ∑x=0m−1e((ax+bxˉ)/m)\sum_{x = 0}^{m-1} e((a x + b \bar{x})/m) over all residues is not defined, since xˉ\bar{x} does not exist when gcd⁡(x,m)>1\gcd(x, m) > 1. The sum is real, because replacing xx by −x-x conjugates each term. If gcd⁡(a,m)=1\gcd(a, m) = 1, then K(a,b;m)=K(1,ab;m)K(a, b; m) = K(1, ab; m). For b=0b = 0, the sum K(a,0;m)K(a, 0; m) is the Ramanujan sum cm(a)c_m(a). It is an exponential sum in which the phase function is x↦(ax+bxˉ)/mx \mapsto (ax + b\bar{x})/m.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Complex exponential concept
  2. Exponential sum concept
  3. Integers modulo n concept
  4. Kloosterman sum definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Kloosterman_sum
About this page
TagJMTJG4B94M
URIm2://JMTJG4B94M
Kinddefinition
WritingW0 stub
MSC11L05
DefinesKloosterman sum
UsesExponential sum, Integers modulo n, Complex exponential
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.