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.
Efficient pure-Python implementation of the integer square root function.
🇺🧮️〽️ The official source repository for the UCALC (Ultimate Calculator) Square Root calculator mode project.
Here is a list of sample python programs for beginners.
Square root any precision
Computes the nth root using Monte Carlo simulation
Calculates the Discriminant of a trinomial and gives its square root back
Python scripts
A super slow algorithm to find out the square root of any number
Python program to approximate square roots using Newton's method
The Babylonian method for finding square roots by hand | Heron's method | Newton's method
An algorithm to calculate a better approximation for the square root.
Add a description, image, and links to the square-root topic page so that developers can more easily learn about it.
To associate your repository with the square-root topic, visit your repo's landing page and select "manage topics."