| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Landon Curt Noll"
m |
m |
||
| Line 1: | Line 1: | ||
| − | '''Landon Curt Noll''' (a.k.a '''Curt Noll''' or '''Curt Landon Noll''') was a high school student when he and [[Laura A. Nickel]] used [[CSUH|California State University, Hayward]]'s [[mainframe]] computer (a CDC Cyber 174) running their own assembly language [[program]] and found [[M25]] in October of 1978. This brought them quite a bit of attention. Their discovery was covered by national television news and reported in the New York times on November 21, 1978. The 18 year-olds were studying [[number theory]] at the time at CSUH with Dr. [[Derrick Henry Lehmer]] of [[UC Berkeley]] and Dr. Jurca of CSUH. The computation took 7 hours, 40 minutes, 20 seconds to complete. | + | '''Landon Curt Noll''' (a.k.a '''Curt Noll''' or '''Curt Landon Noll''') was a high school student when he and [[Laura A. Nickel]] used [[CSUH|California State University, Hayward]]'s [[Classes_of_computers#Mainframe computers|mainframe]] computer (a CDC Cyber 174) running their own assembly language [[program]] and found [[M25]] in October of 1978. This brought them quite a bit of attention. Their discovery was covered by national television news and reported in the New York times on November 21, 1978. The 18 year-olds were studying [[number theory]] at the time at CSUH with Dr. [[Derrick Henry Lehmer]] of [[UC Berkeley]] and Dr. Jurca of CSUH. The computation took 7 hours, 40 minutes, 20 seconds to complete. |
After finding M25, he was in contact with [[David Slowinski]]. Having revised the program, on February 9, 1979, without Nickel, he also found [[M26]] on the same machine. He went on to be a member of the [[Amdahl 6]]. This group went on to discover other large non-Mersenne [[prime number]]s. At one point their largest known prime held the world record for any known prime. After his discovery of M26, he suggested to use of [[Fast Fourier transform]]s to handle the large [[multiplication]]s need in [[Lucas-Lehmer test]]ing of large [[Mersenne number]]s. | After finding M25, he was in contact with [[David Slowinski]]. Having revised the program, on February 9, 1979, without Nickel, he also found [[M26]] on the same machine. He went on to be a member of the [[Amdahl 6]]. This group went on to discover other large non-Mersenne [[prime number]]s. At one point their largest known prime held the world record for any known prime. After his discovery of M26, he suggested to use of [[Fast Fourier transform]]s to handle the large [[multiplication]]s need in [[Lucas-Lehmer test]]ing of large [[Mersenne number]]s. | ||
Revision as of 15:30, 21 January 2019
Landon Curt Noll (a.k.a Curt Noll or Curt Landon Noll) was a high school student when he and Laura A. Nickel used California State University, Hayward's mainframe computer (a CDC Cyber 174) running their own assembly language program and found M25 in October of 1978. This brought them quite a bit of attention. Their discovery was covered by national television news and reported in the New York times on November 21, 1978. The 18 year-olds were studying number theory at the time at CSUH with Dr. Derrick Henry Lehmer of UC Berkeley and Dr. Jurca of CSUH. The computation took 7 hours, 40 minutes, 20 seconds to complete.
After finding M25, he was in contact with David Slowinski. Having revised the program, on February 9, 1979, without Nickel, he also found M26 on the same machine. He went on to be a member of the Amdahl 6. This group went on to discover other large non-Mersenne prime numbers. At one point their largest known prime held the world record for any known prime. After his discovery of M26, he suggested to use of Fast Fourier transforms to handle the large multiplications need in Lucas-Lehmer testing of large Mersenne numbers.
He has started a fanciful search for Mersennes (on a website server), found here. In less than 2 hours, the machine tested all candidates with prime exponents up to and including M26. During that 2 hour period, it duplicated what had previously occurred over a 520 year period.
Sources
- His home page
- Entry at the "Prime pages"
- Mathmatics of Computation, vol.35, num. 152 October 1980, pp 1387-1390
- Entry at Wikipedia (en)
- E-mail from Nickel/Glenn
