Sction 41 Primes, Factorization, and the Euclidean Algorithm第41节的素数，分解，与欧几里德算法.pptVIP

Section 4.1: Primes, Factorization, and the Euclidean Algorithm;The purpose of the next two sections that we cover is to provide the mathematics background needed to understand the RSA Cryptosystem, which is a modern cryptosystem in wide use today. We start out by reviewing and expanding our study of prime numbers.;Prime Numbers;Facts About Primes 1. There are an infinite number of primes. Every natural number can be factored into a product of primes (Fundamental Theorem of Arithmetic).;Determining the Primality of Larger Positive Integers;Fact;Example 1: Isprime? Solution:;How do we