FUNDAMENTAL THEOREM OF ARITHMETIC
umasundresh
This theorem says that every positive number (except 1) is either a prime number or can be written uniquely as a product of prime numbers. (i.e.,) we can always break a positive integer into prime factors.
Euclid gave an almost complete proof over 2000 years ago.
| 2 | PRIME |
| 3 | PRIME |
| 4 | 2 X 2 |
| 5 | PRIME |
| 6 | 2 X 3 |
| 7 | PRIME |
| 8 | 2 X 2 X 2 |
| 9 | 3 X 3 |
| 10 | 2 X 5 |
| … | … |
Carl Friedrich Gauss was the first who provided the first proof in 1801.
