Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. Pocklington'salgorithm is a technique for solving a congruence of the form x^2 equiva pmod p, , where x and a are integers and a is a quadratic residue. Thealgorithm is one of the first efficient methods to solve such acongruence. It was described by H.C. Pocklington in 1917. (Note: allequiv are taken to mean (mod p), unless indicated otherwise.) In numbertheory, an integer q is called a quadratic residue modulo n if it iscongruent to a perfect square (mod n); i.e., if there exists an integerx such that: {x^2}equiv {q} pmod{n}. Otherwise, q is called a quadraticnonresidue (mod n). Originally an abstract mathematical concept from thebranch of number theory known as modular arithmetic, quadratic residuesare now used in applications ranging from acoustical engineering tocryptography and the factoring of large numbers.VDM Verlag, Dudweiler Landstra�e 99, 66123 Saarbr�cken 164 pp. Englisch. N� de r�f. du vendeur 9783639961010

Contacter le vendeur

Acheter neuf

EUR 196

Exp�dition �EUR 60
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Pocklington's Algorithm : Quadratic Residue, Prime Number, Modular Arithmetic, Number Theory, Algorithm

Mariam T. Tennoe

Edit� par Omniscriptum, 2026

ISBN 10 : 3639961013 ISBN 13 : 9783639961010

Neuf Taschenbuch

impression � la demande

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. Pocklington'salgorithm is a technique for solving a congruence of the form x^2 equiva pmod p, , where x and a are integers and a is a quadratic residue. Thealgorithm is one of the first efficient methods to solve such acongruence. It was described by H.C. Pocklington in 1917. (Note: allequiv are taken to mean (mod p), unless indicated otherwise.) In numbertheory, an integer q is called a quadratic residue modulo n if it iscongruent to a perfect square (mod n); i.e., if there exists an integerx such that: {x^2}equiv {q} pmod{n}. Otherwise, q is called a quadraticnonresidue (mod n). Originally an abstract mathematical concept from thebranch of number theory known as modular arithmetic, quadratic residuesare now used in applications ranging from acoustical engineering tocryptography and the factoring of large numbers. N� de r�f. du vendeur 9783639961010

Contacter le vendeur

Acheter neuf

EUR 198,35

Exp�dition �EUR 61,31
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Articles li�s � Pocklington's Algorithm: Quadratic Residue, Prime...

Pocklington's Algorithm: Quadratic Residue, Prime Number, Modular Arithmetic, Number Theory, Algorithm - Couverture souple

R�sultats de recherche pour Pocklington's Algorithm: Quadratic Residue, Prime...

Pocklington's Algorithm

Acheter neuf

Pocklington's Algorithm | Quadratic Residue, Prime Number, Modular Arithmetic, Number Theory, Algorithm

Acheter neuf

Pocklington's Algorithm

Acheter neuf

Pocklington's Algorithm : Quadratic Residue, Prime Number, Modular Arithmetic, Number Theory, Algorithm

Acheter neuf