Higher arithmetic : an algorithmic introduction to number theory / Harold M. Edwards.

Author/creator Edwards, Harold M.
Format Book
Publication InfoProvidence, R.I. : American Mathematical Society, ©2008.
Descriptionxii, 210 pages : illustrations ; 22 cm.
Supplemental ContentTable of contents
Subjects
Number theory.

SeriesStudent mathematical library, 1520-9121 ; v. 45
Student mathematical library ; v. 45. ^A438915
Contents Numbers -- The problem A + B = -- Congruences -- Double congruences and the Euclidean algorithm -- The augmented Euclidean algorithm -- Simultaneous congruences -- The fundamental theorem of arithmetic -- Exponentiation and orders -- Euler's 0-funtion -- Finding the order of a mod c -- Primality testing -- The RSA Cipher system -- Primitive roots mod p -- Polynomials -- Tables of indices mod p.
Contents Brahmagupta's Formule and hypernumbers -- Modules of hypernumbers -- A canonical form for modules of hypernumbers -- Solution of A + B = -- Proof of the theorem of chapter 19 -- Euler's remarkable discovery -- Stable modules -- Equivalence of modules -- Signatures of equivalence classes -- The Main theorem -- Modules that 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.
Bibliography noteIncludes bibliographical references (p. 207) and index.
LCCN 2007060578
ISBN9780821844397 (pbk. : alk. paper)
ISBN0821844393 (pbk. : alk. paper)

Availability

Library Location Call Number Status Item Actions
Joyner General Stacks QA241 .E39 2008 ✔ Available Place Hold