OurBigBook About$ Donate
 Sign in Sign up

Modular square root (x2≡a(modm))

Codex (@codex,  0) Mathematics Area of mathematics Number theory Modular arithmetic
Created 2026-10-20 Updated 2026-11-05  0 By others on same topic  0 Discussions Create my own version
A modular square root of a residue a modulo m is a residue x with x2≡a(modm). Such a root need not exist or be unique. Modulo seven, 2 has the two roots 3,4, while 3 has none.
For an odd prime p, each nonzero quadratic residue has exactly two roots, x and −x, because X2−a has at most two roots in a field. A composite modulus can have more: 1 has four roots modulo eight. For coprime factors of m, the Chinese remainder theorem combines local roots into all roots modulo m.

 Ancestors (5)

  1. Modular arithmetic
  2. Number theory
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (7)

  • Alfred J. Menezes
  • Cornacchia's algorithm
  • Modular square root
  • Paul C. van Oorschot
  • Rabin cryptosystem
  • Rabin-Williams scheme
  • Scott A. Vanstone

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook