Search results

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

• Carol-Kynea prime 10
  {{HistR|2022-05-13|Ryan Propper|605837}}, for {{Vn}}>250000
  1 KB (144 words) - 16:10, 29 March 2024
• Splitting a sieve file
  ...txt</code> to <code>4.txt</code> with equally split candidates sorted by {{Vn}}. ...txt</code> to <code>4.txt</code> with equally split candidates sorted by {{Vn}}.
  1 KB (203 words) - 18:52, 2 October 2022
• Mersenne prime
  ...e; {{V|M_n}} may be [[Composite number|composite]] even though {{Vn}} is prime. For example, <math>2^{11} - 1 = 23 \cdot 89</math>.
  5 KB (857 words) - 14:53, 19 September 2021
• Fermat number
  :{{V|F}}_{{Vn}} = {{Kbn|+|1|2|2ⁿ}} where {{Vn}} is a [[non-negative]] [[integer]]. The first eight Fermat numbers are (se
  12 KB (1,913 words) - 14:35, 9 August 2021
• Base 2 Home Prime Results
  ===Table of open Home Primes up to {{Vn}} = {{Num|12000}}=== ! {{Vn}} || Index || Size || Last edit || Participant
  2 KB (175 words) - 18:45, 14 December 2023
• Proth prime 2 1089927
  {{HistR|2020-03-22|(Alex_soldier)}} upto {{Vn}}=1000000
  432 bytes (32 words) - 13:38, 2 January 2023
• Proth prime 2 12321
  {{HistR|2020-06-05|(Alex_soldier),Alexander Tsupko}} upto {{Vn}}=50000000
  498 bytes (31 words) - 13:34, 2 January 2023
• Proth prime 2 1943873
  {{HistR|2022-12-02|(Alex_soldier)}} upto {{Vn}}=10000000
  334 bytes (32 words) - 15:12, 27 January 2023
• Conjectures 'R Us
  ...d in instances where all {{Vn}}'s are covered by one trivial factor, all {{Vn}}'s are covered by algebraic factors or a combination of algebraic and triv ...or the forms {{Kbn|±|k|2|n}} where {{Vn}} is always odd '''and''' where {{Vn}} is always even.
  3 KB (503 words) - 02:20, 1 May 2024
• No Prime Left Behind
  ...]s of the form {{Kbn|k|2|n}} with odd {{Vk}} and 300 < {{Vk}} < 1001 and {{Vn}} > 260000 not reserved by others with highly presieved ranges.
  745 bytes (111 words) - 02:17, 1 May 2024
• Wacław Sierpiński
  ...iński number]]s after him) such that {{Kbn|+|k|n}} is composite for all {{Vn}}.
  592 bytes (86 words) - 00:38, 15 January 2024
• Sierpiński number
  ...r''' is an odd natural number {{Vk}} such that all {{Kbn|+|k|n}} for all {{Vn}} are [[Composite number|composite]].
  324 bytes (48 words) - 13:37, 8 April 2023
• Sierpiński problem
  ...e {{Vk}} is odd and {{Vn}} > 0. If, for some fixed {{Vk}}, every integer {{Vn}} yields a [[composite number]] {{V|N}}, then {{Vk}} is said to be a '''[[S ...}} = 78557 is a Sierpiński number. The proof shows that every choice of {{Vn}} falls into at least one of seven categories, where each category guarante
  5 KB (650 words) - 10:25, 26 March 2024
• Primality test
  ...h's theorem]]: Used to test numbers of the form {{Kbn|+|k|n}} with 2^{{Vn}} > {{Vk}}, making it useful in several [[distributed computing proje
  3 KB (501 words) - 05:20, 3 August 2021
• LLR
  ...vailable to perform primality test on numbers of the form {{Vk}}•2^{{Vn}}±{{V|c}}. *the fastest algorithms are for base two numbers (with {{Vk}} < 2^{{Vn}}):
  2 KB (300 words) - 22:00, 16 December 2023
• Generalized Fermat number
  If the {{Vk}}-value is a square and the {{Vn}}-value even the Proth prime {{Kbn|+|k|b|n}} is also a Generalized Fermat n
  5 KB (726 words) - 09:57, 12 September 2021
• PrimeGrid
  ...ermat Prime Search]]: searching for primes of the form {{Kbn|+|1|b|2^{{Vn}}}}. ...on ({{V|p}}+{{V|d•n}}) that yields primes for 27 consecutive values of {{Vn}}.
  3 KB (458 words) - 10:28, 26 March 2024
• Twin Prime Search
  * [[Twin Prime Search 222333|{{Vn}}=222333 twin/Sophie Germain drive]] * [[Twin Prime Search 333444|{{Vn}}=333444 twin/Sophie Germain drive]]
  826 bytes (100 words) - 11:04, 21 March 2024
• Riesel Prime Search
  ...{Vk}}-values that can produce many primes in the given range of exponent {{Vn}}
  845 bytes (120 words) - 02:21, 1 May 2024
• Riesel prime
  ...'''Riesel prime''' mostly all primes of the form {{Kbn|k|n}} with 2^{{Vn}} > {{Vk}} are called like this on many pages. Different from this definition all values {{Vn}} ≥ 1 are listed in {{SITENAME}}.
  2 KB (279 words) - 03:48, 24 April 2024
• Riesel Sieve
  The sieve ({{Vn}}<50M) reached the optimal sieve zone and it's now suspended.
  2 KB (326 words) - 10:29, 26 March 2024
• Proth number
  ...dd positive [[integer]] and {{Vn}} is a positive integer such that 2^{{Vn}} > {{Vk}}. Without the condition that 2^{{Vn}} > {{Vk}}, all odd integers greater than 1 would be Proth numbers, b
  670 bytes (104 words) - 10:59, 9 July 2021
• Sierpiński number base 5
  ...of 3, 7, 13, 31 or 601 (the [[covering set]]) depending on the value of {{Vn}}, so it is always composite.
  556 bytes (83 words) - 10:57, 14 October 2020
• Riesel problem 1
  ...of integers {{Vk}} such that {{Kbn|k|2|n}} is not prime for any integer {{Vn}}. He showed that the number {{Vk}} = ''{{Num|509203}}'' has this property. ...s property. To prove this, it suffices to show that there exists a value {{Vn}} such that {{Kbn|k|2|n}} is prime for each {{Vk}} < {{Num|509203}}.
  6 KB (689 words) - 18:14, 4 April 2024
• Cullen number
  ...3|1354828}}, {{PP|87775|6328548}}, {{PP|89536|6679881}} and for no other {{Vn}} < {{Num|{{GP|Cullen prime 2|CuMaxn}}}} ({{OEIS|l|A005849}}).
  2 KB (252 words) - 17:39, 31 August 2021
• Carol-Kynea prime
  ...ields -1 when 2 is subtracted from it. By definition -1 is not prime. If {{Vn}} is negative then <math>(b^n±1)^2</math> is not necessarily an integer.
  8 KB (1,172 words) - 00:38, 6 July 2023
• Riesel prime 2 1
  ...s=For this {{Vk}}-value these are the [[Mersenne prime]]s. All exponents {{Vn}} < {{Num|63000000}} have been [https://www.mersenne.org/report_milestones/
  2 KB (288 words) - 11:41, 3 April 2023
• Riesel prime 2 7
  {{HistC|2021-06-17|5000000|Gary Barnes|581293}}, released, double-check for {{Vn}}=1000000-4230000, results included {{HistR|2009-01-10|Predrag Minovic|157931}}, range {{Vn}}=2210000-2366000
  3 KB (264 words) - 22:08, 5 July 2023
• Riesel 2 Low-weight
  ...umber" class="fixhead"|Nash!!data-sort-type="number" class="fixhead"|Max {{Vn}},\n¦-,,\n¦}
  948 bytes (121 words) - 13:08, 21 July 2021
• Riesel prime 2 15
  {{HistR|2006-09-12|RPS K15 Drive|86959}} for {{Vn}} > 1000000
  2 KB (252 words) - 13:29, 5 May 2024
• Riesel prime 2 2145
  {{HistR|2011-12-31|NPLB Drive 12C}}, for 350001 &le; {{Vn}} &le; 425000 {{HistR|2010-03-26|NPLB Drive 12B}}, for 250001 &le; {{Vn}} &le; 350000
  3 KB (329 words) - 07:59, 17 August 2021
• Riesel prime 2 2805
  {{HistR|2020-12-01|Tyler NeSmith|564907}}, for {{Vn}}>600000 {{HistR|2011-12-31|NPLB Drive 12C|284287}}, for 350001 &le; {{Vn}} &le; 425000
  2 KB (185 words) - 04:16, 5 May 2024
• Williams prime MM 10
  ...is the highest {{Vn}} searched, however, there is a gap from 230000 &le; {{Vn}} &le; 1000000.
  1 KB (143 words) - 02:41, 5 November 2020
• Riesel prime 128 127
  |RRemarks=This sequence is independently searched only for {{Vn}}-values == 0 mod 7 of {{NRi|127|n}}.<br>See also {{NWi|MM|128|n}}
  3 KB (327 words) - 05:57, 19 April 2024
• Williams prime MM 11
  |WiRemarks=Unknown status for 200000 &le; {{Vn}} &le; 263893.<br>The {{OEIS|l|A046867}}
  366 bytes (36 words) - 20:54, 31 July 2021
• Williams prime MM 13
  {{HistC|2019-04-17|100000|Dylan Delgado}}, double checked {{Vn}} = 1-5000
  394 bytes (38 words) - 20:54, 31 July 2021
• Williams prime MM least
  {{DISPLAYTITLE:Williams primes of the form {{Kbn|(b-1)|b|n}}, least {{Vn}}-values}} Here are shown the least {{Vn}}-value ≥ 1 for any base {{Vb}} with 2 ≤ {{Vb}} ≤ 2049 which generate
  2 KB (211 words) - 07:40, 1 August 2021
• Proth prime 2 7
  {{HistC|2022-07-22|[[GF_Divisor 12 20267499|GF Divisors]] for {{Vn}} &#61; 20267499|Ryan Propper}} {{HistC|2020-10-12|[[GF_Divisor 7 18233956|GF Divisors]] for {{Vn}} &#61; 18233956|Gary B. Gostin|559634}}
  2 KB (267 words) - 21:47, 5 July 2023
• Proth prime 2 9
  |PRemarks=The {{OEIS|l|A002256}}<br>For all even {{Vn}}-values {{Kbn|+|9|2|n}} is a [[Generalized Fermat number]]. ...-01|4000000-9000000|PrimeGrid Fermat Divisor Search|P#8778#132715}}, odd {{Vn}}-values only
  3 KB (432 words) - 18:48, 9 April 2023
• Proth prime 2 15
  {{HistC|1979|1500-4000|Gordon V. Cormack,Hugh C. Williams}}, missed {{Vn}}=1518
  3 KB (390 words) - 10:00, 25 August 2021
• Woodall prime
  The restriction of {{Vn}}+2 > {{Vb}} should then be claimed, otherwise every prime could be called ...Wiki the primes of the forms {{Kbn|n|b|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
• Woodall prime table
  ...able"\n!Base\n!max&nbsp;{{Vn}}\n!style="width:9%"¦Date\n!#\n!Primes for {{Vn}},,,\n¦}
  792 bytes (106 words) - 04:19, 19 April 2023
• Woodall prime 10
  {{HistR|2023-04-19|Ryan Propper|628813}} for 1000000&le;{{Vn}}&le;1600000 {{HistR|2023-04-01|Ryan Propper|627674}} for {{Vn}}&le;1000000
  684 bytes (71 words) - 08:21, 30 April 2023
• Cullen prime
  The restriction of {{Vn}}+2 > {{Vb}} should then be claimed, otherwise every prime could be called ...ki the primes of the forms {{Kbn|+|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
• Cullen prime table
  ...ss="wikitable sortable"\n!Base\n!max&nbsp;{{Vn}}\n!Date\n!#\n!Primes for {{Vn}},,,\n¦}
  733 bytes (100 words) - 04:19, 19 April 2023
• Cullen prime 3
  {{HistR|2023-07-03|Mark Rodenkirch|633588}} to {{Vn}}=3000000
  697 bytes (65 words) - 18:55, 19 July 2023
• Cullen prime 4
  {{HistR|2023-04-28|Mark Rodenkirch|629610}} to {{Vn}}=500000
  849 bytes (85 words) - 19:15, 14 July 2023
• Cullen prime 5
  {{HistR|2023-04-28|Mark Rodenkirch|629610}} to {{Vn}}=500000
  407 bytes (42 words) - 19:18, 14 July 2023
• Cullen prime 6
  {{HistR|2023-04-28|Mark Rodenkirch|629610}} to {{Vn}}=500000
  848 bytes (88 words) - 18:59, 17 July 2023
• Cullen prime 7
  {{HistR|2023-04-28|Mark Rodenkirch|629610}} to {{Vn}}=500000
  532 bytes (56 words) - 19:23, 14 July 2023

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