Prime number/Citable Version

From Citizendium
< Prime number
Revision as of 05:26, 5 April 2007 by imported>Greg Woodhouse (an important clarification)
Jump to navigation Jump to search

A prime number is a whole number (i.e, one having no fractional or decimal part) that cannot be evenly divided by any numbers but and itself. The first few prime numbers are , , , , , , and so on. With the exception of , the first few numbers on this list are odd numbers, but not every odd number is prime. For example, and , so neither nor is prime. The study of prime numbers has a long history, going back to ancient times, and it remains an active part of number theory (a branch of mathematics) today. It is commonly believed that the study of prime numbers is an interesting, but not terribly useful, area of mathematical research. This, however, is a misundertanding. For example, it is now well known that understanding properties of prime numbers and their generalizations is essential to modern cryptography, and to public key ciphers that are crucial to Internet commerce, wireless networks, telemedicine and, of course military applications. But while it is commonly known that knowledge of prime numbers is important to cryptography, it is less well known that other computer algorithms depend on properties of prime numbers. These algorithms allow computers to run faster, computer networks to carry more data with a greater degree of reliability, and are basic to the operation of many consumer electronics devices, such as television sets, DVD players, GPS devices, and more. Life as we know it today would not be possible without an understanding of prime numbers.