Search results

Create the page "Proth primes" on this wiki! See also the search results found.

• Examples
  *[https://www.rieselprime.de/default.htm Riesel and Proth Prime Databse RPPDb] The <b>[[:Category:Carol-Kynea_prime|category]]</b> for Carol/Kynea primes holds example pages for some bases.
  11 KB (1,236 words) - 14:41, 3 September 2020
• Fermat number
  ...ber, and such primes are called '''Fermat primes'''. The only known Fermat primes are {{V|F}}₀,...,{{V|F}}₄. ...he sequence {{{V|p}}_{{Vn}}} is an infinite sequence of distinct primes.
  12 KB (1,913 words) - 14:35, 9 August 2021
• Sierpiński problem
  In early 2002, primes had been found for all but seventeen choices of {{Vk}}. At that point, the ...699]], [[Proth prime 2 24737|24737]], [[Proth prime 2 55459|55459]], and [[Proth prime 2 67607|67607]] (current status [https://www.primegrid.com/stats_sob_
  5 KB (650 words) - 10:25, 26 March 2024
• Paul Seelhoff
  :28 [[Proth prime]]s for 3 &le; {{Vk}} &le; 97 :Found factor [[Proth prime 2 5|{{Kbn|+|5|2|39}}]] of {{DGF|36}}
  2 KB (195 words) - 00:13, 15 January 2024
• Riesel and Proth Prime Database
  ...nd Proth Prime Database''' is a database mainly of [[Riesel prime]]s and [[Proth prime]]s and some others subjects like [[Aliquot sequence]]s or [[Home prim *[https://www.rieselprime.de/default.htm Riesel and Proth Prime Database main page]
  380 bytes (59 words) - 14:14, 24 January 2019
• Primality test
  *[[Proth's theorem]]: Used to test numbers of the form {{Kbn|+|k|n}} with 2<sup>{{Vn
  3 KB (501 words) - 05:20, 3 August 2021
• PSearch
  ...mputing project|distributed computing project]] in search of the largest [[Proth prime]]s. | At this date, it was the 15th largest prime number, and the 2nd largest Proth prime number.
  1 KB (182 words) - 08:17, 12 July 2020
• Generalized Fermat number
  In 1985, Dubner for the first time built a list of large primes of the form: b^{2^m}+1, ''b &ge; 2'' and ''m &ge; 1''. ...p.'' 67 (1998), pp. 441-446</ref> for the first time built a list of large primes of the form: a^{2^m}+b^{2^m}, ''b > a &
  5 KB (726 words) - 09:57, 12 September 2021
• PrimeGrid
  *Type Proth: :[[PrimeGrid 321 Prime Search|321 Prime Search]] searching for mega primes of the form {{Kbn|±|3|2|n}}.
  3 KB (458 words) - 10:28, 26 March 2024
• Sieving program
  *[[FermFact]] (performing sieving of Proth numbers) http://www.fermatsearch.org/FermFact-09b.zip ...f numbers of the form k&times;2ⁿ+/-1) http://www.underbakke.com/primes/
  2 KB (220 words) - 11:42, 7 March 2019
• Proth prime
  ...e form {{Kbn|+|k|n}} with 2^''n'' > ''k'' are often called Proth primes. *[[Proth's theorem]]
  656 bytes (91 words) - 07:02, 31 August 2020
• Riesel prime
  Although there's no official definition of a '''Riesel prime''' mostly all primes of the form {{Kbn|k|n}} with 2^{{Vn}} > {{Vk}} are called like th *[https://www.mersenneforum.org/showthread.php?t=13180 "Post Top-5000 Primes Here"]: [https://www.mersenneforum.org/showpost.php?p=208696 #1 (2010-03-17
  2 KB (279 words) - 03:48, 24 April 2024
• 15k Search
  :In order to do this we use the fastest programs possible to return primes of special forms. ...nes, written by Paul Jobling, novice users will be more likely to look for primes, and will find them quicker.
  3 KB (517 words) - 14:51, 15 February 2019
• Proth prime 2 1
  {{Proth prime |PRemarks=These n-values form the [[Fermat number|Fermat primes]].
  212 bytes (30 words) - 15:35, 2 October 2022
• Proth prime table
  Automatically generated table from available [[:Category:Proth prime|Proth primes]]. ==Primes table==
  750 bytes (108 words) - 14:39, 12 July 2021
• Proth prime small bases least n
  {{DISPLAYTITLE:Proth primes of the form {{Kbn|+|k|b|n}}, least ''n''-values}} Here are shown the least ''n'' ≥ 1 generating a [[Proth prime]] of the form {{Kbn|+|k|b|n}} for 2 ≤ ''b'' ≤ 1030 and 2 ≤ ''k'
  7 KB (789 words) - 11:31, 26 October 2023
• PrimeGrid Sierpiński base 5
  Finding primes for the [[Sierpiński number base 5]] problem. |include={Proth prime}:Pk,{Proth prime}:Pk
  2 KB (245 words) - 11:43, 5 September 2021
• Liskovets-Gallot conjectures
  ...ontinuing the [[CRUS Liskovets-Gallot]] subproject to find the remaining 9 primes required to prove the other 3 conjectures. [[Valery Liskovets]] studied the list of {{Kbn|+|k|n}} primes and observed, that the {{Vk}}'s ({{Vk}} divisible by 3)
  2 KB (360 words) - 10:31, 26 March 2024
• CRUS Liskovets-Gallot
  ...|Riesel]] and [[Proth prime|Proth]] {{Vk}}-values, divisible by 3, with no primes for {{Vn}}-values of a given parity. ...roven by [[Yves Gallot]], who provided examples for all four cases (Riesel/Proth, even/odd). Gallot further conjectured that these four examples are the sma
  7 KB (957 words) - 22:40, 10 June 2023
• Statistics
  | [[:Category:Mersenne prime|Mersenne primes]] || number || style="text-align:right;"|{{Num|{{#expr:{{PAGESINCATEGORY:Me | [[:Category:Riesel 2|Riesel primes {{Kbn|k|2|n}}]] || {{Vk}}-value || style="text-align:right;"|{{Num|{{PAGESI
  11 KB (1,385 words) - 17:23, 5 April 2024

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