Curtis Cooper
From Wikipedia, the free encyclopedia
Dr. Curtis Cooper is a professor at the University of Central Missouri, at its Department of Mathematics and Computer Science.
Using software from the GIMPS project, Cooper and Dr. Steven Boone found the 43rd known Mersenne prime on their 700 PC cluster on December 15, 2005. The prime, 230402457 - 1, is 9,152,052 digits long and is the ninth Mersenne prime for GIMPS. [1]
Cooper and Boone became the first GIMPS contributers to find two primes when they also found the 44th known Mersenne prime, 232582657 − 1, which has 9,808,358 digits (or M32582657 for short). This prime was discovered on September 4, 2006 using a PC cluster of over 850 machines. This is the tenth Mersenne prime for GIMPS. [2]
Cooper's own work has mainly been in elementary number theory, especially work related to digital representations of numbers. He collaborated extensively with Robert E. Kennedy. They have worked with Niven numbers, among other results, showing that no 21 consecutive integers can all be Niven numbers [3], and introduced the notion of tau numbers, numbers whose total number of divisors are itself a divisor of the number[4]. Independent of Kennedy, Cooper has also done work about generalizations of geometric series, and their application to probability[5].
[edit] Notes
- ^ Project Discovers New Largest Known Prime Number, 230,402,457-1. Great Internet Mersenne Prime Search. Retrieved on November 26, 2006.
- ^ Project Discovers Largest Known Prime Number, 232,582,657-1. Great Internet Mersenne Prime Search. Retrieved on November 26, 2006.
- ^ (1993) "N/A". Fibonacci Quarterly 31 (2): 146-151.
- ^ (1990) "N/A". Internat. J. Math. Math. Sci. 13 (2): 383-386.
- ^ (1986) "N/A". American Mathematical Monthly 93.
[edit] External links
- Curtis Cooper, his homepage.
 |
This article about a mathematician is a stub. You can help Wikipedia by expanding it. |
