Skip to main content
QUICK REVIEW

[Paper Review] Zolotarev's Magical Proof of Quadratic Reciprocity

Matthew J. Baker|arXiv (Cornell University)|Feb 27, 2026
Advanced Mathematical Identities0 citations
TL;DR

The paper presents a combinatorial, card-dealing interpretation of Zolotarev's proof of quadratic reciprocity, linking permutation signs from row/column/diagonal deals to Gauss’s law via Zolotarev's lemma.

ABSTRACT

We present a creative reimagining of Zolotarev's classical proof of the Law of Quadratic Reciprocity.

Motivation & Objective

  • Motivate Quadratic Reciprocity through a concrete card-dealing model and permutations.
  • Derive the sign of permutations arising from different dealing schemes (R, C, D) and relate them to Gauss’s Law.
  • Introduce Zolotarev's Lemma to equate the Zolotarev and Legendre symbols for odd primes.
  • Derive supplemental reciprocity formulas for specific symbols (2 and -1) via additional dealing schemes.

Proposed method

  • Define cards numbered 0,...,mn-1 and compare row-deal vs column-deal to form permutation gamma; compute sign(gamma) as (-1)^{C(m,2)·C(n,2)}.
  • Introduce diagonal deal (D) for relatively prime odd m,n and define permutation alpha; show sign(alpha) equals the sign of the permutation induced by multiplication by n modulo m.
  • Use symmetry (swap roles of rows/columns) to define beta and relate sign(beta) to the sign of the m/n swap; obtain sign(beta)·sign(alpha)=sign(gamma).
  • Apply Zolotarev’s Lemma to connect Zolotarev symbols to Legendre symbols, yielding the Quadratic Reciprocity law: (p/q)·(q/p)=(-1)^{((p-1)(q-1)/4)} for distinct odd primes.
  • Derive supplements: compute [2/n] and [-1/n] via additional deals (Z and M) and show their signs correspond to classical supplemental laws (2/p) and (-1/p).
Figure 2: Example of a column deal with $m=3$ and $n=5$
Figure 2: Example of a column deal with $m=3$ and $n=5$

Experimental results

Research questions

  • RQ1What is the sign of the permutation linking row-wise to column-wise card dealing?
  • RQ2How does the diagonal dealing map relate to multiplication by n modulo m and its sign?
  • RQ3Can Zolotarev’s lemma bridge Zolotarev symbols with Legendre symbols to prove Quadratic Reciprocity?
  • RQ4How do supplemental formulas for the symbols 2 and -1 arise from modified dealing schemes?

Key findings

  • sign(gamma)=(-1)^{C(m,2)·C(n,2)}; when m,n are odd, sign(gamma)=(-1)^{(m-1)(n-1)/4}.
  • sign(alpha) equals the sign of the permutation induced by multiplication by n modulo m; sign(beta) equals the sign of the permutation induced by multiplication by m modulo n; their product gives sign(gamma).
  • sign(beta)·sign(alpha)=(-1)^{(m-1)(n-1)/4} and sign(beta)=sign(beta^{-1}); symmetry yields sign(beta)={m  n} and sign(alpha)={n  m}.
  • Zolotarev’s Lemma equates the Zolotarev symbol [a/p] with the Legendre symbol (a/p) for odd primes p, enabling the Law of Quadratic Reciprocity: (p/q)·(q/p)=(-1)^{((p-1)(q-1)/4)}.
  • supplemental_results include formulas for [2/n] and [-1/n], leading to (2/p)=(-1)^{(p^2-1)/8} and (-1/p)=(-1)^{(p-1)/2} for odd primes p.
  • the exposition connects a creative card-dealing model to the classical quadratic reciprocity law, via Zolotarev’s lemma and permutation sign calculations.
Figure 3: Example of a diagonal deal with $m=3$ and $n=5$
Figure 3: Example of a diagonal deal with $m=3$ and $n=5$

Better researchstarts right now

From paper design to paper writing, dramatically reduce your research time.

No credit card · Free plan available

This review was created by AI and reviewed by human editors.