Modular Square Root Calculator

x² ≡ a (mod p)

All Tools

Loading tool...

About Modular Square Root Calculator

A modular square root calculator solving x² ≡ a (mod p) for prime p. Uses Tonelli-Shanks algorithm. Checks if a is a quadratic residue via Euler's criterion, then finds both roots. Shows step-by-step computation. Client-side.

Modular Square Root Calculator Features

  • Tonelli-Shanks
  • Both roots
  • QR check
  • Step-by-step
  • Euler criterion
Advertisement
Advertisement