Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03029158n
Noun Concept
SYL
No term available
EN
The Tonelli–Shanks algorithm is used in modular arithmetic to solve for r in a congruence of the form r2 ≡ n, where p is a prime: that is, to find a square root of n modulo p. Wikipedia
Relations
Sources
IS A
EN
algorithm
NAMED AFTER
Daniel Shanks
EN
Alberto Tonelli

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License