Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Tonelli–Shanks_algorithm> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Tonelli–Shanks_algorithm abstract "The Tonelli–Shanks algorithm (referred to by Shanks as the RESSOL algorithm) is used within modular arithmetic to solve a congruence of the form where n is a quadratic residue (mod p), and p is an odd prime.Tonelli–Shanks cannot be used for composite moduli; finding square roots modulo composite numbers is a computational problem equivalent to integer factorization.An equivalent, but slightly more redundant version of this algorithm was developed by Alberto Tonelli in 1891. The version discussed here was developed independently by Daniel Shanks in 1973, who explained:"My tardiness in learning of these historical references was because I had lent Volume 1 of Dickson's History to a friend and it was never returned."".
- Tonelli–Shanks_algorithm wikiPageID "3667375".
- Tonelli–Shanks_algorithm wikiPageRevisionID "568820937".
- Tonelli–Shanks_algorithm subject Category:Articles_containing_proofs.
- Tonelli–Shanks_algorithm subject Category:Modular_arithmetic.
- Tonelli–Shanks_algorithm subject Category:Number_theoretic_algorithms.
- Tonelli–Shanks_algorithm comment "The Tonelli–Shanks algorithm (referred to by Shanks as the RESSOL algorithm) is used within modular arithmetic to solve a congruence of the form where n is a quadratic residue (mod p), and p is an odd prime.Tonelli–Shanks cannot be used for composite moduli; finding square roots modulo composite numbers is a computational problem equivalent to integer factorization.An equivalent, but slightly more redundant version of this algorithm was developed by Alberto Tonelli in 1891.".
- Tonelli–Shanks_algorithm label "Tonelli–Shanks algorithm".
- Tonelli–Shanks_algorithm sameAs Tonelli%E2%80%93Shanks_algorithm.
- Tonelli–Shanks_algorithm sameAs Q17104164.
- Tonelli–Shanks_algorithm sameAs Q17104164.
- Tonelli–Shanks_algorithm wasDerivedFrom Tonelli–Shanks_algorithm?oldid=568820937.