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 "Vn" on this wiki! See also the search results found.
- The sieve ({{Vn}}<50M) reached the optimal sieve zone and it's now suspended.2 KB (326 words) - 10:29, 26 March 2024
- ...dd positive [[integer]] and {{Vn}} is a positive integer such that 2<sup>{{Vn}}</sup> > {{Vk}}. Without the condition that 2<sup>{{Vn}}</sup> > {{Vk}}, all odd integers greater than 1 would be Proth numbers, b670 bytes (104 words) - 10:59, 9 July 2021
- ...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
- ...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
- ...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
- ...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
- ...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
- {{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-23660003 KB (264 words) - 22:08, 5 July 2023
- ...umber" class="fixhead"|Nash!!data-sort-type="number" class="fixhead"|Max {{Vn}},\n¦-,,\n¦}948 bytes (121 words) - 13:08, 21 July 2021
- {{HistR|2006-09-12|RPS K15 Drive|86959}} for {{Vn}} > 10000002 KB (252 words) - 13:29, 5 May 2024
- {{HistR|2011-12-31|NPLB Drive 12C}}, for 350001 ≤ {{Vn}} ≤ 425000 {{HistR|2010-03-26|NPLB Drive 12B}}, for 250001 ≤ {{Vn}} ≤ 3500003 KB (329 words) - 07:59, 17 August 2021
- {{HistR|2020-12-01|Tyler NeSmith|564907}}, for {{Vn}}>600000 {{HistR|2011-12-31|NPLB Drive 12C|284287}}, for 350001 ≤ {{Vn}} ≤ 4250002 KB (185 words) - 04:16, 5 May 2024
- ...is the highest {{Vn}} searched, however, there is a gap from 230000 ≤ {{Vn}} ≤ 1000000.1 KB (143 words) - 02:41, 5 November 2020
- |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
- |WiRemarks=Unknown status for 200000 ≤ {{Vn}} ≤ 263893.<br>The {{OEIS|l|A046867}}366 bytes (36 words) - 20:54, 31 July 2021
- {{HistC|2019-04-17|100000|Dylan Delgado}}, double checked {{Vn}} = 1-5000394 bytes (38 words) - 20:54, 31 July 2021
- {{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 generate2 KB (211 words) - 07:40, 1 August 2021
- {{HistC|2022-07-22|[[GF_Divisor 12 20267499|GF Divisors]] for {{Vn}} = 20267499|Ryan Propper}} {{HistC|2020-10-12|[[GF_Divisor 7 18233956|GF Divisors]] for {{Vn}} = 18233956|Gary B. Gostin|559634}}2 KB (267 words) - 21:47, 5 July 2023
- |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 only3 KB (432 words) - 18:48, 9 April 2023
- {{HistC|1979|1500-4000|Gordon V. Cormack,Hugh C. Williams}}, missed {{Vn}}=15183 KB (390 words) - 10:00, 25 August 2021