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 "1" on this wiki! See also the search results found.
Page title matches
- |GFNb=1135 bytes (12 words) - 08:00, 11 September 2021
- |GFNb=1281 bytes (22 words) - 06:33, 18 May 2024
- |GFNb=1194 bytes (20 words) - 07:11, 18 May 2024
- |GFNb=1143 bytes (12 words) - 07:14, 18 May 2024
- |GFNb=1131 bytes (12 words) - 09:26, 8 September 2021
- |GFNb=1145 bytes (12 words) - 00:38, 20 May 2024
- |GFNb=1133 bytes (12 words) - 12:31, 8 September 2021
- |GFNb=1134 bytes (12 words) - 12:51, 8 September 2021
- |GFNb=1155 bytes (12 words) - 13:01, 8 September 2021
- |GFNb=1123 bytes (12 words) - 15:37, 8 September 2021
- |GFNb=1124 bytes (12 words) - 06:48, 10 September 2021
- |GFNb=1129 bytes (12 words) - 08:08, 10 September 2021
- |GFNb=1137 bytes (12 words) - 08:12, 10 September 2021
- |GFNb=1125 bytes (12 words) - 08:15, 10 September 2021
- |GFNb=1124 bytes (12 words) - 08:44, 10 September 2021
- |GFNb=1129 bytes (12 words) - 08:50, 10 September 2021
- |GFNb=1128 bytes (12 words) - 09:49, 10 September 2021
- |GFNb=1138 bytes (12 words) - 10:00, 10 September 2021
- |GFNb=1 1,16173 bytes (13 words) - 11:47, 13 September 2021
- |GFNb=1133 bytes (12 words) - 12:13, 14 September 2021
Page text matches
- ...senne number successfully double checked was 2<sup>{{Num|666666667}}</sup>-1, with {{Num|200686664}} digits. It was tested and double checked by LaurV.2 KB (415 words) - 21:32, 12 February 2020
- ...actors of the [[Mersenne number]] M(3326400) = 2<sup>{{Num|3326400}}</sup>-1.366 bytes (42 words) - 12:49, 21 February 2019
- ...ports, it lists the current [[bit level]] and [[P-1 factorization method|P-1]] [[bounds]] for a given list of exponents, that have no known factors.524 bytes (78 words) - 13:12, 21 February 2019
- ...of finding a [[Mersenne prime]], many GIMPS users purposely skipped the P-1 stage to spend more time doing L-L first-time tests. ...sts are graphed, with known factors overlaid to show how close any known P-1 test(s) were to finding the factor(s). A similar graph shows known factors9 KB (1,396 words) - 15:42, 25 February 2019
- :<math>2kp+1</math> where <math>p</math> is the [[exponent]] in <math>2^p-1</math>. <math>\begin{align}2^{23}-1 &= 8388607\\&= 47 * 178481\\702 bytes (99 words) - 10:43, 25 October 2020
- *Numbers of the form <math>2^{4k+2}+1</math> have the following '''Aurifeuillian factorization''': [http://mathwo ::<math>2^{4k+2}+1 = (2^{2k+1}-2^{k+1}+1)\cdot (2^{2k+1}+2^{k+1}+1)</math>10 KB (1,257 words) - 08:04, 24 June 2019
- {{V|C<sub>n</sub>}} is [[prime]] for {{Vn}} = 1, 141, {{PP|40087|4713}}, {{PP|38112|5795}}, {{PP|37374|6611}}, {{PP|23436|12 KB (252 words) - 17:39, 31 August 2021
- *[[GMP-ECM]] (performing ECM, P-1, and P+1) http://gforge.inria.fr/projects/ecm/ ...ime|MPrime]] (for Linux , FreeBSD, and MacOSX) (performing ECM, P-1, and P+1 to search for factors of a × b<sup>n</sup> ± c) ftp://mersenne.org/g2 KB (273 words) - 21:53, 8 July 2023
- *dmdsieve: search for factors of numbers of the form 2*k*(2<sup>p</sup>-1)+1 (potential divisors of [[Double Mersenne number]]s)2 KB (338 words) - 06:58, 28 March 2023
- ...numbers''' are numbers of the form <math>(b^n-1)^2-2</math> and <math>(b^n+1)^2-2</math>, respectively, while '''Carol primes''' and '''Kynea primes''' ...h>(b^n-1)^2-2</math> and a Kynea number is a number of the form <math>(b^n+1)^2-2</math>. A Carol/Kynea prime is a [[prime]] which has one of the above8 KB (1,172 words) - 00:38, 6 July 2023
- ...r]] which is prime and of the form <math>\ n!_2{±}1,\ n!_3{±}1,\ n!_4{±}1</math>, and so on.429 bytes (50 words) - 14:29, 25 March 2019
- :<math>n! = 1 \cdot 2 \cdot 3 \cdots (n{-}2) \cdot (n{-}1) \cdot n</math> for <math>n \geq 1</math>.560 bytes (81 words) - 14:36, 20 July 2021
- |Rk=1 2;T:ST;C:'''[[M1]]''', {{NWo|+|1}}, {{NWo|-|2}}, {{NWo|4|1}}2 KB (294 words) - 04:55, 16 September 2024
- 1;T:ST 2;T:ST;C:{{NWo|+|2}}, {{NWi|MM|4|1}}5 KB (533 words) - 17:25, 25 September 2024
- {{HistC|2021-03-21|1-1000000|Gary Barnes|574248}}, double check, results included {{HistC|2004-05-03|1-313900|Phil Carmody|27811}}3 KB (283 words) - 17:14, 25 September 2024
- 1 {{HistC|2021-03-21|1-1000000|Gary Barnes|574248}}, double-check, results included5 KB (492 words) - 16:15, 7 September 2024
- 1;T:ST 4;T:ST;C:{{NWi|MM|16|1}}3 KB (326 words) - 17:01, 7 September 2024
- 14 KB (393 words) - 22:44, 17 July 2024
- A '''Factorial prime''' is a [[prime]] of the form '''[[Factorial number]] ± 1'''. *Factorial primes of the form ''n!-1'' are of the {{OEIS|l|A002982}}.488 bytes (70 words) - 07:11, 1 April 2019
- 1490 bytes (45 words) - 12:30, 3 July 2019