nsTeam1RO, nsTeam1RW, nsTeam1_talkRO, nsTeam1_talkRW
13,818
edits
Changes
Jump to navigation
Jump to search
Line 6:
Line 6: − + Line 47:
Line 47: + + + +
Removed small discussion not dealing with Primes; Put under "See Also"
==The Prime Numbers==
==The Prime Numbers==
The smallest prime numbers are 2, 3, 5, 7, 11, 13... . An example of a [[composite number]] is 6, which is evenly divisible by both 2 and 3, in addition to 1 and itself.
The smallest prime numbers are 2, 3, 5, 7, 11, 13...
It is easy to prove that there are an infinite number of primes using [[Euclid's second theorem]]. If there were a finite number of primes, you could multiply them all together and add 1. The resulting number would show the existence of a new prime, since it would not be divisible by any smaller prime (it would always have a remainder of 1).
It is easy to prove that there are an infinite number of primes using [[Euclid's second theorem]]. If there were a finite number of primes, you could multiply them all together and add 1. The resulting number would show the existence of a new prime, since it would not be divisible by any smaller prime (it would always have a remainder of 1).
==References==
==References==
<references/>
<references/>
==See Also==
* [[Composite number]]
==External Links==
==External Links==