Atjaunināt sīkdatņu piekrišanu

Fundamental Number Theory with Applications [Hardback]

(University of Calgary, Alberta, Canada)
  • Formāts: Hardback, 464 pages, height x width: 235x156 mm, weight: 794 g
  • Sērija : Discrete Mathematics and Its Applications
  • Izdošanas datums: 10-Sep-1997
  • Izdevniecība: CRC Press Inc
  • ISBN-10: 0849339871
  • ISBN-13: 9780849339875
Citas grāmatas par šo tēmu:
  • Formāts: Hardback, 464 pages, height x width: 235x156 mm, weight: 794 g
  • Sērija : Discrete Mathematics and Its Applications
  • Izdošanas datums: 10-Sep-1997
  • Izdevniecība: CRC Press Inc
  • ISBN-10: 0849339871
  • ISBN-13: 9780849339875
Citas grāmatas par šo tēmu:
A textbook for an undergraduate course at lower-level without and at upper-level with optional sections on applications. Assumes no background in computer science and no mathematics past solid high-school level. Combines elementary number theory with algebraic number theory and applications such as those in cryptology. Begins with the arithmetic of the rational integers and proceeds through quadratic orders to an introduction of algebraic number theory. Also briefly traces the history of number theory from the earliest inscriptions. Annotation c. by Book News, Inc., Portland, Or.

Beginning with the arithmetic of the rational integers and proceeding to an introduction of algebraic number theory via quadratic orders, Fundamental Number Theory with Applications reveals intriguing new applications of number theory. This text details aspects of computer science related to
  • cryptography
  • factoring
  • primality testing
  • complexity analysis
  • computer arithmetic
  • computational number theory
    Fundamental Number Theory with Applications also covers:
  • Carmichael numbers
  • Dirichlet products
  • Jacobsthal sums
  • Mersenne primes
  • perfect numbers
  • powerful numbers
  • self-contained numbers
    Numerous exercises are included, testing the reader's knowledge of the concepts covered, introducing new and interesting topics, and providing a venue to learn background material.
    Written by a professor and author who is an accomplished scholar in this field, this book provides the material essential for an introduction to the fundamentals of number theory.
  • Preface ix
    1 Arithmetic of the Integers
    1(74)
    1.1 Introduction -- Where We Begin And Why
    1(6)
    1.2 The Fundamental Laws
    7(26)
    1.3 Divisibility
    33(9)
    1.4 Prime Numbers
    42(10)
    1.5 Computer Arithmetic and Complexity
    52(13)
    1.6 Applications To a Set of Quadratics
    65(10)
    2 Congruences
    75(70)
    2.1 The Basics
    75(8)
    2.2 Linear Congruences
    83(6)
    2.3 Arithmetic Functions-Euler's Totient
    89(10)
    2.4 The Chinese Remainder Theorem
    99(4)
    2.5 Polynomial Congruences & Thue's Theorem
    103(15)
    2.6 Cryptography and Factoring
    118(18)
    2.7 Quadratic Polynomials
    136(9)
    3 Primitive Roots
    145(40)
    3.1 Order
    145(5)
    3.2 Existence
    150(4)
    3.3 Indices
    154(6)
    3.4 Primality Testing and Cryptography
    160(7)
    3.5 Quadratic Orders, Ideals and Units
    167(18)
    4 Quadratic Residues
    185(36)
    4.1 The Quadratic Reciprocity Law
    185(11)
    4.2 The Jacobi and Kronecker Symbols
    196(7)
    4.3 Quadratic Polynomials and Primes
    203(6)
    4.4 Quadratic Residues & Primality Testing
    209(3)
    4.5 Applications to Quadratic Orders
    212(9)
    5 Continued Fractions
    221(52)
    5.1 Finite Continued Fractions
    221(7)
    5.2 Infinite Continued Fractions
    228(10)
    5.3 Periodic Continued Fractions
    238(16)
    5.4 Continued Fractions and Factoring
    254(3)
    5.5 The Continued Fraction Algorithm
    257(16)
    6 Diophantine Equations
    273(88)
    6.1 Sums of Squares
    273(21)
    6.2 The Equation x(2) -- Dy(2) = n
    294(14)
    6.3 Diophantine Equations of Higher Degree
    308(2)
    6.4 Elliptic Curves, Factcring, and Primality
    310(11)
    6.5 Applications: Algebraic Number Theory
    321(40)
    Appendices 361(20)
    Appendix A: Set Theory 362(6)
    Appendix B: Primes Greater than Equal to 9547 & Least Primitive Roots 368(5)
    Appendix C: Tables of Special Primes
    373(2)
    Appendix D: Cunningham Factorizations 375(1)
    Appendix E: Pseudoprimes & Carmichael Numbers 376(1)
    Appendix F: Indices 377(1)
    Appendix G: Values of Some Arithmetic Functions 378(1)
    Appendix H: The ABC Conjecture 379(1)
    Appendix I: The Prime Number Theorem 380(1)
    Solutions to Odd-Numbered Exercises 381(42)
    Bibliography 423(3)
    List of Symbols
    426(1)
    Index 427