|
|
|
Goldbach's Prime Pairs
Library Home ||
Full Table of Contents ||
Suggest a Link ||
Library Help
| http://www.maa.org/mathland/mathtrek_8_21_00.html | |
|
|
|
| Ivars Peterson (MathTrek) | |
| Prime numbers serve as building blocks in the mathematics of whole numbers. Evenly divisible only by themselves and one, primes are a rich source of speculative ideas that mathematicians often find simple to state but difficult to prove. The Goldbach conjecture (every integer greater than 5 is the sum of three primes) is a prime example. Mathematicians and other researchers have turned to computers to test the conjecture against larger and larger even numbers. "There are strong grounds for believing that Goldbach's conjecture is true, and it feels like just a matter of time before someone figures out how to prove it," says Joe Buhler of the Mathematical Sciences Research Institute in Berkeley, Calif. "The real justification is algorithmic. In figuring out how to carry out the computations that far, one has to extend and polish algorithmic programming techniques, and the nature of the scientific advance in this case is much more in algorithmics than in number theory." | |
|
|
|
| Levels: | High School (9-12), College |
| Languages: | English |
| Resource Types: | Articles |
| Math Topics: | Prime Numbers, Algorithms, Number Theory |
[Privacy Policy] [Terms of Use]
© 1994-2008 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel School of Education.