
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
1. The Number of Primes Below a Given Limit.- 2. The Primes Viewed at Large.- 3. Subtleties in the Distribution of Primes.- 4. The Recognition of Primes.- 5. Factorization.- 6. Prime Numbers and Cryptography.- Appendix 1. Basic Concepts in Higher Algebra.- Modules.- Euclid's Algorithm.- The Labour Involved in Euclid's Algorithm.- A Definition Taken from the Theory of Algorithms.- A Computer Program for Euclid's Algorithm.- Reducing the Labour.- Binary Form of Euclid's Algorithm.- Groups.- Lagrange's Theorem. Cosets.- Abstract Groups. Isomorphic Groups.- The Direct Product of Two Given Groups.- Cyclic Groups.- Rings.- Zero Divisors.- Fields.- Mappings. Isomorphisms and Homomorphisms.- Group Characters.- The Conjugate or Inverse Character.- Homomorphisms and Group Characters.- Appendix 2. Basic Concepts in Higher Arithmetic.- Divisors. Common Divisors.- The Fundamental Theorem of Arithmetic.- Congruences.- Linear Congruences.- Linear Congruences and Euclid's Algorithm.- Systems of Linear Congruences.- Carmichael's Function.- Carmichael's Theorem.- Appendix 3. Quadratic Residues.- Legendre's Symbol..- Arithmetic Rules for Residues and Non-Residues.- The Law of Quadratic Reciprocity.- Jacobi's Symbol.- Appendix 4. The Arithmetic of Quadratic Fields.- Appendix 5. Continued Fractions.- What Is a Continued Fraction?.- Regular Continued Fractions. Expansions.- Evaluating a Continued Fraction.- Continued Fractions as Approximations.- Euclid's Algorithm and Continued Fractions.- Linear Diophantine Equations and Continued Fractions.- A Computer Program.- Continued Fraction Expansions of Square Roots.- Proof of Periodicity.- The Maximal Period-Lenath.- Short Periods.- Continued Fractions and Quadratic Residues.- Appendix 6. Algebraic Factors.- Factorization of Polynomials.- The Cyclotomic Polynomials.- Aurifeuillian Factorizations.- Factorization Formulas.- The Algebraic Structure of Aurifeuillian Numbers.- Appendix 7. Multiple-Precision Arithmetic.- Various Objectives for a Mu
The book investigates the fundamental properties of prime numbers and their computational applications, particularly in factorization and cryptography. It delves into the distribution and recognition of primes, explores various factorization methods, and examines the critical role of prime numbers in modern cryptographic systems. The text is structured to build from basic concepts to advanced topics, supported by appendices covering essential mathematical foundations.
This book is recognized as a comprehensive treatment of prime numbers and their computational relevance, particularly for those interested in number theory and its applications in computer science and cryptography. The detailed appendices suggest a thorough grounding in prerequisite mathematical concepts, making it suitable for advanced students or researchers. Its structured approach, moving from theoretical underpinnings to practical computational methods, indicates a text designed for in-depth study.
Page Count:
484
Publication Date:
2014-01-15
Publisher:
Springer
ISBN-10:
1475710909
ISBN-13:
9781475710908