| 000 | 01886cam a22003133u 4500 | ||
|---|---|---|---|
| 001 | 69 | ||
| 003 | UtSlPG | ||
| 005 | 20260610133026.0 | ||
| 006 | m | ||
| 007 | cr n | ||
| 008 | 260607r1993||||utu|||||o|||||||||||||| d | ||
| 040 | _aUtSlPG | ||
| 041 | 7 |
_aen _2iso639-1 |
|
| 050 | 4 | _aQA | |
| 100 | 1 | _aSlowinski, David | |
| 245 | 1 | 4 |
_aThe 32nd Mersenne Prime : _bPredicted by Mersenne |
| 264 | 1 |
_aSalt Lake City, UT : _bProject Gutenberg, _c1993 |
|
| 300 |
_a1 online resource : _bmultiple file formats |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 500 | _aMath | ||
| 500 | _aRelease date is 1993-06-01 | ||
| 520 | _a"The 32nd Mersenne Prime" by David Slowinski is a scientific publication likely written in the early 21st century. The text appears to delve into the discovery of a significant prime number, specifically the 32nd Mersenne Prime, highlighting its mathematical importance and the computational power involved in verifying its existence. The opening of the work presents the discovery of the 32nd Mersenne Prime in February 1993, attributing the breakthrough to the efforts surrounding Andrew Wiles' proof of Fermat's Last Theorem. The Mersenne number, represented in a lengthy numeric form, showcases the scale of what the author describes, indicating not just the numerical value but also the process required to compute such a prime number. This section serves as an introduction to the complexity of prime numbers and the excitement surrounding significant mathematical milestones, potentially engaging readers interested in number theory and computational mathematics. (This is an automatically generated summary.) | ||
| 534 | _nOriginal publication data not identified | ||
| 653 | _aNumbers, Prime | ||
| 653 | _aNumber theory | ||
| 856 | 4 | 0 | _uhttps://www.gutenberg.org/ebooks/69 |
| 999 |
_c42221 _d42221 |
||