Search results

Create the page "Primes by name" on this wiki! See also the search results found.

• GIMPS PrimeNet reports
  ...rs#supercomputer|supercomputer's]] operating status, automatically updated by the server every hour, at the start of the hour. It also shows the current ...st also includes factors found for exponents already known to be composite by way of a [[Lucas-Lehmer test]]. The list generally has more than a full day
  7 KB (1,137 words) - 15:30, 13 August 2020
• Sierpiński-Riesel Base 5
  ...Project''' is a [[distributed computing project]]. It was formerly managed by users of mersenneforum.org, and is currently a subproject on [[PrimeGrid]]. ...e smallest possible [[Riesel number base 5]]. To prove this, one must find primes for all {{Vk}} below the smallest known number.
  2 KB (231 words) - 11:42, 5 October 2020
• 15k Search
  :In order to do this we use the fastest programs possible to return primes of special forms. :15k was the first such form exploited by our group, for it's heavy candidate density.
  3 KB (517 words) - 14:51, 15 February 2019
• PrimeNet summary report
  ...rs#Supercomputer|supercomputer]]'s operating status, automatically updated by the server every hour, at the start of the hour. It also shows the current Broken down by activity in the past 24 hours, 7 days, and 30 days.
  7 KB (1,073 words) - 08:46, 15 May 2024
• Riesel problem 1
  ...s smaller than {{Num|509203}} that have no known prime. These are reserved by the [[PrimeGrid The Riesel Problem|PrimeGrid Riesel Problem]] search. ...+1</sup>. <ref>[http://www.prothsearch.com/rieselprob.html Riesel problem] by [[Wilfrid Keller]]</ref>
  6 KB (689 words) - 18:14, 4 April 2024
• Tutorial LLR
  #Start LLR by double-clicking on LLR.exe ...ewPGen-file in Input file and choose a name for the Output file (where the primes are reported)
  2 KB (337 words) - 13:24, 20 February 2019
• RMA.NET
  '''RMA.NET''' is a free program written by Shane Findley. ...ftware, can be used by the [[15k Search]], or anyone interested in finding primes.
  2 KB (353 words) - 14:53, 20 February 2019
• Mtsieve
  ...ulti-threaded sieve framework for different [[sieving program]]s developed by [[Mark Rodenkirch]].
  2 KB (338 words) - 06:58, 28 March 2023
• Carol-Kynea prime
  ...y [[Cletus Emmanuel]] starting in 1995, the search for new Carol and Kynea primes is now coordinated in a [[MersenneForum]] thread, and the results are store ...)^2</math> is equal to 1, and thus yields -1 when 2 is subtracted from it. By definition -1 is not prime. If {{Vn}} is negative then <math>(b^n±1)^2</ma
  8 KB (1,172 words) - 00:38, 6 July 2023
• Multifactorial Prime Search
  *[http://mfprimes.cba.pl Search] maintained by [[Marian Otremba]] *[https://www.mersenneforum.org/rogue/multifactorial.html Old search] by [[Mark Rodenkirch]]
  572 bytes (74 words) - 14:47, 20 July 2021
• Williams prime MM 10
  ...mbers; see [https://stdkmd.net/nrr/8/89999.htm Factorizations of 899...99] by [[Makoto Kamada]]<br>Search limit given at {{OEIS|l|A056725}} is the highes
  1 KB (143 words) - 02:41, 5 November 2020
• Williams prime MM least
  {{DISPLAYTITLE:Williams primes of the form {{Kbn|(b-1)|b|n}}, least {{Vn}}-values}} *Base 128: {{NRi|127|n}} (first {{Vn}}-value divisible by 7)
  2 KB (211 words) - 07:40, 1 August 2021
• Woodall prime
  {{DISPLAYTITLE:(Generalized) Woodall primes}} ...n}} are given with {{Vb}} &ge; 2, {{Vn}} &ge; 1 and listed as "Gen Woodall primes".
  1 KB (205 words) - 09:53, 13 March 2024
• Cullen prime
  {{DISPLAYTITLE:(Generalized) Cullen primes}} ...|n|b|n}} are given with {{Vb}} &ge; 2, {{Vn}} &ge; 1 and listed as "Cullen primes".
  2 KB (286 words) - 17:22, 7 May 2023
• Williams prime MP least
  {{DISPLAYTITLE:Williams primes of the form {{Kbn|+|(b-1)|b|n}}, least {{Vn}}-values}} *Base 512: {{NPr|511|n}} (first {{Vn}}-value divisible by 9)
  4 KB (464 words) - 18:07, 21 June 2024
• Williams prime PP least
  {{DISPLAYTITLE:Williams primes of the form {{Kbn|+|(b+1)|b|n}}, least {{Vn}}-values}} Values of bases {{Vb}} ≡ 1 mod 3 are always divisible by 3, so not listed here.
  2 KB (306 words) - 03:50, 28 May 2024
• Riesel prime small bases least n
  {{DISPLAYTITLE:Riesel primes of the form {{Kbn|k|b|n}}, least {{Vn}}-values}} Here are listed the wanted values for which no primes were found yet.
  6 KB (684 words) - 09:40, 17 March 2024
• Leyland number
  ...these numbers in 1994. The first few nontrivial Leyland numbers are given by OEIS sequence {{OEIS|A076980}}. .../www.mersenneforum.org/showpost.php?p=521992&postcount=263 Leyland number] by [[Hans Havermann ]]</ref>, dates and persons of finding and proving if avai
  8 KB (906 words) - 09:59, 5 January 2023
• Saouter number
  ...ex/docid/73966/filename/RR-2728.pdf Y.Saouter: "A Fermat-Like Sequence and Primes of the Form 2h*3^n+ 1, 1995]</ref>.
  869 bytes (128 words) - 07:02, 15 August 2019
• Riesel prime const 333333
  :Not sure if such a lot of values can be handled by template. [[User:Karbon|Karbon]] ([[User talk:Karbon|talk]]) 07:54, 19 Augu ...arks=For all primes of [[PrimeGrid]] see [https://www.primegrid.com/primes/primes.php?project=TPS&factors=+&only=ALL&announcements=ALL&sortby=size&dc=no&sear
  639 bytes (69 words) - 07:54, 19 August 2019

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)