Unformatted text preview: S i that contains at least n + 1 of the numbers a i . 1.2: An integer p is prime if the following conditions are satisﬁed: 1. p 6 = ± 1, and 2. whenever a · b is divisible by p , either a is divisible by p or b is divisible by p . If p is a prime number, show that √ p is irrational. 1 For the problems from the textbook, you may use, without proof, the following facts about prime numbers: • a natural number p is prime if and only if its only proper divisors are 1 and p (and p 6 = ± 1), and • an integer n ≥ 2 can be written as a product of prime numbers. 1...
View
Full Document
 Fall '10
 StevenKlee
 Calculus, Prime Numbers, Natural number, Prime number

Click to edit the document details