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.
- {{HistR|2022-05-13|Ryan Propper|605837}}, for {{Vn}}>2500001 KB (144 words) - 16:10, 29 March 2024
- ...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
- ...e; {{V|M<sub>n</sub>}} 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
- :{{V|F}}<sub>{{Vn}}</sub> = {{Kbn|+|1|2|2<sup>n</sup>}} where {{Vn}} is a [[non-negative]] [[integer]]. The first eight Fermat numbers are (se12 KB (1,913 words) - 14:35, 9 August 2021
- ===Table of open Home Primes up to {{Vn}} = {{Num|12000}}=== ! {{Vn}} || Index || Size || Last edit || Participant2 KB (175 words) - 18:45, 14 December 2023
- {{HistR|2020-03-22|(Alex_soldier)}} upto {{Vn}}=1000000432 bytes (32 words) - 13:38, 2 January 2023
- {{HistR|2020-06-05|(Alex_soldier),Alexander Tsupko}} upto {{Vn}}=50000000498 bytes (31 words) - 13:34, 2 January 2023
- {{HistR|2022-12-02|(Alex_soldier)}} upto {{Vn}}=10000000334 bytes (32 words) - 15:12, 27 January 2023
- ...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) - 04:44, 27 March 2024
- ...]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.752 bytes (111 words) - 11:31, 5 October 2020
- ...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
- ...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
- ...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 guarante5 KB (650 words) - 10:25, 26 March 2024
- ...h's theorem]]: Used to test numbers of the form {{Kbn|+|k|n}} with 2<sup>{{Vn}}</sup> > {{Vk}}, making it useful in several [[distributed computing proje3 KB (501 words) - 05:20, 3 August 2021
- ...vailable to perform primality test on numbers of the form {{Vk}}•2<sup>{{Vn}}</sup>±{{V|c}}. *the fastest algorithms are for base two numbers (with {{Vk}} < 2<sup>{{Vn}}</sup>):2 KB (300 words) - 22:00, 16 December 2023
- If the {{Vk}}-value is a square and the {{Vn}}-value even the Proth prime {{Kbn|+|k|b|n}} is also a Generalized Fermat n5 KB (726 words) - 09:57, 12 September 2021
- ...ermat Prime Search]]: searching for primes of the form {{Kbn|+|1|b|2<sup>{{Vn}}</sup>}}. ...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 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
- ...{Vk}}-values that can produce many primes in the given range of exponent {{Vn}}852 bytes (120 words) - 20:24, 7 March 2024
- ...'''Riesel prime''' mostly all primes of the form {{Kbn|k|n}} with 2<sup>{{Vn}}</sup> > {{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