This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 5,. ..,k? Go the easy route and take N = k!. Clearly, then, k! + 2, k! + 3, k! + 4,. .., k! + k are all composite numbers. These observations give one way of &quot;constructing&quot; new primes. Suppose you have a collection of primes, say, p 1 , p 2 ,..., p t . Then the number p 1 p 2 ...p t + 1 must contain a &quot;new&quot; prime not in your set (in fact, usually a big one) as a factor. Although I wouldnt recommend it as an efficient way of locating primes, its a way which is guaranteed to work....
View
Full
Document
This note was uploaded on 03/01/2010 for the course MATH 301 taught by Professor Albertodelgado during the Spring '10 term at Bradley.
 Spring '10
 AlbertoDelgado
 Math, Combinatorics

Click to edit the document details