<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-03-14 05:33:29Modular arithmetic Integer sequences Prime number Derrick Henry Lehmer Mersenne prime Pseudorandomness Lehmer Lehmer random number generator Lucas–Lehmer primality test Mathematics Number theory Pseudorandom number generators |
| Explicit Primality Criteria for h #2k ± 1 Wieb Bosma Mathematics of Computation, Vol. 61, No. 203, Special Issue Dedicated to Derrick Henry Lehmer. (Jul., 1993), ppStable URL: http://links.jstor.org/sici?sici=DocID: 1l3Gs - View Document |
| Reasoning with computer-assisted experiments in mathematics Liesbeth De Mol∗ 1DocID: 10YuK - View Document |
| The proof is in the process. A preamble for a philosophy of computer-assisted mathematics Liesbeth De Mol Mechanization tends to emphasize practice rather than theory, deeds rather than words, explicit answers rather thaDocID: 10HEL - View Document |
| PDF DocumentDocID: QzU1 - View Document |
| Microsoft Word - Poster-LehmerC.docDocID: CjqN - View Document |