Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Search results
Create the page "Primes" on this wiki! See also the search results found.
Page title matches
- *'''#''': number count of the Mersenne primes linked to that prime page *[https://www.mersenne.org/primes/ List of known Mersenne prime numbers] at Mersenne.org2 KB (360 words) - 09:44, 6 March 2019
- *[https://primes.utm.edu/primes/search.php All SoB primes]2 KB (163 words) - 14:20, 7 March 2019
- Template: Navbox Riesel primes {{Navbox Riesel primes}}3 KB (332 words) - 08:09, 25 March 2024
- Template: Navbox Proth primes {{Navbox Proth primes}}2 KB (284 words) - 08:40, 26 July 2021
File:Twin Prime Search primes and twins 480k-500k.txt LLR prime and twin testing log for primes found by the [[Twin Prime Search 480000]] variable-{{Vn}} subproject in the(188 KB) - 10:10, 21 March 2024
Page text matches
- *[https://www.rieselprime.de/default.htm RieselProth Database]: my Primes Homepage since 2007 *[https://primes.utm.edu/bios/page.php?id=756 Top5000 Prover code]: My primes found, latest {{PP|126269|(290^124116-1)^2-2}}3 KB (328 words) - 07:35, 3 July 2020
- Lists of primes for bases ''b'' and ''n''-values can be found here: ...e included as a separate page.</ref> !! Smallest <ref>The list of smallest primes of any base is an ASCII file for 2 ≤ ''b'' ≤ 1024. For unknown values o5 KB (744 words) - 07:30, 5 August 2019
- "en": "List of primes",1 KB (137 words) - 18:49, 13 December 2018
- :If no Carol primes are given, the page is categorized into [[:Category:Carol-Kynea without Car :If no Kynea primes are given, the page is categorized into [[:Category:Carol-Kynea without Kyn4 KB (501 words) - 01:58, 17 May 2021
- ==History for Carol primes== ==History for Kynea primes==5 KB (537 words) - 08:17, 9 October 2020
- Get the parameter "CKBase" from "Carol-Kynea base 2" primes3 KB (311 words) - 18:08, 13 August 2021
- ...y generated table from available [[:Category:Carol-Kynea prime|Carol-Kynea primes]]. ==Primes table==936 bytes (125 words) - 11:11, 11 June 2019
- Shows a link to a prime of the [https://t5k.org/primes/home.php Top 5000 Primes Pages]. [[Category:Templates]]</noinclude><includeonly>[https://t5k.org/primes/page.php?id={{{1}}} {{{2}}}]</includeonly>522 bytes (68 words) - 21:41, 7 May 2024
- The <b>[[:Category:Carol-Kynea_prime|category]]</b> for Carol/Kynea primes holds example pages for some bases. * field: rieselk_id = 4 (-> "1" = Mersenne primes)11 KB (1,236 words) - 14:41, 3 September 2020
- Mersenne primes are named after [[Marin Mersenne]], a French monk and mathematician, who wa ...ring the largest Mersenne Primes to date. See the [[list of known Mersenne primes]] for more details.3 KB (450 words) - 14:37, 21 August 2019
- *'''#''': number count of the Mersenne primes linked to that prime page *[https://www.mersenne.org/primes/ List of known Mersenne prime numbers] at Mersenne.org2 KB (360 words) - 09:44, 6 March 2019
- ...enerally, [[Mersenne number]]s (not necessarily primes, but candidates for primes) are numbers that are one less than a power of two; hence, ...l to the sum of their proper divisors. Historically, the study of Mersenne primes was motivated by this connection; in the 4th century BC [[Euclid]] demonstr5 KB (857 words) - 14:53, 19 September 2021
- ...ant role in opening up new windows onto our understanding, not just of the primes, but in many other areas of mathematics as well.16 KB (2,614 words) - 11:48, 14 January 2024
- ==Mersenne primes== In 1644 he conjectured that the only [[Mersenne prime|Mersenne primes]] less than or equal to M(257) were:<br>M(2), M(3), M(5), M(7), M(13), M(1711 KB (1,582 words) - 01:17, 15 January 2024
- 733 bytes (107 words) - 11:27, 14 January 2024
- *[http://primes.utm.edu/bios/includes/nollnote.php Entry at] [[The Prime Pages]]2 KB (333 words) - 12:40, 9 February 2022
- ...that he wrote]]) and has been involved in the discovery of seven Mersenne primes, namely: *[http://primes.utm.edu/bios/page.php?lastname=Slowinski The Prime Pages - David Slowinski]1 KB (213 words) - 23:53, 14 January 2024
- ...ber, and such primes are called '''Fermat primes'''. The only known Fermat primes are {{V|F}}<sub>0</sub>,...,{{V|F}}<sub>4</sub>. ...he sequence {{{V|p}}<sub>{{Vn}}</sub>} is an infinite sequence of distinct primes.12 KB (1,913 words) - 14:35, 9 August 2021
- He is listed as co-discoverer of [[M49]], [[M50]] and [[M51]] Mersenne primes.192 bytes (26 words) - 12:04, 21 August 2019
- ...'' and the superposition of the corresponding stencils to reveal those few primes having these residues ''R''. ...Lehmer presented data to contradict this conjecture, especially for small primes, and [[Christopher Hooley]] later showed that this follows from the [[Gener6 KB (1,033 words) - 01:13, 15 January 2024