|
|
|
|
LEADER |
03723nam a22004335i 4500 |
001 |
978-0-387-74725-5 |
003 |
DE-He213 |
005 |
20150521134638.0 |
007 |
cr nn 008mamaa |
008 |
100301s2009 xxu| s |||| 0|eng d |
020 |
|
|
|a 9780387747255
|9 978-0-387-74725-5
|
024 |
7 |
|
|a 10.1007/978-0-387-74725-5
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA150-272
|
072 |
|
7 |
|a PBF
|2 bicssc
|
072 |
|
7 |
|a MAT002000
|2 bisacsh
|
082 |
0 |
4 |
|a 512
|2 23
|
245 |
1 |
2 |
|a A Concrete Introduction to Higher Algebra
|h [electronic resource] /
|c edited by Lindsay N. Childs.
|
264 |
|
1 |
|a New York, NY :
|b Springer New York,
|c 2009.
|
300 |
|
|
|a XIV, 604 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Undergraduate Texts in Mathematics,
|x 0172-6056
|
505 |
0 |
|
|a Numbers -- Numbers -- Induction -- Euclid's Algorithm -- Unique Factorization -- Congruence -- Congruence classes and rings -- Congruence Classes -- Rings and Fields -- Matrices and Codes -- Congruences and Groups -- Fermat's and Euler's Theorems -- Applications of Euler's Theorem -- Groups -- The Chinese Remainder Theorem -- Polynomials -- Polynomials -- Unique Factorization -- The Fundamental Theorem of Algebra -- Polynomials in ?[x] -- Congruences and the Chinese Remainder Theorem -- Fast Polynomial Multiplication -- Primitive Roots -- Cyclic Groups and Cryptography -- Carmichael Numbers -- Quadratic Reciprocity -- Quadratic Applications -- Finite Fields -- Congruence Classes Modulo a Polynomial -- Homomorphisms and Finite Fields -- BCH Codes -- Factoring Polynomials -- Factoring in ?[x] -- Irreducible Polynomials.
|
520 |
|
|
|a This book is an informal and readable introduction to higher algebra at the post-calculus level. The concepts of ring and field are introduced through study of the familiar examples of the integers and polynomials. A strong emphasis on congruence classes leads in a natural way to finite groups and finite fields. The new examples and theory are built in a well-motivated fashion and made relevant by many applications - to cryptography, error correction, integration, and especially to elementary and computational number theory. The later chapters include expositions of Rabin's probabilistic primality test, quadratic reciprocity, the classification of finite fields, and factoring polynomials over the integers. Over 1000 exercises, ranging from routine examples to extensions of theory, are found throughout the book; hints and answers for many of them are included in an appendix. The new edition includes topics such as Luhn's formula, Karatsuba multiplication, quotient groups and homomorphisms, Blum-Blum-Shub pseudorandom numbers, root bounds for polynomials, Montgomery multiplication, and more. "At every stage, a wide variety of applications is presented...The user-friendly exposition is appropriate for the intended audience" - T.W. Hungerford, Mathematical Reviews "The style is leisurely and informal, a guided tour through the foothills, the guide unable to resist numerous side paths and return visits to favorite spots..." - Michael Rosen, American Mathematical Monthly.
|
650 |
|
0 |
|a Mathematics.
|
650 |
|
0 |
|a Algebra.
|
650 |
1 |
4 |
|a Mathematics.
|
650 |
2 |
4 |
|a Algebra.
|
700 |
1 |
|
|a Childs, Lindsay N.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9780387745275
|
830 |
|
0 |
|a Undergraduate Texts in Mathematics,
|x 0172-6056
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-0-387-74725-5
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SMA
|
950 |
|
|
|a Mathematics and Statistics (Springer-11649)
|