Implementation of the Tonelli-Shanks algorithm for computing square roots modulo a prime number.
-
Updated
Oct 9, 2022 - Python
Implementation of the Tonelli-Shanks algorithm for computing square roots modulo a prime number.
🔓 Tools to help Discrete Mathematics computations.
Python bindings for the C++ library libsemigroups
Solutions for Simulation Lab Assignments
Simulator and plotter for linear congruential generator (LCG) functions in Python
Finding the power of a number that, in the congruent equation, equals 1 or -1 with given modulus
Add a description, image, and links to the congruence topic page so that developers can more easily learn about it.
To associate your repository with the congruence topic, visit your repo's landing page and select "manage topics."