Higher arithmetic : an algorithmic introduction to number theory
Author(s)
Bibliographic Information
Higher arithmetic : an algorithmic introduction to number theory
（Student mathematical library, v. 45）
American Mathematical Society, c2008
Available at / 30 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
EDW||7||4200005154422
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 207) and index
Description and Table of Contents
Description
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.
Table of Contents
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.
by "Nielsen BookData"
