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 "K,n-pair" on this wiki! See also the search results found.
- *[[Factor]] sizes <math><2^{95}</math> and '''[[value k]]''' <math><2^{63.9}</math>5 KB (765 words) - 14:54, 25 February 2019
- ...ssSize: defines how far many bits of the sieve each TF block processes (in K bits). Larger values may lead to less wasted cycles by reducing the number17 KB (2,524 words) - 12:39, 24 January 2019
- A '''Riesel number''' is a value of ''k'' such that {{Kbn|k|n}} is always composite for all [[natural number]]s.827 bytes (112 words) - 08:21, 25 March 2024
- *[[Proth's theorem]]: Used to test numbers of the form {{Kbn|+|k|n}} with 2<sup>{{Vn}}</sup> > {{Vk}}, making it useful in several [[distrib3 KB (500 words) - 05:03, 11 August 2024
- | k × b<sup>n</sup>±c general numbers | k × b<sup>n</sup>±c2 KB (314 words) - 21:23, 29 August 2019
- ...t number]]s <math>F_{n,2} = 4^{3^n}+2^{3^n}+1</math> with k = 5 instead of k = 3.2 KB (402 words) - 01:16, 11 August 2024
- :<math>\sum_{k=1}^{n}\,(2k-1)\,=\,n^{2}</math> ::<math>\sum_{k=1}^{1}\,(2k-1)\,=\,2-1\,=\,1^{2}</math>4 KB (679 words) - 13:57, 20 February 2019
- ...e of the algebraic form <math>2kp+1</math> for some positive integer <math>k</math> and furthermore must also leave a remainder of either 1 or 7 upon di6 KB (962 words) - 10:08, 7 March 2019
- **[[Lucas-Lehmer-Riesel algorithm]] for {{Kbn|k|n}} numbers. **[[Proth's theorem|Proth algorithm]] for {{Kbn|+|k|n}} numbers.2 KB (300 words) - 22:00, 16 December 2023
- ...1</math>, where ''k'' is a non-negative integer. This means that <math>a^{k(p-1)} - 1</math>5 KB (814 words) - 01:35, 12 March 2019
- ...operatorname{tlog}[p]</math> to all locations <math>\operatorname{soln1} + k*p</math> of the sieve array. ...operatorname{tlog}[p]</math> to all locations <math>\operatorname{soln2} + k*p</math> of the sieve array.10 KB (1,763 words) - 02:56, 12 March 2019
- ...er being tested for primality, and <math>N = 2^n\,k + 1</math> where <math>k</math> is an odd number. Then consider the sequence <math>a^k</math>, <math>a^{2k}</math>, <math>a^{4k}</math>..., <math>a^{N-1}</math> m3 KB (428 words) - 01:22, 11 August 2024
- ...F_{n,2}</math> numbers can be proven prime by using [[Pépin's test]] with k=5. ...[[Generalized Fermat number]]s for any [[Proth prime|Proth primes {{Kbn|+|k|n}}]] are listed as ''GF Divisor'' on their own page. They are listed as ''5 KB (774 words) - 07:39, 27 May 2024
- ...rime Search|Proth Prime Search]]: searching for primes of the form {{Kbn|+|k|2|n}}. ...ed|Proth Prime Search Extended]]: searching for primes of the form {{Kbn|+|k|2|n}}.3 KB (458 words) - 10:28, 26 March 2024
- *First, list out all the integers <math>1 \leq k \leq N</math>. ...ssary because all composite numbers <math>11 \geq \sqrt{N} = 10 \geq \sqrt{k}</math> have already been crossed out.4 KB (657 words) - 01:17, 11 August 2024
- ...t that looks for large [[twin prime]]s ([[Riesel prime|Riesel type]] {{Kbn|k|n}}) of world record size.826 bytes (100 words) - 11:04, 21 March 2024
- :The project is searching for [[Riesel prime]]s {{Kbn|k|n}}, {{Vk}} > 1.3 KB (330 words) - 15:18, 3 July 2024
- | <code>\sinh k, \cosh l, \tanh m, \coth n</code> | <math>\sinh k, \cosh l, \tanh m, \coth n</math>33 KB (4,920 words) - 08:33, 15 May 2024
- factor | k*2^n+13 KB (491 words) - 13:39, 1 February 2019
- ==Working on the k,n pair==888 bytes (145 words) - 13:40, 1 February 2019