数论入门基础chapter3英文论文arith.pdfVIP

A Guide to Arithmetic Robin Chapman August 5, 1994 These notes give a very brief resum´e of my number theory course. Proofs and examples are omitted. Any suggestions for improvements will be grate- fully received. I am grateful to Jasmine Arscott for pointing out some errors in an earlier version. 1 Basic notions In number theory we deal with the set of natural numbers N = {1, 2, 3, . . .}, and the set of integers Z = {. . . , −2, −1, 0, 1, 2, 3, . . .}. Probably the most fundamental notion of number theory is that of divisibility. We say that an integer m divides an integer n, or that n is divisible by m, or that m is a factor or divisor of n, if there exists an integer r with n = rm. If m = 0 this means that n/m ∈ Z. We write m | n if m divides n and m n if m doesn’t divide n. Proposition (i) If m | n and m | r , then m | n + r and m | n − r , (ii) if m | n and r ∈ Z, then m | rn, (iii) n | 0 for all n ∈ Z but 0 | n only if n = 0, (iv) n | 1 if and only if n = ±1, (v) if m | n and m, n ∈ N, then m ≤ n, (vi) m | n if and only if m | −n if and only if −m | n, (vii) if r , m, n ∈ Z and r = 0 then m | n if and only if rm | rn, (viii) if m | n and n | r then m | r . Once we have the concept of divisibility we can define the notion of pri- mality. We say a natural number p is prime if p 1, and the only natural numbers dividing p are 1 and p . If n 1 and n isn’t prime then we say n is composite. Proposition If n 1 is a natural number, then n = p p · · ·p where p , 1 2 r 1 p2 , . . . , pr are primes. Theorem (Euclid) The set of primes is infinite. 1