Items related to Pocklington's Algorithm: Quadratic Residue, Prime...
Pocklington's Algorithm: Quadratic Residue, Prime Number, Modular Arithmetic, Number Theory, Algorithm - Softcover
Search results for Pocklington's Algorithm: Quadratic Residue, Prime...
Stock Image
Pocklington's Algorithm
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 164 pp. Englisch. Seller Inventory # 9783639961010
Seller Image
Pocklington's Algorithm | Quadratic Residue, Prime Number, Modular Arithmetic, Number Theory, Algorithm
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Pocklington's Algorithm | Quadratic Residue, Prime Number, Modular Arithmetic, Number Theory, Algorithm | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9783639961010 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Seller Inventory # 134835287
Seller Image
Pocklington's Algorithm
Print on DemandSeller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783639961010
Seller Image
Pocklington's Algorithm : Quadratic Residue, Prime Number, Modular Arithmetic, Number Theory, Algorithm
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783639961010