Higher Arithmetic

An Algorithmic Introduction to Number Theory

AvHarold M. Edwards

Häftad, Engelska, 2008

Del i serien Student Mathematical Library

708 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2008-03-30
Vikt:276 g
Format:Häftad
Språk:Engelska
Serie:Student Mathematical Library
Antal sidor:210
Förlag:American Mathematical Society
ISBN:9780821844397

Utforska kategorier

Talteori inom Naturvetenskap och teknik

Innehållsförteckning

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.