Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Tonelli Shanks Algorithm
CHF 43.20
Auf Lager
SKU
V3O3RBKFH6T
1 Verfügbar 
Geliefert zwischen Di., 25.11.2025 und Mi., 26.11.2025
Details
High Quality Content by WIKIPEDIA articles! The Tonelli Shanks algorithm (referred to by Shanks as the RESSOL algorithm) is used within modular arithmetic to solve a congruence of the form x^2 equiv n pmod p 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 due to the fact that I had lent Volume 1 of Dickson's History to a friend and it was never returned."
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131148453
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131148453
- Format Fachbuch
- Titel Tonelli Shanks Algorithm
- Herausgeber Betascript Publishing
- Anzahl Seiten 96
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
