Siteadmin, Check users, nsTeam1RO, nsTeam1RW, nsTeam1_talkRO, nsTeam1_talkRW, oversight, Administrators
30,650
edits
Changes
Jump to navigation
Jump to search
Line 8:
Line 8: +
excellent example of a basic article which then introduces more advanced information; let's use it as a model for other math articles
The first few prime numbers are 2, 3, 5, 7, 11, 13...
The first few prime numbers are 2, 3, 5, 7, 11, 13...
{{main|prime number theorem}}
It is easy to prove that there are an infinite number of primes using Euclid's second theorem: Imagine there is a finite set consisting of all the primes. Multiply them all together, add 1, and call this N. N would not be divisible by any number in the set--there would always be a remainder of 1. Because all non-prime numbers can be decomposed into a product of underlying primes, N must be divisible by some prime not in the set (possibly itself), thus contradicting the assumption that the set contained all of the primes.
It is easy to prove that there are an infinite number of primes using Euclid's second theorem: Imagine there is a finite set consisting of all the primes. Multiply them all together, add 1, and call this N. N would not be divisible by any number in the set--there would always be a remainder of 1. Because all non-prime numbers can be decomposed into a product of underlying primes, N must be divisible by some prime not in the set (possibly itself), thus contradicting the assumption that the set contained all of the primes.