Higher Arithmetic
American Mathematical Society (Verlag)
978-0-8218-4439-7 (ISBN)
- Titel z.Zt. nicht lieferbar
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
Although number theorists have sometimes shunned and even disparaged computation in the past, today's applications of number theory to cryptography and computer security demand vast arithmetical computations. These demands have shifted the focus of studies in number theory and have changed attitudes toward computation itself.
Numbers The problem $A/square + B = /square$ Congruences Double congruences and the Euclidean algorithm The augmented Euclidean algorithm Simultaneous congruences The fundamental theorem of arithmetic Exponentiation and orders Euler's $/phi$-function Finding the order of $a/bmod c$ Primality testing The RSA cipher system Primitive roots $/bmod/p$ Polynomials Tables of indices $/bmod/ p$ Brahmagupta's formula and hypernumbers Modules of hypernumbers A canonical form for modules of hypernumbers Solution of $A/square + B = /square$ Proof of the theorem of Chapter 19 Euler's remarkable discovery Stable modules Equivalence of modules Signatures of equivalence classes The main theorem Which modules become principal when squared? The possible signatures for certain values of $A$ The law of quadratic reciprocity Proof of the Main Theorem The theory of binary quadratic forms Composition of binary quadratic forms Cycles of stable modules Answers to exercises Bibliography Index.
| Erscheint lt. Verlag | 7.1.2009 |
|---|---|
| Reihe/Serie | Student Mathematical Library |
| Zusatzinfo | Illustrations |
| Verlagsort | Providence |
| Sprache | englisch |
| Gewicht | 276 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Arithmetik / Zahlentheorie |
| ISBN-10 | 0-8218-4439-3 / 0821844393 |
| ISBN-13 | 978-0-8218-4439-7 / 9780821844397 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
