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 "2" on this wiki! See also the search results found.
Page title matches
- |CKBase=2 25 KB (537 words) - 08:17, 9 October 2020
- ==Search for Home Primes base 2== {{HP|2|2295|281|189|2013-07-23|}}2 KB (175 words) - 18:45, 14 December 2023
- ==Factorizations Of Cunningham Numbers C<sup>-</sup>(2,n) = 2<sup>n</sup> - 1== * 001 - 100 : {{FDBCunningham|2|-|1|100}}2 KB (176 words) - 12:01, 13 February 2019
- |Rb=2403 bytes (26 words) - 18:40, 2 January 2023
- |Rb=2935 bytes (70 words) - 18:56, 10 December 2022
- |Rb=2255 bytes (24 words) - 22:20, 10 December 2022
- |Pb=2432 bytes (32 words) - 13:38, 2 January 2023
- |Pb=2498 bytes (31 words) - 13:34, 2 January 2023
- |Rb=2 2;T:S490 bytes (35 words) - 12:22, 11 December 2022
- |Rb=2 2557 bytes (25 words) - 12:35, 11 December 2022
- |Pb=2334 bytes (32 words) - 15:12, 27 January 2023
- ==Factorizations Of Cunningham Numbers C<sup>+</sup>(2,n) = 2<sup>n</sup> + 1== * 001 - 100 : {{FDBCunningham|2|+|1|100}}2 KB (127 words) - 15:28, 17 August 2019
- |Pb=2 |PCount=2581 bytes (64 words) - 19:18, 5 April 2023
- |Rb=2 2;T:ST;C:'''[[M1]]''', {{NWo|+|1}}, {{NWo|-|2}}, {{NWo|4|1}}2 KB (288 words) - 11:41, 3 April 2023
- |Rb=2 2;T:ST;C:{{NWo|+|2}}, {{NWi|MM|4|1}}5 KB (523 words) - 09:47, 5 October 2023
- |Rb=2 22 KB (196 words) - 18:36, 9 October 2021
- |Rb=23 KB (264 words) - 22:08, 5 July 2023
- category=Riesel 2 Low-weight [[Category:Riesel 2 Low-weight| ]]948 bytes (121 words) - 13:08, 21 July 2021
- |Rb=2 2;T:T2 KB (252 words) - 13:29, 5 May 2024
- |Rb=23 KB (329 words) - 07:59, 17 August 2021
- |Rb=22 KB (185 words) - 04:16, 5 May 2024
- |Rb=2 |RCount=2236 bytes (24 words) - 00:24, 17 July 2021
- |WiBase=2 |WiMaxn={{GP|Riesel prime 2 3|RMaxn}}246 bytes (35 words) - 14:04, 1 August 2021
- |WiBase=2 |WiMaxn={{GP|Proth prime 2 1|PMaxn}}243 bytes (35 words) - 08:06, 1 August 2021
- |WiBase=2 |WiMaxn={{GP|Proth prime 2 3|PMaxn}}259 bytes (36 words) - 10:52, 13 July 2021
- |WiBase=2 |WiMaxn={{GP|Riesel prime 2 1|RMaxn}}244 bytes (35 words) - 20:47, 31 July 2021
- |Rb=22 KB (228 words) - 19:30, 19 July 2023
- |Pb=2 2;T:GT212 bytes (30 words) - 15:35, 2 October 2022
- |Pb=2 2;T:GT3 KB (336 words) - 16:58, 15 April 2024
- |Pb=21 KB (144 words) - 11:12, 24 August 2021
- |Pb=2 2;T:G2 KB (267 words) - 21:47, 5 July 2023
- |Pb=2 2;T:G3 KB (432 words) - 18:48, 9 April 2023
- |Pb=22 KB (240 words) - 08:58, 11 January 2023
- |Pb=2 2;T:G1 KB (175 words) - 07:07, 25 August 2021
- |Pb=2 2;T:T3 KB (390 words) - 10:00, 25 August 2021
- |Pb=21 KB (141 words) - 13:50, 25 August 2021
- |Pb=21 KB (145 words) - 09:32, 26 August 2021
- |Pb=2371 bytes (31 words) - 08:06, 18 September 2021
- |WoBase=2 2;C:{{NRi|3}}2 KB (230 words) - 10:36, 27 March 2023
- |CuBase=2 {{DISPLAYTITLE:Cullen primes {{Kbn|+|n|2|n}}|noerror}}2 KB (175 words) - 14:54, 19 September 2021
- |Pb=21 KB (103 words) - 12:07, 7 September 2021
- |Rb=22 KB (184 words) - 22:47, 18 April 2024
- |Rb=2 2;T:S2 KB (224 words) - 06:12, 9 May 2024
- |Rb=24 KB (357 words) - 23:04, 19 April 2024
- |Pb=2826 bytes (91 words) - 09:28, 31 August 2021
- |Pb=2328 bytes (32 words) - 13:00, 12 August 2021
- |Rb=2 22 KB (174 words) - 18:41, 5 May 2024
- |Rb=2 2;T:S3 KB (295 words) - 22:47, 5 July 2023
- |Pb=22 KB (202 words) - 11:31, 31 August 2021
- |Rb=2 {{HistC|2007-03-05|989600|65*2^n-1 thread|99924}}, released2 KB (222 words) - 06:13, 9 May 2024
- |Pb=22 KB (279 words) - 19:01, 9 April 2023
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}2 KB (178 words) - 05:51, 9 May 2024
- |Rb=21 KB (126 words) - 03:35, 6 May 2024
- |Rb=2 {{HistC|2008-03-25|333200|NPLB Drive 2|129767}}2 KB (157 words) - 10:53, 5 April 2023
- |Rb=2 23 KB (249 words) - 13:48, 21 March 2023
- |Pb=2 21 KB (103 words) - 09:49, 29 September 2021
- |Pb=2 2;T:T2 KB (245 words) - 10:36, 12 September 2021
- |Pb=2 2;T:T3 KB (289 words) - 10:52, 21 September 2021
- |Pb=22 KB (186 words) - 18:58, 9 April 2023
- |Pb=2 22 KB (177 words) - 09:40, 7 September 2021
- |Rb=2805 bytes (66 words) - 20:38, 16 July 2021
- |Rb=2192 bytes (19 words) - 21:44, 17 July 2021
- |Rb=2278 bytes (31 words) - 20:52, 16 July 2021
- |Rb=2307 bytes (32 words) - 19:48, 12 August 2021
- |Rb=2 2345 bytes (21 words) - 20:56, 16 July 2021
- |Rb=2713 bytes (46 words) - 08:03, 25 January 2024
- |GFNa=2133 bytes (12 words) - 07:54, 18 September 2021
- |Rb=2443 bytes (35 words) - 23:25, 24 July 2021
- |Rb=2 2;T:ST625 bytes (37 words) - 00:17, 17 July 2021
- |Rb=2605 bytes (41 words) - 16:59, 14 March 2023
- |Rb=2621 bytes (42 words) - 16:58, 14 March 2023
- |LeY=2 |LeDigits=2152 bytes (17 words) - 23:05, 17 July 2019
- |LeY=2155 bytes (17 words) - 20:21, 23 July 2019
- |LeY=2156 bytes (17 words) - 23:12, 17 July 2019
- |LeY=2156 bytes (17 words) - 20:22, 23 July 2019
- |LeY=2150 bytes (16 words) - 20:35, 23 July 2019
- |Rb=2692 bytes (60 words) - 08:15, 25 January 2024
- |LeY=2 |LeProgram=Titanix 2.1.0 (ECPP)176 bytes (19 words) - 13:05, 27 July 2019
- |LeY=2 |LeProgram=Titanix 2.1.0 (ECPP)176 bytes (19 words) - 13:06, 27 July 2019
- |LeY=2 |LeProgram=Titanix 2.1.0 (ECPP)178 bytes (19 words) - 13:08, 27 July 2019
- |LeY=2174 bytes (19 words) - 00:08, 24 July 2019
- |LeY=2181 bytes (20 words) - 19:52, 24 July 2019
- |LeY=2141 bytes (14 words) - 20:13, 24 July 2019
- |LeY=2141 bytes (14 words) - 20:14, 24 July 2019
- |Rb=2550 bytes (50 words) - 08:13, 25 January 2024
- |Rb=2823 bytes (62 words) - 08:12, 25 January 2024
- |Rb=2635 bytes (48 words) - 08:11, 25 January 2024
- |Pb=21 KB (99 words) - 11:13, 17 September 2021
- |Rb=2685 bytes (63 words) - 08:10, 25 January 2024
- |Rb=2241 bytes (24 words) - 00:15, 17 July 2021
- |Rb=2370 bytes (39 words) - 00:06, 17 July 2021
- |Rb=2359 bytes (39 words) - 00:06, 17 July 2021
- |Rb=2775 bytes (85 words) - 00:10, 17 July 2021
- |Rb=2487 bytes (36 words) - 23:41, 24 July 2021
- |Rb=2354 bytes (29 words) - 00:23, 17 July 2021
- |Rb=2660 bytes (57 words) - 08:09, 25 January 2024
- |Rb=2375 bytes (24 words) - 11:45, 21 July 2021
- |Rb=2413 bytes (32 words) - 20:34, 31 July 2021
- |Rb=2334 bytes (25 words) - 20:36, 31 July 2021
- |Rb=2417 bytes (37 words) - 14:28, 21 July 2021
- |Rb=2409 bytes (32 words) - 10:50, 21 July 2021
- |Rb=2358 bytes (26 words) - 23:44, 24 July 2021
- |Rb=2 2;T:T427 bytes (36 words) - 09:47, 29 July 2021
- |Rb=2359 bytes (29 words) - 07:08, 31 July 2021
- |Rb=2377 bytes (27 words) - 07:09, 31 July 2021
- |Rb=2380 bytes (38 words) - 15:18, 1 August 2021
- |Rb=2378 bytes (28 words) - 12:51, 2 August 2021
- |Rb=2466 bytes (28 words) - 03:44, 26 July 2021
- |Rb=2567 bytes (55 words) - 08:05, 25 January 2024
- |GFNa=2133 bytes (12 words) - 07:49, 18 September 2021
- |Rb=2303 bytes (27 words) - 14:26, 21 July 2021
- |Rb=2327 bytes (27 words) - 14:27, 21 July 2021
- |Rb=2401 bytes (35 words) - 08:06, 25 January 2024
- |Rb=2480 bytes (40 words) - 08:07, 25 January 2024
- |GFNa=2127 bytes (12 words) - 19:00, 17 September 2021
- |Rb=2476 bytes (42 words) - 08:08, 25 January 2024
- |GFNa=2133 bytes (12 words) - 18:55, 17 September 2021
- {{DISPLAYTITLE:Near Woodall primes of the form {{Kbn|(n+1)|2|n}}}} | 1 || 1 || 1 || {{Kbn|2|1}} || [[Riesel prime 2 1|{{Kbn|2}}]] || n.n. || n.n.4 KB (327 words) - 16:31, 31 August 2021
- |Rb=2304 bytes (26 words) - 12:03, 31 July 2021
- |Rb=2329 bytes (27 words) - 06:51, 31 July 2021
- |Rb=2693 bytes (75 words) - 06:47, 31 July 2021
- |Rb=2323 bytes (26 words) - 09:27, 29 July 2021
- |Rb=2405 bytes (32 words) - 14:20, 21 July 2021
- |Rb=2679 bytes (81 words) - 21:10, 17 December 2023
- |Rb=2906 bytes (79 words) - 10:12, 15 March 2024
- |WoBase=2 1;C:{{NRi|2}}, {{NWo|4|1}}2 KB (193 words) - 16:31, 31 August 2021
- |WoBase=2 2;C:{{NRi|2}}2 KB (176 words) - 16:52, 31 August 2021
- {{DISPLAYTITLE:Near Woodall primes of the form {{Kbn|(n-1)|2|n}}}} | 1 || 2 || 1 || {{Kbn|1|2}} || [[Riesel prime 2 1|{{Kbn|2}}]]<ref>Mersenne prime [[M1]]</ref> || n.n. || n.n.3 KB (313 words) - 16:51, 31 August 2021
- |Rb=2 23 KB (280 words) - 00:00, 24 April 2024
- |Rb=22 KB (242 words) - 19:29, 19 July 2023
- |Rb=22 KB (193 words) - 13:12, 21 August 2023
- |Rb=2 2;T:S3 KB (285 words) - 08:15, 7 May 2024
- |Rb=2972 bytes (97 words) - 22:13, 18 October 2021
- |Rb=26 KB (613 words) - 05:54, 19 April 2024
- |Rb=2 2;T:T3 KB (341 words) - 08:00, 12 April 2023
- |Rb=21 KB (105 words) - 23:07, 22 November 2021
- |Rb=2 22 KB (238 words) - 13:33, 5 May 2024
- |Rb=2439 bytes (29 words) - 03:41, 26 July 2021
- |Rb=22 KB (188 words) - 13:33, 5 May 2024
- |Rb=22 KB (202 words) - 11:02, 19 March 2024
- |Rb=2 22 KB (149 words) - 14:30, 19 April 2024
- |Rb=25 KB (539 words) - 14:34, 19 April 2024
- |Rb=2 2;T:ST3 KB (310 words) - 19:32, 19 July 2023
- |Rb=21 KB (111 words) - 13:33, 5 May 2024
- |Rb=23 KB (317 words) - 10:28, 15 July 2021
- |Rb=22 KB (219 words) - 13:33, 5 May 2024
- |Rb=2 21 KB (133 words) - 13:33, 5 May 2024
- |Rb=22 KB (226 words) - 08:15, 7 May 2024
- |Rb=2 2;T:T2 KB (217 words) - 13:33, 5 May 2024
- |Rb=22 KB (157 words) - 08:17, 7 May 2024
- |Rb=22 KB (201 words) - 13:33, 5 May 2024
- |Rb=22 KB (171 words) - 10:45, 15 July 2021
- |Rb=24 KB (392 words) - 13:33, 5 May 2024
- |Rb=2 2930 bytes (97 words) - 12:03, 15 July 2021
- |Rb=21 KB (153 words) - 10:22, 8 October 2022
- |Rb=22 KB (246 words) - 08:18, 7 May 2024
- |Rb=2 22 KB (179 words) - 10:44, 26 April 2024
- |Rb=24 KB (406 words) - 12:09, 15 July 2021
- |Rb=22 KB (226 words) - 08:39, 7 May 2024
- |Rb=2 23 KB (272 words) - 20:45, 26 February 2024
- |Rb=21 KB (152 words) - 10:44, 26 April 2024
- |Rb=2 2;T:T3 KB (279 words) - 13:33, 5 May 2024
- |Rb=22 KB (187 words) - 12:37, 15 July 2021
- |Rb=22 KB (208 words) - 06:58, 24 April 2024
- |Rb=23 KB (249 words) - 23:57, 23 April 2024
- |Rb=2 21 KB (147 words) - 07:28, 24 April 2024
- |Rb=21 KB (128 words) - 00:04, 24 April 2024
- |Rb=23 KB (266 words) - 19:34, 19 July 2023
- |Rb=25 KB (535 words) - 07:13, 19 July 2021
- |Rb=22 KB (222 words) - 13:33, 5 May 2024
- |Rb=2 2;T:ST2 KB (207 words) - 08:48, 19 July 2021
- |Rb=21 KB (104 words) - 08:48, 19 July 2021
- |Rb=21 KB (146 words) - 19:35, 19 July 2023
- |Rb=2 2;T:S4 KB (361 words) - 04:54, 9 May 2024
- |Rb=22 KB (221 words) - 00:05, 24 April 2024
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}1 KB (129 words) - 02:45, 9 May 2024
- |Rb=2 22 KB (218 words) - 03:45, 9 May 2024
- |Rb=22 KB (180 words) - 00:01, 24 April 2024
- |Rb=21 KB (121 words) - 09:13, 29 September 2021
- |Rb=2 2;T:S2 KB (193 words) - 05:15, 9 May 2024
- |Rb=2 22 KB (154 words) - 08:50, 19 July 2021
- |Rb=2 22 KB (172 words) - 09:02, 9 May 2024
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}2 KB (176 words) - 09:32, 9 May 2024
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}2 KB (180 words) - 06:49, 9 May 2024
- |Rb=2 2988 bytes (93 words) - 09:56, 9 May 2024
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}3 KB (334 words) - 10:30, 9 May 2024
- |Rb=2 22 KB (160 words) - 01:21, 10 May 2024
- |Rb=2 22 KB (148 words) - 00:43, 10 May 2024
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}1 KB (115 words) - 00:58, 10 May 2024
- |Rb=2 22 KB (211 words) - 01:27, 10 May 2024
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}1 KB (149 words) - 01:50, 10 May 2024
- |Rb=25 KB (470 words) - 08:50, 19 July 2021
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}2 KB (196 words) - 03:03, 10 May 2024
- |Rb=2 2;T:S2 KB (127 words) - 11:36, 27 April 2024
- |Rb=2 21 KB (97 words) - 12:00, 27 April 2024
- |Rb=21 KB (94 words) - 07:42, 21 July 2021
- |Rb=2 21 KB (96 words) - 07:39, 21 July 2021
- |Rb=21 KB (85 words) - 07:39, 21 July 2021
- |Rb=2 2978 bytes (72 words) - 07:40, 21 July 2021
- |Rb=21 KB (92 words) - 07:41, 21 July 2021
- |Rb=2398 bytes (41 words) - 07:54, 10 April 2024
- |Rb=2462 bytes (48 words) - 08:01, 10 April 2024
- |Rb=2461 bytes (48 words) - 08:11, 10 April 2024
- |Rb=2679 bytes (72 words) - 08:15, 10 April 2024
- |Rb=2475 bytes (48 words) - 08:17, 10 April 2024
- |Rb=2489 bytes (51 words) - 08:36, 10 April 2024
- |Rb=2397 bytes (41 words) - 08:38, 10 April 2024
- |Rb=2498 bytes (48 words) - 11:07, 11 April 2024
- |Rb=2475 bytes (48 words) - 08:40, 10 April 2024
- |Rb=2394 bytes (41 words) - 08:42, 10 April 2024
- |Rb=2393 bytes (41 words) - 08:43, 10 April 2024
- |Rb=2 |RCount=2383 bytes (41 words) - 08:45, 10 April 2024
- |Rb=2381 bytes (41 words) - 08:47, 10 April 2024
- |Rb=2398 bytes (41 words) - 08:48, 10 April 2024
- |Rb=2553 bytes (56 words) - 19:31, 11 April 2024
- |Rb=2434 bytes (44 words) - 09:00, 10 April 2024
- |Rb=2501 bytes (51 words) - 09:01, 10 April 2024
- |Rb=2489 bytes (48 words) - 09:48, 10 April 2024
- |Rb=2 |RCount=2382 bytes (41 words) - 09:51, 10 April 2024
- |Rb=2431 bytes (46 words) - 09:52, 10 April 2024
- |Rb=2463 bytes (48 words) - 09:53, 10 April 2024
- |Rb=2418 bytes (41 words) - 09:54, 10 April 2024
- |Rb=2539 bytes (55 words) - 09:56, 10 April 2024
- |Rb=2463 bytes (48 words) - 09:57, 10 April 2024
- |Rb=2399 bytes (41 words) - 09:58, 10 April 2024
- |Rb=2477 bytes (48 words) - 09:59, 10 April 2024
- |Rb=2 21 KB (114 words) - 07:05, 10 May 2024
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}1 KB (126 words) - 07:26, 10 May 2024
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}2 KB (166 words) - 07:48, 10 May 2024
- |Rb=2 23 KB (266 words) - 08:13, 10 May 2024
- |Rb=21 KB (131 words) - 13:56, 24 April 2024
- |Rb=2 2;T:ST3 KB (271 words) - 08:51, 16 April 2024
- |Rb=22 KB (154 words) - 19:37, 19 July 2023
- |Rb=21,019 bytes (84 words) - 08:52, 19 July 2021
- |Rb=2358 bytes (29 words) - 23:37, 24 July 2021
- |Rb=2 2;T:S1,017 bytes (84 words) - 10:20, 21 March 2024
- |Rb=2968 bytes (72 words) - 13:12, 21 March 2024
- |Rb=2984 bytes (74 words) - 13:23, 21 March 2024
- |Rb=2743 bytes (67 words) - 09:32, 22 March 2024
- |Rb=2740 bytes (68 words) - 13:13, 21 March 2024
- |Rb=2 2715 bytes (61 words) - 13:27, 21 March 2024
- |Rb=2 |RCount=2345 bytes (40 words) - 00:13, 17 July 2021
- |Rb=2462 bytes (34 words) - 00:16, 17 July 2021
- |Rb=2 2481 bytes (29 words) - 00:19, 17 July 2021
- |Rb=2479 bytes (32 words) - 13:16, 21 March 2024
- |Rb=2 2;T:S1 KB (113 words) - 13:45, 5 May 2024
- |Rb=2 21 KB (102 words) - 13:45, 5 May 2024
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}1 KB (118 words) - 13:45, 5 May 2024
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}2 KB (163 words) - 13:45, 5 May 2024
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}1 KB (106 words) - 13:45, 5 May 2024
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}2 KB (217 words) - 13:45, 5 May 2024
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}1 KB (96 words) - 13:45, 5 May 2024
- |Rb=2 21 KB (113 words) - 13:46, 5 May 2024
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}1 KB (99 words) - 13:46, 5 May 2024
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}2 KB (191 words) - 13:45, 5 May 2024
- |Rb=22 KB (186 words) - 00:02, 24 April 2024
- |Rb=2 {{HistC|2020-03-20|2200000|RPS Megabit Drive 2|540214}} released1 KB (129 words) - 13:45, 5 May 2024
- |Rb=23 KB (302 words) - 15:26, 1 November 2023
- |Rb=2 22 KB (197 words) - 15:26, 1 November 2023
- |Rb=22 KB (184 words) - 04:47, 17 April 2024
- |Rb=23 KB (276 words) - 19:38, 19 July 2023
- |Rb=2 |RCount=2782 bytes (79 words) - 04:18, 21 August 2021
- |Rb=2 21 KB (133 words) - 03:49, 10 May 2024
- |Rb=21 KB (140 words) - 03:31, 6 May 2024
- |Rb=2 2;T:T2 KB (235 words) - 23:14, 8 May 2024
- |Rb=22 KB (160 words) - 00:58, 2 May 2024
- |Rb=21 KB (140 words) - 00:02, 24 April 2024
- |Rb=22 KB (216 words) - 08:23, 26 April 2024
- |Rb=2 21 KB (133 words) - 05:02, 17 April 2024
- |Rb=21 KB (97 words) - 00:03, 24 April 2024
- |Rb=21 KB (139 words) - 05:18, 9 May 2024
- |Rb=2 22 KB (158 words) - 01:26, 2 May 2024
- |Rb=22 KB (228 words) - 18:22, 12 December 2022
- |Rb=21 KB (91 words) - 18:19, 12 December 2022
- |Rb=2 21 KB (136 words) - 03:33, 6 May 2024
- |Rb=2 {{HistC|2006-08-13|600000|RPS Drive 2|85004}}, released2 KB (210 words) - 02:35, 10 May 2024
- |Rb=22 KB (226 words) - 23:58, 23 April 2024
- |Rb=22 KB (188 words) - 23:28, 22 November 2021
- |Rb=2 {{HistC|2006-08-13|600000|RPS Drive 2|85004}}, released2 KB (169 words) - 02:10, 10 May 2024
- |Rb=2 22 KB (181 words) - 05:47, 2 May 2024
- |Rb=21 KB (112 words) - 05:10, 17 April 2024
- |Rb=21 KB (136 words) - 05:15, 17 April 2024
- |Rb=2 23 KB (277 words) - 13:46, 22 April 2024
- |Rb=21 KB (136 words) - 09:01, 19 July 2021
- |Rb=2910 bytes (98 words) - 06:10, 2 May 2024
- |Rb=21 KB (130 words) - 06:05, 24 April 2024
- |Rb=2521 bytes (44 words) - 02:01, 19 April 2024
- |Rb=2468 bytes (46 words) - 07:21, 23 July 2021
- |Rb=2325 bytes (29 words) - 07:21, 23 July 2021
- |Rb=2331 bytes (33 words) - 09:40, 21 August 2021
- |Rb=21 KB (121 words) - 07:49, 24 April 2024
- |Rb=2793 bytes (76 words) - 23:09, 22 November 2021
- |Rb=2 2;T:ST3 KB (271 words) - 05:04, 24 April 2024
- |Rb=21 KB (142 words) - 03:36, 6 May 2024
- |Rb=22 KB (154 words) - 03:59, 3 May 2024
- |Rb=2 22 KB (219 words) - 04:16, 3 May 2024
- |Rb=21 KB (123 words) - 05:21, 17 April 2024
- |Rb=22 KB (206 words) - 04:42, 3 May 2024
- |Rb=21 KB (149 words) - 18:23, 12 December 2022
- |Rb=21 KB (143 words) - 00:07, 24 April 2024
- |Rb=2 2;T:T2 KB (201 words) - 06:13, 24 April 2024
- |Rb=21 KB (107 words) - 03:38, 6 May 2024
- |Rb=21 KB (111 words) - 04:59, 3 May 2024
- |Rb=22 KB (212 words) - 05:16, 3 May 2024
- |Rb=2 22 KB (190 words) - 08:59, 9 May 2024
- |Rb=22 KB (192 words) - 18:24, 12 December 2022
- |Rb=23 KB (298 words) - 03:43, 4 May 2024
- |Rb=21 KB (103 words) - 18:47, 7 May 2024
- |Rb=22 KB (168 words) - 23:10, 1 May 2024
- |Rb=2 22 KB (226 words) - 10:55, 27 April 2024
- |Rb=2 22 KB (160 words) - 18:09, 4 May 2024
- |Rb=21 KB (114 words) - 03:42, 6 May 2024
- |Rb=2 23 KB (283 words) - 18:44, 4 May 2024
- |Rb=22 KB (209 words) - 18:56, 4 May 2024
- |Rb=21 KB (116 words) - 05:10, 1 August 2021
- |Rb=2480 bytes (48 words) - 09:37, 29 July 2021
- |Rb=2279 bytes (19 words) - 09:38, 29 July 2021
- Automatically generated table from available [[:Category:Riesel 2 1-300|Riesel primes {{Vk}} < 300]]. |category=Riesel 2 1-300855 bytes (117 words) - 07:27, 16 July 2021
- |Pb=21 KB (19 words) - 16:07, 11 July 2021
- |Pb=21 KB (19 words) - 16:09, 11 July 2021
- |Rb=2 |RCount=2348 bytes (30 words) - 01:56, 21 August 2021
- |Rb=2 |RCount=2284 bytes (25 words) - 07:26, 21 August 2021
- |Rb=2402 bytes (41 words) - 10:00, 10 April 2024
- |Rb=2577 bytes (52 words) - 11:28, 16 August 2021
- |Rb=2474 bytes (48 words) - 10:08, 10 April 2024
- |Rb=2 |RCount=2433 bytes (46 words) - 14:02, 10 April 2024
- |Rb=2 |RCount=2541 bytes (56 words) - 21:54, 16 April 2024
- |Rb=2464 bytes (49 words) - 14:29, 10 April 2024
- |Rb=2482 bytes (48 words) - 19:00, 10 April 2024
- |Rb=2423 bytes (44 words) - 19:01, 10 April 2024
- |Rb=2503 bytes (51 words) - 19:56, 11 April 2024
- |Rb=2540 bytes (55 words) - 19:32, 11 April 2024
- |Rb=2608 bytes (60 words) - 09:09, 11 April 2024
- |Rb=2427 bytes (46 words) - 22:05, 10 April 2024
- |Rb=2403 bytes (41 words) - 22:09, 10 April 2024
- |Rb=2510 bytes (53 words) - 08:44, 11 April 2024
- |Rb=2406 bytes (41 words) - 22:11, 10 April 2024
- |Rb=2572 bytes (55 words) - 08:38, 11 April 2024
- |Rb=2 2;T:S3 KB (240 words) - 01:08, 15 March 2024
- |Rb=2976 bytes (111 words) - 07:07, 31 July 2021
- |Rb=2563 bytes (45 words) - 19:35, 30 August 2021
- |Rb=2416 bytes (36 words) - 23:40, 24 July 2021
- |Rb=2605 bytes (60 words) - 23:41, 24 July 2021
- |Rb=2339 bytes (30 words) - 23:42, 24 July 2021
- |Rb=2633 bytes (38 words) - 23:46, 24 July 2021
- |Rb=2370 bytes (29 words) - 03:32, 26 July 2021
- |Rb=2 2452 bytes (40 words) - 03:32, 26 July 2021
- |Rb=2564 bytes (36 words) - 03:35, 26 July 2021
- |Rb=2 2545 bytes (35 words) - 03:37, 26 July 2021
- |Rb=2 2811 bytes (53 words) - 06:50, 28 July 2021
- |Rb=2458 bytes (36 words) - 09:52, 29 July 2021
- |Rb=2410 bytes (32 words) - 08:17, 1 August 2021
- |Rb=2 |RCount=2283 bytes (30 words) - 08:05, 1 August 2021
- |Rb=2348 bytes (30 words) - 17:10, 18 July 2021
- |Rb=2 2;T:ST832 bytes (47 words) - 04:41, 2 August 2021
- |Rb=2 2951 bytes (67 words) - 14:09, 2 August 2021
- |Rb=2581 bytes (66 words) - 05:22, 1 August 2021
- |Rb=2441 bytes (37 words) - 05:22, 1 August 2021
- |Rb=2620 bytes (68 words) - 05:29, 1 August 2021
- |Rb=2884 bytes (62 words) - 14:08, 3 January 2023
- | [[Riesel prime 2 115|115]] || {{GP|Riesel prime 2 115|RNash}} || 43318 || 1000000 - || 1141719, 1524183 | [[Riesel prime 2 117|117]] || {{GP|Riesel prime 2 117|RNash}} || 77288 || 1000000 - || 1104138, 1210282, 1302764, 1554601, 164 KB (376 words) - 21:41, 8 May 2024
- |Rb=2199 bytes (19 words) - 07:03, 19 July 2021
- |Rb=2269 bytes (32 words) - 21:08, 17 December 2023
- |Rb=2 2414 bytes (24 words) - 00:01, 17 July 2021
- |Rb=2 2;T:ST751 bytes (50 words) - 03:30, 26 July 2021
- |Rb=2764 bytes (42 words) - 03:34, 26 July 2021
- |Rb=2673 bytes (46 words) - 07:08, 31 July 2021
- |Rb=2733 bytes (50 words) - 09:25, 31 July 2021
- |Rb=2802 bytes (49 words) - 09:37, 31 July 2021
- |Rb=2 2;T:S638 bytes (45 words) - 06:56, 26 July 2021
- |Rb=2 2;T:S863 bytes (50 words) - 02:34, 1 August 2021
- |Rb=2906 bytes (61 words) - 02:38, 1 August 2021
- |Rb=2810 bytes (52 words) - 08:21, 1 August 2021
- |Rb=2326 bytes (24 words) - 07:11, 31 July 2021
- |Rb=2 2434 bytes (26 words) - 07:11, 31 July 2021
- |Rb=2735 bytes (79 words) - 12:39, 31 July 2021
- |Rb=2225 bytes (24 words) - 00:14, 17 July 2021
- |Rb=2 |RCount=2380 bytes (40 words) - 00:00, 17 July 2021
- |Rb=2225 bytes (24 words) - 00:18, 17 July 2021
- |Rb=2654 bytes (71 words) - 08:56, 31 March 2024
- |Rb=2273 bytes (29 words) - 11:56, 2 August 2021
- |Rb=2228 bytes (24 words) - 13:01, 2 August 2021
- |Rb=2370 bytes (39 words) - 00:18, 17 July 2021
- |Rb=2374 bytes (39 words) - 03:42, 26 July 2021
- |Rb=2364 bytes (29 words) - 23:33, 24 July 2021
- |Rb=2389 bytes (24 words) - 03:31, 26 July 2021
- |Rb=2391 bytes (35 words) - 15:51, 25 July 2021
- |Rb=2716 bytes (39 words) - 15:51, 25 July 2021
- |Rb=2322 bytes (34 words) - 08:34, 23 August 2021
- |Rb=2274 bytes (28 words) - 08:39, 22 August 2021
- |Rb=2 2;T:S505 bytes (42 words) - 17:12, 18 July 2021
- |Rb=2414 bytes (22 words) - 00:11, 17 July 2021
- |Rb=2 2761 bytes (88 words) - 03:53, 15 August 2021
- |Rb=21 KB (104 words) - 15:47, 25 July 2021
- |Rb=2471 bytes (37 words) - 09:28, 29 July 2021
- |Rb=2 2;T:ST635 bytes (43 words) - 15:55, 25 July 2021
- |Rb=2 |RCount=2327 bytes (32 words) - 12:08, 31 July 2021
- |Rb=2481 bytes (31 words) - 05:23, 1 August 2021
- |Rb=2365 bytes (28 words) - 04:58, 1 August 2021
- |Rb=2 2;T:S292 bytes (21 words) - 11:54, 2 August 2021
- |Rb=2442 bytes (49 words) - 10:00, 19 March 2024
- |Rb=21 KB (102 words) - 13:48, 27 July 2021
- *For {{Num|25000}} ≤ {{Vk}} ≤ {{Num|100000}} see [[Riesel 2 10e4-10e5a|here]] category=Riesel 2 10e4-10e51 KB (176 words) - 09:20, 22 July 2021
- Automatically generated table from available [[:Category:Riesel 2 4000-6000|Riesel primes 4000 < {{Vk}} < 6000]]. |category=Riesel 2 4000-6000883 bytes (117 words) - 08:42, 22 July 2021
- |Rb=2668 bytes (80 words) - 00:27, 17 July 2021
- |Rb=2 |RCount=2554 bytes (54 words) - 22:27, 16 April 2024
- |Rb=2525 bytes (46 words) - 13:48, 27 July 2021
- |Rb=2524 bytes (41 words) - 13:50, 27 July 2021
- |Rb=2839 bytes (56 words) - 13:51, 27 July 2021
- |Rb=21 KB (95 words) - 13:52, 27 July 2021
- |Rb=2590 bytes (47 words) - 22:46, 16 April 2024
- |Rb=2624 bytes (51 words) - 13:59, 27 July 2021
- |Rb=2 2;T:T832 bytes (59 words) - 13:59, 27 July 2021
- |Rb=2458 bytes (42 words) - 22:47, 16 April 2024
- |Rb=2758 bytes (56 words) - 14:00, 27 July 2021
- |Rb=2472 bytes (50 words) - 07:12, 19 July 2021
- |Rb=2 2;T:S1 KB (93 words) - 14:01, 27 July 2021
- |Rb=21,020 bytes (76 words) - 14:01, 27 July 2021
- |Rb=2560 bytes (46 words) - 14:02, 27 July 2021
- |Rb=2932 bytes (75 words) - 14:02, 27 July 2021
- |Rb=2595 bytes (51 words) - 14:03, 27 July 2021
- |Rb=2451 bytes (42 words) - 22:49, 16 April 2024
- |Rb=2 2;T:T2 KB (134 words) - 13:18, 21 March 2024
- |Rb=21,011 bytes (76 words) - 14:04, 27 July 2021
- |Rb=21 KB (81 words) - 14:04, 27 July 2021
- |Rb=2841 bytes (61 words) - 14:11, 27 July 2021
- |Rb=2790 bytes (61 words) - 14:11, 27 July 2021
- |Rb=2898 bytes (66 words) - 14:12, 27 July 2021
- |Rb=2 2;T:T840 bytes (65 words) - 14:13, 27 July 2021
- |Rb=2700 bytes (56 words) - 14:13, 27 July 2021
- |Rb=2563 bytes (41 words) - 20:34, 2 August 2021
- |Rb=2971 bytes (63 words) - 20:35, 2 August 2021
- |Rb=2550 bytes (42 words) - 22:50, 16 April 2024
- |Rb=2547 bytes (47 words) - 22:50, 16 April 2024
- |Rb=21 KB (91 words) - 20:36, 2 August 2021
- |Rb=2586 bytes (46 words) - 20:37, 2 August 2021
- |Rb=2748 bytes (62 words) - 22:51, 16 April 2024
- |Rb=21 KB (87 words) - 20:38, 2 August 2021
- |Rb=2 2740 bytes (56 words) - 20:38, 2 August 2021
- |Rb=2695 bytes (56 words) - 20:39, 2 August 2021
- |Rb=2717 bytes (53 words) - 20:39, 2 August 2021
- |Rb=2736 bytes (56 words) - 20:40, 2 August 2021
- |Rb=2884 bytes (67 words) - 22:52, 16 April 2024
- |Rb=2732 bytes (48 words) - 20:40, 2 August 2021
- |Rb=2632 bytes (56 words) - 20:41, 2 August 2021
- |Rb=2888 bytes (61 words) - 20:41, 2 August 2021
- |Rb=2620 bytes (46 words) - 20:42, 2 August 2021
- |Rb=2 2617 bytes (51 words) - 20:42, 2 August 2021
- |Rb=2558 bytes (46 words) - 20:43, 2 August 2021
- |Rb=21 KB (102 words) - 20:43, 2 August 2021
- |Rb=2 2646 bytes (51 words) - 20:44, 2 August 2021
- |Rb=2568 bytes (42 words) - 22:52, 16 April 2024
- |Rb=21 KB (81 words) - 20:44, 2 August 2021
- |Rb=2635 bytes (46 words) - 20:45, 2 August 2021
- |Rb=2765 bytes (61 words) - 20:45, 2 August 2021
- |Rb=2 {{HistC|2008-03-25|333200|NPLB Drive 2|129767}}, released1 KB (105 words) - 05:13, 14 March 2023
- |Rb=2 {{HistC|2008-03-25|333200|NPLB Drive 2|129767}}2 KB (177 words) - 21:47, 19 June 2023
- |Rb=21 KB (93 words) - 20:58, 2 August 2021
- |Rb=2 2771 bytes (56 words) - 20:59, 2 August 2021
- |Rb=2768 bytes (56 words) - 20:59, 2 August 2021
- |Rb=2 2871 bytes (65 words) - 20:59, 2 August 2021
- |Rb=2387 bytes (37 words) - 22:53, 16 April 2024
- |Rb=2735 bytes (56 words) - 21:00, 2 August 2021
- |Rb=2 2;T:T863 bytes (63 words) - 21:01, 2 August 2021
- |Rb=2626 bytes (51 words) - 21:01, 2 August 2021
- |Rb=2703 bytes (56 words) - 21:01, 2 August 2021
- |Rb=21 KB (89 words) - 21:02, 2 August 2021
- |Rb=2649 bytes (51 words) - 21:02, 2 August 2021
- |Rb=2598 bytes (46 words) - 21:03, 2 August 2021
- |Rb=21 KB (90 words) - 21:03, 2 August 2021
- |Rb=2743 bytes (56 words) - 21:04, 2 August 2021
- |Rb=2851 bytes (66 words) - 21:04, 2 August 2021
- |Rb=2536 bytes (39 words) - 22:53, 16 April 2024
- |Rb=2814 bytes (56 words) - 21:05, 2 August 2021
- |Rb=2795 bytes (56 words) - 21:05, 2 August 2021
- |Rb=2 21 KB (84 words) - 21:06, 2 August 2021
- |Rb=2450 bytes (42 words) - 22:54, 16 April 2024
- |Rb=2826 bytes (61 words) - 21:07, 2 August 2021
- |Rb=21 KB (80 words) - 21:07, 2 August 2021
- |Rb=2520 bytes (41 words) - 21:08, 2 August 2021
- |Rb=2712 bytes (56 words) - 21:08, 2 August 2021
- |Rb=2778 bytes (58 words) - 21:09, 2 August 2021
- |Rb=2 2469 bytes (41 words) - 21:11, 2 August 2021
- |Rb=2393 bytes (37 words) - 22:55, 16 April 2024
- |Rb=2 21 KB (82 words) - 21:11, 2 August 2021
- |Rb=21 KB (76 words) - 21:12, 2 August 2021
- |Rb=2986 bytes (71 words) - 21:12, 2 August 2021
- |Rb=2813 bytes (56 words) - 22:56, 16 April 2024
- |Rb=2 2664 bytes (51 words) - 21:13, 2 August 2021
- |Rb=2755 bytes (57 words) - 22:57, 16 April 2024
- |Rb=2523 bytes (43 words) - 21:14, 2 August 2021
- |Rb=2426 bytes (37 words) - 22:57, 16 April 2024
- |Rb=2871 bytes (66 words) - 21:14, 2 August 2021
- |Rb=2 2;T:T769 bytes (59 words) - 21:15, 2 August 2021
- |Rb=2 21 KB (81 words) - 21:15, 2 August 2021
- |Rb=2665 bytes (51 words) - 21:16, 2 August 2021
- |Rb=2994 bytes (71 words) - 21:16, 2 August 2021
- |Rb=2405 bytes (37 words) - 22:58, 16 April 2024
- |Rb=2497 bytes (46 words) - 21:17, 2 August 2021
- |Rb=21 KB (90 words) - 09:48, 10 August 2021
Page text matches
- ...a [[natural number]] of the form {{Kbn|(b-1)|b|n}} for integers ''b'' ≥ 2 and ''n'' ≥ 1. ...Smallest <ref>The list of smallest primes of any base is an ASCII file for 2 ≤ ''b'' ≤ 1024. For unknown values only the base is given.</ref> !! Rem5 KB (744 words) - 07:30, 5 August 2019
- |CKBase=2 25 KB (537 words) - 08:17, 9 October 2020
- 2 21 KB (85 words) - 10:45, 16 April 2023
- '''srsieve''' (and '''sr1/2/5sieve''') is used to create sieve files for one or more sequences. Those s2 KB (265 words) - 07:36, 28 May 2021
- <pre><math>\sideset{_1^2}{_3^4}\prod_a^b</math></pre> :<math>\sideset{_1^2}{_3^4}\prod_a^b</math>11 KB (1,236 words) - 14:41, 3 September 2020
- ...as born in 1588. Mersenne investigated a particular type of prime numbers: 2<sup>p</sup> - 1, in which ''p'' is an ordinary [[prime]].3 KB (450 words) - 14:37, 21 August 2019
- *'''Digits in M<sub>n</sub>''': denotes the [[Mersenne prime]] 2<sup>n</sup>-1 and a downloadable decimal representation ...n P<sub>n</sub>''': denotes the [[Perfect number]] 2<sup>n-1</sup> • (2<sup>n</sup>-1) and a downloadable decimal representation2 KB (360 words) - 09:44, 6 March 2019
- ...is one less than a [[power of two]]. For example, 3 = 4 − 1 = {{Kbn|2}} is a Mersenne prime; so is 7 = 8 − 1 = {{Kbn|3}}. On the other hand :<math>M_n=2^n{-}1</math> .5 KB (857 words) - 14:53, 19 September 2021
- A '''Mersenne number''' is a number of the form <math>2^n{-}1</math> where <math>n</math> is a non-negative [[integer]]. ...senne number <math>2^n{-}1</math> can be calculated by <math>\lfloor{n*log(2)}\rfloor+1</math> (see [[floor function]]).2 KB (351 words) - 11:28, 7 March 2019
- ...for finite differences <math>\large\delta y</math> and <math>\large\delta^2 y</math> and many more.16 KB (2,614 words) - 11:48, 14 January 2024
- : <math>\sqrt[4]{\frac{2}{3-\sqrt{2}}}</math> ...ined if the ratio of the air oscillation frequencies is also 1 : 2, which in turn is consistent with the source-air-motion-frequency-equivalen11 KB (1,582 words) - 01:17, 15 January 2024
- ...c and fundamental parts of geometry; 1. A point is that which has no part. 2. A line is breadthless length. From these definitions of the point and the2 KB (341 words) - 11:43, 14 January 2024
- ...l candidates with prime [[exponent]]s up to and including M26. During that 2 hour period, it duplicated what had previously occurred over a 520 year per2 KB (333 words) - 12:40, 9 February 2022
- ...aura A. Nickel''') with [[Landon Curt Noll]] discovered on 1978-10-30 that 2<sup>21701</sup>-1 was the [[M25|25th Mersenne prime]]. This made internatio2 KB (254 words) - 01:23, 15 January 2024
- | [[M27]] || 2<sup>{{Num|44497}}</sup>-1 || 1979-04-08 | [[M28]] || 2<sup>{{Num|86243}}</sup>-1 || 1982-09-251 KB (213 words) - 23:53, 14 January 2024
- :{{V|F}}<sub>{{Vn}}</sub> = {{Kbn|+|1|2|2<sup>n</sup>}} :{{V|F}}<sub>1</sub> = {{Kbn|+|2}} = 512 KB (1,913 words) - 14:35, 9 August 2021
- The official discovery date for prime 2<sup>77 232 917</sup>-1 was 2017-12-26. See the [https://www.mersenne.org/pr ...glund also confirmed using Mlucas running on an [[Amazon EC2]] instance in 2.7 days2 KB (333 words) - 13:16, 17 February 2019
- The official discovery date for 2<sup>{{Num|74207281}}</sup>-1 was 2016-01-07. See the [http://www.mersenne.o ...ill, who each ran the [[CUDALucas]] software on NVidia Titan Black GPUs in 2.3 days2 KB (283 words) - 11:50, 18 February 2019
- ...-09-04 when the pair discovered the [[M44|44th]] known [[Mersenne prime]], 2<sup>32 582 657</sup>-1. As of 2008-09-15 his account is ranked #1 on [[Prim On 2013-01-25 Cooper discovered his third Mersenne prime, 2<sup>57 885 161</sup>-1, the [[M48|48th]] known.2 KB (237 words) - 11:34, 14 January 2024
- ...k's father enabled them to find factors for all integers up to ''48911<sup>2</sup>'', and these factorisations were published in a book in 1929. That su ...improvement to the [[Lucas primality test]] for [[Mersenne prime]]s <math>2^p{-}1</math>, extending its application to all odd prime exponents ''p'', a6 KB (1,033 words) - 01:13, 15 January 2024
- ==Base 2== HP<sub>2</sub>(10):980 bytes (143 words) - 13:22, 6 March 2019
- ==Search for Home Primes base 2== {{HP|2|2295|281|189|2013-07-23|}}2 KB (175 words) - 18:45, 14 December 2023
- *[[2 Minus Tables]] *[[2 Plus Tables]]614 bytes (69 words) - 12:08, 13 February 2019
- ...zation]] of numbers of the form <math>b^n\pm 1</math> for <math>b</math> = 2, 3, 5, 6, 7, 10, 11, 12. The values of the exponent <math>n</math> are sele | 2 || 3 || 5 || 6 || 7 || 10 || 11 || 127 KB (1,150 words) - 23:48, 19 April 2023
- ==Factorizations Of Cunningham Numbers C<sup>-</sup>(2,n) = 2<sup>n</sup> - 1== * 001 - 100 : {{FDBCunningham|2|-|1|100}}2 KB (176 words) - 12:01, 13 February 2019
- M25 is 2<sup>{{Num|21701}}</sup>-1, a number of {{Num|6533}} [[digit]]s. .... They were testing this theory and that Tuckerman's discovery of [[M24]] (2<sup>{{Num|19937}}</sup>-1) was the start of this island.2 KB (303 words) - 11:01, 26 February 2019
- ...S<sub>0</sub>=4 and S<sub>n</sub> = (S<sub>n-1</sub>)<sup>2</sup> − 2. In 1930, the American mathematician [[Derrick Henry Lehmer]] (1905 - 1991) ...hat 2<sup>5</sup> - 1 divides S<sub>3</sub> (37634 / 31 = 1214) shows that 2<sup>5</sup> - 1 is prime.20 KB (3,572 words) - 14:30, 17 February 2019
- ...te the [[Lucas-Lehmer test]]. In 1876, Lucas proved the primality of <math>2^{127}{-}1</math> ([[M12]]) and this remained the highest [[Mersenne prime]]2 KB (296 words) - 01:09, 15 January 2024
- ...at people use in most of the world. [[Computer]]s use '''binary''' or base 2. The length of a number (how many [[digit]]s it takes to write the number) ...us symbols (called [[digit]]s) for no more than ten distinct values (0, 1, 2, 3, 4, 5, 6, 7, 8 and 9) to represent any numbers, no matter how large. The1 KB (190 words) - 10:23, 18 January 2019
- Different bases are often used in [[computer|computers]]. Binary (base 2) is used because at the most simple level, computers can only deal with 0s ! Decimal<br>base=10 !! Binary<br>base=2 !! Hexadecimal<br>base=162 KB (399 words) - 10:37, 18 January 2019
- *the nonnegative [[integer]]s (0, 1, 2, 3, ...) *the positive integers (1, 2, 3, ...) (often called [[natural number]]s)413 bytes (54 words) - 09:51, 8 February 2019
- ...[natural number]]s (1, 2, 3, …), their negatives (−1, −2, −3, ...) and the number zero. The set of all integers is usually den ...f [[division]], since the quotient of two integers (''e.g.'', 1 divided by 2), need not be an integer.3 KB (404 words) - 14:58, 26 March 2023
- ...s <math>a</math> and <math>b</math>, <math>(a + b) * (a - b)\,=\,a^2\,-\,b^2</math>.1 KB (186 words) - 17:00, 5 February 2019
- In [[mathematics]]: to sum 2 numbers. It is normally symbolized by the plus sign '+'. :2 + 2 = 4333 bytes (43 words) - 16:55, 29 August 2022
- ...largest available register is ''n'' bits wide the factors can only be ''n/2'' bits wide each.2 KB (271 words) - 17:00, 29 August 2022
- :<math>n! = 1 \cdot 2 \cdot 3 \cdots (n{-}2) \cdot (n{-}1) \cdot n</math> :5! = 5 * 4 * 3 * 2 * 1 = 120729 bytes (93 words) - 13:40, 5 November 2023
- :<math>\frac 63 = 2</math> :<math>2 \times 3 = 6</math>.2 KB (368 words) - 16:58, 29 August 2022
- ...ft over after dividing something. Dividing 13 into groups of 5 would yield 2 groups, with a remainder of 3.245 bytes (34 words) - 14:07, 18 January 2019
- **Greatest prime factor ^2+1, ^2+2, ^2-1, ^2-2, ^3+1, ^3-11 KB (144 words) - 13:44, 24 January 2019
- ...composite numbers have small factors (half of the numbers are multiples of 2, a third are multiples of 3 and so on) it pays to run factorization methods4 KB (642 words) - 12:57, 5 March 2019
- The official discovery date for 2<sup>{{Num|57885161}}</sup>-1 was 2013-01-25. See the [http://www.mersenne.o *[https://www.youtube.com/watch?v=QSEKzFGpCQs New Largest Known Prime Number 2<sup>57,885,161</sup>-1] at YouTube channel Numberphile2 KB (235 words) - 11:49, 18 February 2019
- ...found. [[M45]], [[M46]], and M47 were discovered in the order of M47, M45 (2 weeks later), then M46 (8 months later). On 2018-04-08 all tests below 2<sup>{{Num|43112609}}</sup>-1 were verified by [[GIMPS]], officially making5 KB (694 words) - 13:17, 21 August 2019
- ...fafaf; background-color: #f9f9f9; border-collapse: collapse;" cellpadding="2" !Comparison of CPU core power!!Frequency!!Cores!!colspan="2" | [[Fast Fourier transform|FFT]]!![[Trial factoring]]!!TDP11 KB (1,586 words) - 12:24, 7 August 2021
- ...n the physcial world, an even number of objects can be placed into exactly 2 groups that have the identical number of objects. All numbers ending in 0, 2, 4, 6, or 8 are even.425 bytes (61 words) - 11:19, 7 March 2019
- An '''odd number''' is any [[integer]] that is not divisible by 2. ...notation, the odd numbers end in 1, 3, 5, 7 or 9. All prime numbers except 2 are odd.316 bytes (42 words) - 11:21, 7 March 2019
- | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2.4 GHz Pentium 4 [[Personal computer|PC]] '''M41''' is the short hand used to refer to the 41st [[Mersenne prime]] 2<sup>{{Num|24036583}}</sup>-1.1 KB (203 words) - 11:26, 18 February 2019
- | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2 GHz Pentium 4 [[Personal computer|PC]] '''M43''' is the short hand used to refer to the 43rd [[Mersenne prime]] 2<sup>{{Num|30402457}}</sup>-1.1 KB (191 words) - 11:31, 18 February 2019
- | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 3 GHz Core 2 [[Personal computer|PC]] '''M46''' is the short hand used to refer to the 46th [[Mersenne prime]] 2<sup>{{Num|42643801}}</sup>-1.2 KB (248 words) - 11:45, 18 February 2019
- |Rb=2403 bytes (26 words) - 18:40, 2 January 2023
- |Rb=2935 bytes (70 words) - 18:56, 10 December 2022
- |Rb=2255 bytes (24 words) - 22:20, 10 December 2022
- |Pb=2432 bytes (32 words) - 13:38, 2 January 2023
- |Pb=2498 bytes (31 words) - 13:34, 2 January 2023
- |Rb=2 2;T:S490 bytes (35 words) - 12:22, 11 December 2022
- |Rb=2 2557 bytes (25 words) - 12:35, 11 December 2022
- |Pb=2334 bytes (32 words) - 15:12, 27 January 2023
- ...Programming, Volume 2, 3rd Edition, 1997, Addison-Wesley, ISBN 0-201-89684-22 KB (263 words) - 11:53, 7 February 2019
- | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2.4 GHz Pentium 4 [[Personal computer|PC]] '''M42''' refers to the 42nd [[Mersenne prime]] 2<sup>{{Num|25964951}}</sup>-1.934 bytes (118 words) - 11:26, 18 February 2019
- | nvalue= 2193 bytes (19 words) - 13:43, 17 February 2019
- ...t in proving the [[Liskovets-Gallot conjectures]] for the forms {{Kbn|±|k|2|n}} where {{Vn}} is always odd '''and''' where {{Vn}} is always even. ==Sub-project #2==3 KB (503 words) - 02:20, 1 May 2024
- :<math>\large f_j = \sum_{k=0}^{n-1} x_k e^{-{2\pi i \over n} jk } \qquad j = 0, ... ,n-1.</math> Evaluating these sums directly would take O(''n''<sup>2</sup>) arithmetical operations . An FFT is an algorithm to compute the same17 KB (2,684 words) - 18:50, 28 September 2023
- ...rform nearly two times faster than [[CUDALucas]] due to using non-power-of-2 [[Fast Fourier transform|FFT]] lengths. [http://www.mersenneforum.org/showt2 KB (239 words) - 11:12, 13 February 2019
- ...ehmer test|LL]], [[Probable prime|PRP]]|title=gpuOwL|release=2017|latest=7.2<br>2020-11-01}} ...nch] at GitHub (version 1 uses 4M FFT and is about 50% faster than version 2) [http://www.mersenneforum.org/showpost.php?p=479585&postcount=320]1 KB (216 words) - 05:22, 1 December 2020
- | foundwith=[[Lucas-Lehmer test]] / Maple on Harwell Lab [[Cray-2]] :2<sup>756 839</sup>-1, a number {{Num|227832}} [[decimal]] [[digit]] long was2 KB (279 words) - 08:35, 18 February 2019
- '''M33''' refers to 33rd [[Mersenne prime]] number 2<sup>{{Num|859433}}</sup>-1. ...percomputer]]. Computation of [[Lucas-Lehmer test]] for this number took 7.2 hours.814 bytes (97 words) - 08:38, 18 February 2019
- ...size (smallest to largest) and in order of discovery. Specifically M34 is 2<sup>{{Num|1257787}}</sup>-1, which is a number {{Num|378632}} [[decimal]] [3 KB (513 words) - 08:42, 18 February 2019
- ...2008-01-10. The project searches for [[Riesel prime]]s of the form {{Kbn|k|2|n}} with odd {{Vk}} and 300 < {{Vk}} < 1001 and {{Vn}} > 260000 not reserve745 bytes (111 words) - 02:17, 1 May 2024
- ==Factorizations Of Cunningham Numbers C<sup>+</sup>(2,n) = 2<sup>n</sup> + 1== * 001 - 100 : {{FDBCunningham|2|+|1|100}}2 KB (127 words) - 15:28, 17 August 2019
- <math>|z| = \sqrt{x^2+y^2}</math>556 bytes (89 words) - 16:58, 29 August 2022
- ...power of 2 multiplied by a perfect power of 5, i.e. it has the form <math>2^n \times 5^m</math>.3 KB (541 words) - 15:01, 26 March 2023
- ...at to be a definition. Some examples of irrational numbers are <math>\sqrt{2}</math> or <math>e</math>.763 bytes (124 words) - 15:14, 26 March 2023
- ...umbers using only two [[digit]]s (usually, 0 and 1). Thus it is a [[base]] 2 numbering system. Example: 10110011<sub>2</sub> = 179<sub>10</sub>1 KB (210 words) - 11:16, 22 January 2019
- ...eing the number referred to as "unity") numbers. 111 is a repunit, in base 2 it is equal to 7 (base 10), in base 3 it is equal to 13 (base 10). A '''Generalized repunit''' for any base {{Vb}} ≥ 2 is defined as1 KB (207 words) - 08:04, 12 March 2024
- ...hen a single [[processor]], multiple processors, or multiple cores perform 2 or more operations (similar or different) at once, that is '''parallel comp ! Step !! Input 1 !! Operation !! Input 2 !! Result !! 1440<br>x 3653 KB (416 words) - 06:47, 1 May 2019
- ...0. Computers normally use a very similar 'shift and add' algorithm in base 2. [[Prime95]] does not use this form of multiplication for large numbers, us2 KB (165 words) - 17:01, 29 August 2022
- ...to use as trial divisors. If P(i) is the i'th prime number so P(1) = 2, P(2) = 3, P(3) = 5, etc, then the last prime factor possibility for some number ...< \sqrt{N}</math>) there is no need to try 7 since 2*7 is excluded because 2 will have been tried, 3*7 is excluded because 3 will have been tried, and 57 KB (1,221 words) - 13:20, 11 February 2019
- | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2 GHz Dell Dimension ...hort hand used to refer to the 40th [[Mersenne prime]]. Specifically it is 2<sup>{{Num|20996011}}</sup>-1. This number was discovered to be [[prime]] on1 KB (189 words) - 11:17, 18 February 2019
- '''Michael Shafer''' discovered the [[M40|40th]] [[Mersenne prime]], 2<sup>{{Num|20996011}}</sup>-1 at [[GIMPS]] project.660 bytes (88 words) - 00:39, 15 January 2024
- ...nt. He is credited with discovery of the [[M41|41st known Mersenne prime]] 2<sup>{{Num|24036583}}</sup>-1.695 bytes (93 words) - 11:46, 14 January 2024
- ...hort hand used to refer to the 39th [[Mersenne prime]]. Specifically it is 2<sup>{{Num|13466917}}</sup>-1. This number was discovered to be [[prime]] on868 bytes (109 words) - 11:14, 18 February 2019
- ...efer to the 44th [[Mersenne prime]]. Currently that designation belongs to 2<sup>{{Num|32582657}}</sup>-1.997 bytes (129 words) - 11:35, 18 February 2019
- | foundwith=[[Lucas-Lehmer test]] / [[Prime95]] on 2.83 GHz Core 2 Duo [[Personal computer|PC]] '''M45''' normally refers to 2<sup>{{Num|37156667}}</sup>-1, the 45th [[Mersenne prime]] in order of size2 KB (251 words) - 11:40, 18 February 2019
- ...way who discovered the [[M46|46th Mersenne prime]] (chronologically 47th), 2<sup>{{Num|42643801}}</sup>-1. Strindmo goes by the alias '''Stig M. Valstad Strindmo's 3 GHz Core 2 Duo PC first reported the prime to GIMPS on 2009-04-12. However, due to a s991 bytes (141 words) - 00:33, 15 January 2024
- His Erdös number is 2. He was one of the primary verifiers of [[M32]], [[M33]], and [[M34]].3 KB (431 words) - 11:36, 14 January 2024
- | top5000id=2 ...hort hand used to refer to the 38th [[Mersenne prime]]. Specifically it is 2<sup>{{Num|6972593}}</sup>-1. This number was discovered to be [[prime]] on1 KB (165 words) - 11:10, 18 February 2019
- ...ers employee from Michigan who discovered the [[M38|38th Mersenne prime]], 2<sup>{{Num|6972593}}</sup>-1.809 bytes (109 words) - 23:55, 14 January 2024
- ...s are coprime with a probability over 60% (the exact number is <math>6/\pi^2</math>).738 bytes (112 words) - 09:50, 23 January 2019
- ...s arithmetic modulo 12 and the set of numbers representing the hours 0, 1, 2, 3,..., 11 is known as <b>Z</b>/12<b>Z</b>. ...</b>/n<b>Z</b> of numbers modulo n contains the numbers 0, 1, 2, 3, ..., n-2 and n-1. The following operations are defined:4 KB (625 words) - 10:25, 23 January 2019
- ...math>ab\,\equiv \,c\,\pmod{m}</math>. We will also assume that <math>m\,<\,2^n</math>. :<math>a'=2^n\,a\,\bmod{m}</math>.4 KB (582 words) - 17:01, 29 August 2022
- ...iplication|multiplying]] lots of different prime numbers together. So that 2 x 3 x 5 x 7 x 11 x 13 etc will be a highly composite number. But that is on ...,9</math> is a quadratic expression (because the highest power of ''x'' is 2).19 KB (3,181 words) - 22:27, 6 July 2023
- Specifically 2<sup>{{Num|1398269}}</sup>-1, written out in full [http://www.mersenneforum.2 KB (224 words) - 11:00, 18 February 2019
- ...ter]]. Robinson's Mersenne primes were the first to be found in 75 years (2 in the very first day of the run, no less). And he raised the number of dig ...ugust of 2008, a Dell Optplex 745 (running a Intel Core 2 Duo E6600 CPU at 2.4GHz) in the UCLA Math department computer lab, found [[M47|47th Mersenne p2 KB (347 words) - 14:54, 19 September 2021
- ...e [[Mersenne number]]s were all composite except for 17 values of ''n'' = 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, [[M12|127]], [[M13|521]], [[M14|607]4 KB (526 words) - 14:51, 19 September 2021
- ...hort hand used to refer to the 36th [[Mersenne prime]], specifically it is 2<sup>{{Num|2976221}}</sup>-1. This number was dicovered to be [[prime]] on 1 The corresponding [[perfect number]] is 2<sup>{{Num|2976220}}</sup> • (2<sup>{{Num|2976221}}</sup>-1). This number is {{Num|1791864}} digits long.2 KB (279 words) - 11:01, 18 February 2019
- |0||1||2||3||4||5||6||7||8||9||10||11||12||13||14||15||16||17||18||19||20||21||22||2 ...th prime 2 24737|24737]], [[Proth prime 2 55459|55459]], and [[Proth prime 2 67607|67607]] (current status [https://www.primegrid.com/stats_sob_llr.php5 KB (650 words) - 10:25, 26 March 2024
- :Found factor [[Proth prime 2 5|{{Kbn|+|5|2|39}}]] of {{DGF|36}}2 KB (195 words) - 00:13, 15 January 2024
- The aim of the project is to find [[prime]]s of the form <math>k*2^n+1</math>, where ''k'' is one of the remaining 17 (now 5) candidates for [ |format=,*[[%PAGE%|²{#titleparts:%TITLE%¦1¦2}²]]\n,,3 KB (544 words) - 16:44, 21 July 2019
- | rank= 2 | pdigits= 2193 bytes (19 words) - 13:43, 17 February 2019
- | digits= 2194 bytes (19 words) - 13:43, 17 February 2019
- ...r positive divisors and 1 + 2 + 3 = 6. The next perfect number is 28 = 1 + 2 + 4 + 7 + 14. The next perfect numbers are 496 and 8128. ...irst four perfect numbers are generated by the formula 2<sup>''n''-1</sup>(2<sup>''n''</sup>-1):6 KB (885 words) - 11:33, 7 March 2019
- The ninth [[Mersenne prime]], 2<sup>61</sup>-1 or {{Num|2305843009213693951}}. ...prime number, ([[Édouard Lucas]] having shown earlier that [[M12]], <math>2^{127}-1</math> is also prime), and it remained so until 1911. Prior to the2 KB (213 words) - 14:30, 17 February 2019
- ...volved 2 independent double checks. [[Mlucas]] and [[Glucas]] are used and 2 different processor types are used. [[Landon Curt Noll]]'s [[Mprime (Cray)|2 KB (373 words) - 15:08, 5 June 2019
- Here is the Lucas test for <math>2^7-1</math>, which is 127: :S1 = (4 * 4 - 2) mod 127 = 141 KB (235 words) - 10:24, 6 February 2019
- ! rowspan="2" | Hardware ...one, and the average GIMPS participant has completed less than three (mean 2.67).8 KB (1,218 words) - 15:37, 13 August 2020
- ...variants) should work. (The [[Mfaktc#Future|next version]] will require CC 2.0 or newer.) **executables: CUDA >= 4.2 capable driver (295 series or newer)5 KB (765 words) - 14:54, 25 February 2019
- -v <n> verbosity level: 0=terse, 1=normal, 2=verbose, 3=debug -tf <exp> <min> <max> trial factor M<exp> from 2^<min> to 2^<max> and exit instead of parsing the worktodo file17 KB (2,524 words) - 12:39, 24 January 2019
- *x<sub>2</sub> = f(x<sub>1</sub>) ...<sub>n+1</sub> = x<sub>n</sub><sup>2</sup> + a, where a <math>\neq </math>-2.3 KB (558 words) - 10:28, 6 February 2019
- ...ński problem]] article, [[Hans Riesel]] found in 1956 that [[Riesel prime 2 509203|{{Kbn|509203|n}}]] is always composite. *[[Riesel 2 Riesel|Riesel numbers]]827 bytes (112 words) - 08:21, 25 March 2024
- ...son|Robinson]] at [[University of California, Los Angeles]] found [[M13]], 2<sup>521</sup>-1. ...mula (2<sup>2</sup>-1=7) also produces a prime. When this value is tested (2<sup>7</sup>-1=127), another prime is produced. So, Lucas was testing to see2 KB (354 words) - 14:52, 19 September 2021
- *[[Proth's theorem]]: Used to test numbers of the form {{Kbn|+|k|n}} with 2<sup>{{Vn}}</sup> > {{Vk}}, making it useful in several [[distributed comput3 KB (501 words) - 05:20, 3 August 2021
- Prove that N = 811 is prime knowing that N-1 = 2 × 3<sup>4</sup> × 5 :<math>3^{810/2}\,= \,3^{405}\,\equiv \, 810\,\pmod{811}</math>1 KB (177 words) - 14:31, 17 February 2019
- For example, <math>\sqrt 9 = 3</math> since <math>3^2 = 3 \times 3 = 9</math>. ...uadratic equations such as <math>x^2=9</math> or, more generally, <math>ax^2+bx+c=0</math>.13 KB (1,873 words) - 16:52, 24 October 2020
- ...r numbers, like the [[Generalized Fermat number]]s <math>F_{n,2} = 4^{3^n}+2^{3^n}+1</math> with k = 5 instead of k = 3. ...<math>F_n = 2^{2^n}+1</math> is a prime if and only if <math>\ 3^{(F_n-1)/2} \ \equiv -1 \ \pmod{F_n}</math>.2 KB (401 words) - 14:40, 6 March 2019
- *'''Step 2''' :<math>\sum_{k=1}^{n}\,(2k-1)\,=\,n^{2}</math>4 KB (679 words) - 13:57, 20 February 2019
- ...and scaled using an [[exponent]]. The [[base]] for the scaling is normally 2, 10 or 16. The typical number that can be represented exactly is of the for2 KB (294 words) - 22:56, 3 February 2019
- ...on is <math>z = x + iy</math>. From the previous paragraph we get: <math>i^2 = -1</math>. ..._1 y_1 + x_2 y_2}{x_2^2 + y_2^2}\,+\,\frac {x_2 y_1 - x_1 y_2}{x_2^2 + y_2^2} \,i</math>2 KB (280 words) - 14:59, 26 March 2023
- *'''M(''exponent'') no factor from 2^(''startdepth'') to 2^(''end depth'')'''. ...system. They're currently at Level 21.07 (around twenty one candidates to 2^87). Their greatest factor was found at bit depth 85 by Åke Tilander, a fa6 KB (918 words) - 16:28, 24 July 2020
- ...hort hand used to refer to the 37th [[Mersenne prime]]. Specifically it is 2<sup>{{Num|3021377}}</sup>-1. This number was discovered to be [[prime]] on877 bytes (111 words) - 11:04, 18 February 2019
- ...ting power#P90 years|P90 CPU years]] of [[Lucas-Lehmer test|LL testing]] (#2 in [[PrimeNet]]) and over 7200 P90 CPU years of [[GIMPS factoring and sievi620 bytes (88 words) - 11:46, 12 February 2019
- It is known that any factor of the Mersenne number <math>2^p-1</math> must be of the algebraic form <math>2kp+1</math> for some positi ...t an efficient way to do this, however! It is much easier to compute <math>2^p\,\bmod n</math>, i.e., the remainder after division by <math>n</math> by6 KB (962 words) - 10:08, 7 March 2019
- :<math>{x^2}\equiv{q}\ (mod\ p)</math>823 bytes (117 words) - 20:11, 26 October 2020
- :<math>r^2 \equiv a\ \pmod m</math> ...ulus. When this modulus is odd, we assume that the quantity <math>a^{(m-1)/2} \bmod m</math> equals 1 (otherwise there is no square root if <math>a \not5 KB (726 words) - 10:38, 6 February 2019
- ...h; that is to say there exists an integer <math>k</math> such that <math>k^2 \equiv a \pmod{p}</math>, or in other words <math>a</math> is a quadratic r #<math>\left(\frac{-1}{p}\right) = (-1)^{(p-1)/2} = \begin{cases} 1 & \text{if } p \equiv 1 \pmod{4} \\ -1 & \text{if } p \e2 KB (348 words) - 18:57, 28 September 2023
- This does not cover the cases where we want to know whether -1 or 2 are quadratic residues or non-residues modulo <math>p</math>. *2 is a quadratic residue modulo <math>p</math> if and only if <math>p</math>1 KB (208 words) - 18:19, 2 October 2022
- In a period just over 2 weeks in summer 2008, the first two [[Mersenne prime]]s greater than {{Num|979 bytes (146 words) - 14:23, 6 March 2019
- ...gram]] available 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
- ...d as '''MM<sub>p</sub>''', '''MMp''', or '''MM(p)''' and refer to <math>2^{2^p-1}-1</math>. Early on it was thought that if M(p) was prime so too was MM *MM(2) = <math>2^3-1</math> = 7, known prime since antiquity4 KB (655 words) - 14:50, 19 September 2021
- :<math>E = 2^{E_2} * 3^{E_3} * 5^{E_5} * ... * B</math> where <math>E_2</math> is selected so that <math>2^{E_2}</math> is about B1 and the same for the other prime numbers. ''B'' is5 KB (814 words) - 01:35, 12 March 2019
- A naive stage 2 would then compute T=S<sup>q</sup> = 3<sup>E*q</sup> for successive prime q ...s > 3 are of form 6k+/-1. Suppose instead that we compute T=S<sup>(6k)<sup>2</sup>-1</sup> = 3<sup>E*(6k-1)*(6k+1)</sup> whenever one of 6k+1 or 6k-1 is2 KB (421 words) - 11:51, 28 January 2019
- ...power. If somehow we find two integers X and Y such that <math>X^2\equiv Y^2\,\pmod N</math> and <math>X\not\equiv \pm Y\pmod N</math>, then <math>\gcd( ...values X and Y the method finds ''relations'' which have the form <math>t^2 \equiv u\,\pmod N</math> where u is the product of small [[prime]] numbers.10 KB (1,763 words) - 02:56, 12 March 2019
- ...a\left(\exp\left( \left(\frac{32}{9}n\right)^{\frac{1}{3}} (\log n)^{\frac{2}{3}} \right)\right).</math>1 KB (186 words) - 12:07, 19 February 2019
- *If <math>m^2\equiv 1\,\pmod p</math> then <math>m\equiv 1\,\pmod p</math> or <math>m\equ ...<math>N</math> be an odd number being tested for primality, and <math>N = 2^n\,k + 1</math> where <math>k</math> is an odd number.3 KB (432 words) - 15:33, 28 January 2019
- ...(2^{p^n}-1)</math> where p is the prime of apparition rank r (r(2)=1, r(3)=2, r(5)=3, ...) and n is greater or equal to 0. :<math>F_{n,2}</math> generates the [[Saouter number]]s.5 KB (726 words) - 09:57, 12 September 2021
- He is credited with discovery of the [[M51|51th known Mersenne prime]] 2<sup>{{Num|82589933}}</sup>-1.987 bytes (147 words) - 01:27, 15 January 2024
- ...Search|321 Prime Search]] searching for mega primes of the form {{Kbn|±|3|2|n}}. ...rch]] searching for primes of the forms {{Kbn|±|27|2|n}} and {{Kbn|±|121|2|n}}.3 KB (458 words) - 10:28, 26 March 2024
- ...software forced into service has had important benefits. Since one of the 2 new primes was 10 million decimal digits long, it qualified for one of the2 KB (381 words) - 14:05, 21 August 2019
- ...ect|distributed computing project]] to search for [[prime]]s of the form 3*2<sup>n</sup>-1.1 KB (185 words) - 09:34, 3 August 2021
- ...>2</math>. Since every second number after that will be divisible by <math>2</math>, we cross out every second number; all such numbers are composite. ...umber is <math>3</math>. We see that <math>3</math> is prime because <math>2 \geq \sqrt{3}</math>. Now we cross out every third number which hasn't been4 KB (654 words) - 11:10, 6 February 2019
- | 2 || [[Curtis Cooper|UCM-curtisc]] || 269146232 KB (206 words) - 09:56, 7 March 2019
- :<math>s_0\ =\ 10,\ \sigma(10)=1\ +\ 2\ +\ 5\ +\ 10</math> :<math>s_1\ =\ 18\ -\ 10\ =\ 8,\ \sigma(8)\ =\ 1\ +\ 2\ +\ 4\ +\ 8</math>6 KB (914 words) - 19:49, 21 February 2023
- The divisors of 12 are <math>(1, 2, 3, 4, 6, 12)</math>, so :<math>\sigma(12)\ =\ 1+2+3+4+6+12\ =\ 28</math>671 bytes (92 words) - 00:34, 30 January 2019
- ...1 that is only divisible by itself and 1. The first few prime numbers are 2, 3, 5, 7, 11, 13, 17, 19. ...P) + 1. From the form of the number Q, it is obvious that no integer from 2 to P divides evenly into Q, because each division would leave a remainder o2 KB (447 words) - 00:22, 10 July 2023
- | align="right" | 10<sup>1</sup> || align="right" | 2 | align="right" | 10<sup>2</sup> || align="right" | 82 KB (255 words) - 06:08, 21 February 2023
- |Pb=2 |PCount=2581 bytes (64 words) - 19:18, 5 April 2023
- ...th>x</math> (the exponent) must also be prime. Thus, the notation of <math>2^{p}-1</math> is generally used when discussing the search for a [[Mersenne A number that is itself prime '''and''' can be written in the form <math>2^{x}-1</math>. These are what [[GIMPS]] is searching for.3 KB (467 words) - 20:32, 14 February 2019
- The work accomplished by one core of a hypothetical 1GHz Core 2 Duo [[CPU]] in one day. One P90 year equals 5.075 GHz-days. 1 TFLOPS equals2 KB (257 words) - 22:54, 3 February 2019
- !colspan="2"| !colspan="2"|33 KB (4,920 words) - 10:54, 7 March 2019
- | 4847 || {{PP|75994|4847 × 2<sup>{{Num|3321063}}</sup>+1}} || 999744 || 2005-10-15 || Richard Hassler | 5359 || {{PP|67719|5359 × 2<sup>{{Num|5054502}}</sup>+1}} || 1521561 || 2003-12-06 || Randy Sundquist2 KB (163 words) - 14:20, 7 March 2019
- ...rime95]] and [http://linux.redbird.com/~alien88/sbfactor12.zip SBFactor v1.2]. Be warned that SBFactor doesn't allow resuming a factoring in the middle ...he sievedepth is around 49 and 50, the factorworth is best between 1.5 and 2, around 1.7. Save it and rename it to make_worktodo.bat. Run it. Then start3 KB (491 words) - 13:39, 1 February 2019
- ...rfect numbers are known) are all closely related to the primes of the form 2<sup>p</sup>-1, for some prime ''p'' (now called [[Mersenne prime|Mersennes] ...g new. Mersennes have one of the simplest possible forms for primes, <math>2^p-1</math>. The proof of their primality has an elegant simplicity (to a ma7 KB (1,252 words) - 09:47, 7 March 2019
- ...+ b</math>, while in the second the sequence has the form <math>m\, =\, an^2 + bn + c</math>. If we need to find prime numbers, for all primes between 2 and the square root of the maximum member of the sequence, set to 1 those e3 KB (521 words) - 11:14, 6 February 2019
- :900 = 2<sup>2</sup> × 3<sup>2</sup> × 5<sup>2</sup>436 bytes (63 words) - 21:36, 3 February 2019
- *[[PPSieve]] (sieving for factors of numbers of the form K × 2<sup>n</sup> + 1 or - 1. Independent of K's, but good for many N's too) and *[[AthGFNSieve]] (performing sieving of generalized Fermat numbers b<sup>2<sup>n</sup></sup>+1) http://www.underbakke.com/AthGFNsv/2 KB (220 words) - 11:42, 7 March 2019
- *k×2<sup>n</sup>+1, k×2<sup>n+1</sup>+3 (Sophie Germain) ...sup>n</sup>+1, 2k×b<sup>n</sup>+1 (Cunningham Chain 2nd kind, length 2)3 KB (529 words) - 09:32, 7 March 2019
- ...prime. For example, 23 is a Sophie Germain prime because it is a prime and 2*23+1 = 47, also prime. | 1 || 2 || -1 KB (171 words) - 04:26, 3 November 2020
- '''M13''' is the 13th known [[Mersenne prime]] 2<sup>521</sup>-1 found on 1952-01-30 by [[Raphael M. Robinson]].419 bytes (48 words) - 14:50, 19 September 2021
- '''M14''' is the 14th known [[Mersenne prime]] 2<sup>607</sup>-1 found on 1952-01-30 by [[Raphael M. Robinson]].420 bytes (48 words) - 14:49, 19 September 2021
- '''M15''' is the 15th known [[Mersenne prime]] 2<sup>{{Num|1279}}</sup>-1 found on 1952-06-25 by [[Raphael M. Robinson]].430 bytes (49 words) - 14:49, 19 September 2021
- '''M16''' is the 16th known [[Mersenne prime]] 2<sup>{{Num|2203}}</sup>-1 found on 1952-10-07 by [[Raphael M. Robinson]].431 bytes (49 words) - 14:49, 19 September 2021
- '''M17''' is the 17th known [[Mersenne prime]] 2<sup>{{Num|2281}}</sup>-1 found on 1952-11-09 by [[Raphael M. Robinson]].431 bytes (49 words) - 14:49, 19 September 2021
- '''M18''' is the 18th known [[Mersenne prime]] 2<sup>{{Num|3217}}</sup>-1 found on 1957-09-08 by [[Hans Riesel]].415 bytes (47 words) - 22:26, 17 February 2019
- '''M11''' is the 11th known [[Mersenne prime]] 2<sup>107</sup>-1</math> found in 1914 by [[Ralph Ernest Powers]].412 bytes (47 words) - 14:23, 17 February 2019
- '''M10''' is the 10th known [[Mersenne prime]] <math>2^{89}-1</math> found in 1911 by [[Ralph Ernest Powers]].403 bytes (44 words) - 13:54, 17 February 2019
- Let <math>p = k*2^n+1</math> and <math>k < 2^n</math>; then <math>p</math> is prime if there is an integer <math>a</math :<math>a^{(p-1)/2} \equiv -1\pmod{p}</math>.549 bytes (88 words) - 18:15, 28 September 2023
- ...is not a true class of numbers, but primes in the form {{Kbn|+|k|n}} with 2<sup>''n''</sup> > ''k'' are often called Proth primes.656 bytes (91 words) - 07:02, 31 August 2020
- ...ion of a '''Riesel prime''' mostly all primes of the form {{Kbn|k|n}} with 2<sup>{{Vn}}</sup> > {{Vk}} are called like this on many pages. *[https://www.mersenneforum.org/showthread.php?t=8621 "RPS {{Vk}}*2^{{Vn}}-1, {{Vk}}<300 reservations/status"]: [https://www.mersenneforum.org/2 KB (279 words) - 03:48, 24 April 2024
- '''M26''' is the 26th known [[Mersenne prime]] 2<sup>{{Num|23209}}</sup>-1 found on 1979-02-09 by [[Landon Curt Noll]].455 bytes (52 words) - 23:01, 17 February 2019
- ! 2 | 2 || 2813 bytes (111 words) - 16:56, 29 August 2022
- ...2 × 2 × 2 × ...). They are normally represented as <math>2^n</math> where n is the [[exponent]]. ...refix for multiples of 1024 is kibi-, so 1024 bytes = 1 kibibyte. 1024<sup>2</sup> bytes = 1 mebibyte, 1024<sup>3</sup> bytes = 1 gibibyte, and so on.839 bytes (127 words) - 11:38, 6 February 2019
- ...mple, 3 = 4 - 1 = 2<sup>2</sup> - 1 is a Mersenne prime; so is 7 = 8 - 1 = 2<sup>3</sup> - 1. See [[Mersenne prime]]. ...At the time of writing, a candidate at the current wavefront may take 1 to 2 weeks on a modern PC (say, a quad core Intel with AVX2 instructions or an A14 KB (2,370 words) - 15:15, 17 August 2019
- *'''[[Fermat number]]''' - Numbers of the form <math>2^{2^n} + 1</math>. *'''[[Mersenne prime]]''' - Primes of the type <math>2^n-1</math> (implying n is also prime).1 KB (190 words) - 10:55, 7 March 2019
- ...of 1.92 or 2.06 then you know the correct value is 2. If you end up with 2.2 then the calculation is invalid. If you proved that the maximum accumulated ...of 1.92 or 2.06 then you know the correct value is 2. If you end up with 2.2 then the calculation is invalid. If you proved that the maximum accumulated12 KB (1,995 words) - 09:55, 7 March 2019
- ...GP PORT for your AGP card is set to operate at a fixed fraction, (2/3 or 1/2), of the FSB.14 KB (2,326 words) - 15:17, 11 February 2019
- An '''area''' is defined as a surface enclosed by a shape. It can be 2 or 3 dimensional. For 3 dimensional shapes, the surface is the area.215 bytes (32 words) - 13:43, 18 September 2022
- :4△ = 4 + 3 + 2 + 1 = 10 (10 pin bowling uses a triangular arrangement.) :5△ = 5 + 4 + 3 + 2 + 1 = 15 (a common billiards arrangement is 15 balls in a triangle.)655 bytes (81 words) - 12:49, 25 March 2019
- !rowspan="2"|{{Key|o}} !rowspan="2"|{{Key|e}}3 KB (431 words) - 10:20, 7 March 2019
- ...two integers <math>X</math> and <math>Y</math> such that <math>X^2\equiv Y^2\,\pmod N</math> and <math>X\not\equiv \pm Y\pmod N</math>, then <math>\gcd( ...<math>Y</math> the method finds ''relations'' which have the form <math>t^2 \equiv u\,\pmod N</math> where <math>u</math> is the product of small [[pri6 KB (1,068 words) - 14:33, 13 February 2019
- :{{V|N}} = {{Kbn|+|k|2|n}} ...is an odd positive [[integer]] and {{Vn}} is a positive integer such that 2<sup>{{Vn}}</sup> > {{Vk}}.670 bytes (104 words) - 10:59, 9 July 2021
- ...r prime numbers of the form: 27 × 2<sup>n</sup> ± 1 and 121 × 2<sup>n</sup> ± 1. ...s]]. The bigger primes are 27 × 2<sup>1902689</sup>-1 and 27 × 2<sup>2218064</sup>+1, which weighs in at 572768 digits and 667706 digits, f983 bytes (138 words) - 13:25, 8 February 2019
- ...m: 121 × 2<sup>n</sup>-1, it also searches for primes of 121 × 2<sup>n</sup>+1 after being a partner of [[PrimeGrid]]. ...y 7 primes in the [[The Prime Pages]], their largest number is 121 × 2<sup>2033941</sup>-1 which weighs in at 612280 digits. This prime was found984 bytes (143 words) - 13:30, 8 February 2019
- ...php?showsource=1] of FFT sizes and run times as calculated on the baseline 2.0 GHz Core2 Duo machine that set the current GHz-days credit standards. ...php?showsource=1] of FFT sizes and run times as calculated on the baseline 2.0 GHz Core2 Duo machine that set the current GHz-days credit standards (sam20 KB (3,473 words) - 18:42, 14 December 2023
- *Standard (take the next exponent the server hands out, takes 1 to 2 weeks on typical hardware<ref>By typical, I am referring to a quad core Int ...ll yield a number with at least 100 million digits, these will take around 2 weeks on a Radeon VII, or several weeks on high end consumer hardware <ref>4 KB (757 words) - 15:17, 25 July 2020
- ...taticly linked ''sprimexxx.tar.gz'' for systems that do not have the glibc 2.1 runtime libraries. *'''OS/2''': Max Alekseyev has ported the Linux version to OS/2. Download his ''os2vxxx.zip'' zipped executable.4 KB (623 words) - 13:39, 26 March 2019
- ...ing as it slows down, and there are [[twin prime]]s - primes that are only 2 apart like 612,107 and 612,109 - and this makes matters more complicated. ...there are only two possible outcomes, so the chance of it being heads is 1:2. From the fact that a number either is prime or it is not one might suppose3 KB (593 words) - 10:09, 7 March 2019
- *[[Elliptic curve method|ECM]]2=assignment ID,k,b,n,c,B1,B2,curves to do<nowiki>[</nowiki>,specific_sigma,B2 KB (273 words) - 22:58, 11 May 2019
- <math>\large U_0 = 0\,,\, U_1 = 1\,,\, V_0 = 2\,,\, V_1 = u </math> ...= uU_{n-1} - U_{n-2}\,,\, V_n = uV_{n-1} - V_{n-2}</math> for <math>n\geq 2</math>8 KB (1,536 words) - 11:35, 12 February 2019
- :W<sub>n</sub> = n × 2<sup>n</sup>-1374 bytes (59 words) - 16:41, 31 August 2021
- 2. If you want to factor <math>a^{61}-1</math>, you can rewrite the power as ...culty 113) or <math>x^5-100</math> (difficulty 115) by the method of 1. or 2. alone.7 KB (1,238 words) - 16:14, 12 February 2019
- |<math>2^{772}+1</math> || 611380852128317600120825600011309662450676630495941840761 |<math>2^{779}+1</math> || 1731587812904886392797490548069644836972374709303549879994 KB (237 words) - 12:17, 13 February 2019
- ...prime) and 2<sup>p</sup> is not divisible by 3 (it's only prime factor is 2). ...159965}}) found by ECMNet, as well as 36-digit factor of M<sub>11213</sub>+2 ({{FDBID|1000000000012161237}}) found using ''mprime'' (the linux version o2 KB (215 words) - 13:33, 5 March 2019
- ...ized version using the [http://home.roadrunner.com/~mrodenkirch/ecmnet_3.0.2.zip source code]. 2. Move your homemade ecm.exe to the unzipped ecmclient folder (along with yo2 KB (383 words) - 11:16, 26 February 2019
- Distributed under GNU General Public License version 2. :*Get [http://mpir.org/mpir-2.5.1.tar.bz2 MPIR] and [https://gforge.inria.fr/frs/download.php/30965/ecm-64 KB (567 words) - 10:54, 6 December 2019
- ...]] to ensure validity of [[Proth prime|Proth]] tests and PRP tests on base-2 [[Riesel prime]] candidates, and by those programs and [[PRST]] in an exten # <math>u(t) \equiv (a^k)^{2^t} \pmod{p}</math>3 KB (528 words) - 14:59, 3 October 2023
- ...:Jacobi symbol|Jacobi symbol]] of the residue plus 2 <math>\left(\frac{Res+2}{M_p}\right)</math> has to be +1 *Jacobi symbol of the residue minus 2 <math>\left(\frac{Res-2}{M_p}\right)</math> has to be -11 KB (166 words) - 18:36, 27 September 2023
- *[[BPSW test]] (strong PRP-2 test followed by extra strong Lucas-Selfridge test)2 KB (237 words) - 18:04, 2 December 2019
- ...0025-5718-1975-0384673-1.pdf "New Primality Criteria and Factorizations of 2^{{V|m}} ± 1"]. ''Mathematics of Computation.'' Volume 29, Number 130: 620-584 bytes (85 words) - 20:12, 26 October 2020
- They add 512-bit vector operations capabilities in 2013, with up to 2 FMAs (Fused Multiply Add instructions), to accelerate performance of demand1 KB (147 words) - 14:12, 14 February 2019
- ...eported. If the number has not had a successful [[double check]], the last 2 digits are masked. For unconfirmed results any error code is also displayed7 KB (1,137 words) - 15:30, 13 August 2020
- | foundwith=[[Lucas-Lehmer test]] / [[NEC SX-2]]296 bytes (26 words) - 08:25, 18 February 2019
- :'''2018-12-07''' : '''[[M51]]''' = 2<sup>{{Num|82589933}}</sup>-1 is reported prime. :'''2017-12-26''' : '''[[M50]]''' = 2<sup>{{Num|77232917}}</sup>-1 is reported prime.3 KB (479 words) - 10:55, 7 March 2019
- ...2 / AMD 64-bit / Itanium 64-bit / Itanium 64-bit SP 1 / Itanium 64-bit SP 2) :Windows NT (3 / 4 / 4 SP 1 / 4 SP 2 / 4 SP 3 / 4 SP 4 / 4 SP 5 / 4 SP 6)766 bytes (95 words) - 12:25, 19 February 2019
- A '''Mersenne composite''' is any number of the form 2<sup>n</sup>-1 which is a [[composite number]]. ...e, because it is multiple of both [[Mersenne number]]s 2<sup>p</sup>-1 and 2<sup>q</sup>-1.347 bytes (62 words) - 13:07, 19 February 2019
- ...of two square integers is also a square number (e.g. 2/3 × 2/3 = 4/9). :1<sup>2</sup> = 13 KB (408 words) - 13:56, 19 February 2019
- Example: n squared equals n<sup>2</sup> = n × n.341 bytes (47 words) - 14:03, 19 February 2019
- == Level 2 == == Level 2 ==5 KB (805 words) - 06:50, 1 May 2019
- ...{{Num|1000000}} and {{Num|2000000}} for factors between 2<sup>64</sup> and 2<sup>68</sup>. :bd is where to begin trial-factoring at (2<sup>bd</sup>).2 KB (300 words) - 16:08, 19 February 2019
- {{DISPLAYTITLE:Riesel problem, {{Kbn|-|k|2|n}}, {{Vk}} < {{Num|509203}}}} ...wed that there are an infinite number of integers {{Vk}} such that {{Kbn|k|2|n}} is not prime for any integer {{Vn}}. He showed that the number {{Vk}} =6 KB (689 words) - 18:14, 4 April 2024
- Sieved NewPGen-files are available for the projects 15k (phase 2), [http://mersenneforum.org/showthread.php?t=2667 PSP] and [http://www.mers ...ake sure the numbers are of the same form (normally k*2<sup>n</sup>+1 or k*2<sup>n</sup>-1).2 KB (337 words) - 13:24, 20 February 2019
- ...889; it characterises the set (class, condition) of [[natural number]]s 1, 2, 3, etc., and consists of the following '''Peano postulates''' (also called :{{V|x}} + 2 = {{V|x}}<sup>+<sup>+</sup></sup>2 KB (269 words) - 17:04, 24 October 2020
- ...ave a 0 [[residue]], we could start with that 0 residue and repeatedly add 2 and take a square root. Unfortunately, taking a modular square root is comp2 KB (392 words) - 14:37, 20 February 2019
- ...Internet Mersenne Prime Search|GIMPS]]'s LL tests fall roughly into one of 2 categories. As time passes and GIMPS exhausts smaller exponents, both leadi ...on completion. The largest Mersenne number successfully double checked was 2<sup>{{Num|666666667}}</sup>-1, with {{Num|200686664}} digits. It was tested2 KB (415 words) - 21:32, 12 February 2020
- ...ng project]] searching for factors of the [[Mersenne number]] M(3326400) = 2<sup>{{Num|3326400}}</sup>-1.366 bytes (42 words) - 12:49, 21 February 2019
- ...abbreviated URL ''mersenne.ca/<numbers>'' where if the value is less than 2^32 it is assumed to be the exponent, otherwise it is assumed to be the fact ...Phase 2 of the factoring involves trial-factoring candidates to (at least) 2^64, using a simple [http://www.mersenne.ca/tf1G.php anonymous reservation s9 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://mat ::<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
- A '''Cullen number''' {{V|C<sub>n</sub>}} is a number of the form {{Kbn|+|n|2|n}}, ...}}, {{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
- |latest=2.4.5<br>2023-03-24 *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
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 2|CKMaxn}}/2)}} |CKDate={{GP|Carol-Kynea prime 2|CKDate}}389 bytes (47 words) - 10:31, 10 June 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 2|CKMaxn}}/3)}} |CKDate={{GP|Carol-Kynea prime 2|CKDate}}389 bytes (47 words) - 10:33, 10 June 2019
- ...rs''' 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''' are [ ...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 above forms8 KB (1,172 words) - 00:38, 6 July 2023
- :<math>n! = 1 \cdot 2 \cdot 3 \cdots (n{-}2) \cdot (n{-}1) \cdot n</math> :<math>n!! = (n) \cdot (n-2) \cdot (n-4) \cdots</math>560 bytes (81 words) - 14:36, 20 July 2021
- |Rb=2 2;T:ST;C:'''[[M1]]''', {{NWo|+|1}}, {{NWo|-|2}}, {{NWo|4|1}}2 KB (288 words) - 11:41, 3 April 2023
- |Rb=2 2;T:ST;C:{{NWo|+|2}}, {{NWi|MM|4|1}}5 KB (523 words) - 09:47, 5 October 2023
- |Rb=2 22 KB (196 words) - 18:36, 9 October 2021
- |Rb=23 KB (264 words) - 22:08, 5 July 2023
- category=Riesel 2 Low-weight [[Category:Riesel 2 Low-weight| ]]948 bytes (121 words) - 13:08, 21 July 2021
- |Rb=2 2;T:T2 KB (252 words) - 13:29, 5 May 2024
- |Rb=23 KB (329 words) - 07:59, 17 August 2021
- |Rb=22 KB (185 words) - 04:16, 5 May 2024
- |Rb=2 |RCount=2236 bytes (24 words) - 00:24, 17 July 2021
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 2|CKMaxn}}/4)}} |CKDate={{GP|Carol-Kynea prime 2|CKDate}}390 bytes (47 words) - 10:34, 10 June 2019
- |WiBase=2 |WiMaxn={{GP|Riesel prime 2 3|RMaxn}}246 bytes (35 words) - 14:04, 1 August 2021
- |WiBase=2 |WiMaxn={{GP|Proth prime 2 1|PMaxn}}243 bytes (35 words) - 08:06, 1 August 2021
- |WiBase=2 |WiMaxn={{GP|Proth prime 2 3|PMaxn}}259 bytes (36 words) - 10:52, 13 July 2021
- |WiMaxn={{#expr:floor({{GP|Riesel prime 2 3|RMaxn}}/2)}} |WiDate={{GP|Riesel prime 2 3|RDate}}265 bytes (37 words) - 20:50, 31 July 2021
- |WiMaxn={{GP|Riesel prime 3 2|RMaxn}} |WiDate={{GP|Riesel prime 3 2|RDate}}248 bytes (35 words) - 09:56, 16 March 2023
- |WiBase=2 |WiMaxn={{GP|Riesel prime 2 1|RMaxn}}244 bytes (35 words) - 20:47, 31 July 2021
- 2642 bytes (56 words) - 09:01, 22 November 2023
- 2430 bytes (42 words) - 11:00, 21 May 2019
- |WiMaxn={{#expr:floor({{GP|Riesel prime 2 7|RMaxn}}/3)}} |WiDate={{GP|Riesel prime 2 7|RDate}}291 bytes (42 words) - 20:52, 31 July 2021
- 2412 bytes (45 words) - 20:59, 31 July 2021
- 2318 bytes (29 words) - 11:41, 21 May 2019
- 2394 bytes (38 words) - 20:54, 31 July 2021
- |WiMaxn={{#expr:floor({{GP|Riesel prime 2 15|RMaxn}}/4)}} |WiDate={{GP|Riesel prime 2 15|RDate}}270 bytes (37 words) - 20:56, 31 July 2021
- 2218 bytes (19 words) - 12:22, 21 May 2019
- 2231 bytes (19 words) - 12:53, 21 May 2019
- 2221 bytes (19 words) - 13:00, 21 May 2019
- |Rb=22 KB (228 words) - 19:30, 19 July 2023
- 2233 bytes (19 words) - 13:24, 21 May 2019
- |WiMaxn={{#expr:floor({{GP|Riesel prime 2 31|RMaxn}}/5)}} |WiDate={{GP|Riesel prime 2 31|RDate}}270 bytes (37 words) - 21:00, 31 July 2021
- Here are shown the least {{Vn}}-value ≥ 1 for any base {{Vb}} with 2 ≤ {{Vb}} ≤ 2049 which generates a [[Williams prime]] of the form {{Kbn|2 KB (211 words) - 07:40, 1 August 2021
- |Pb=2 2;T:GT212 bytes (30 words) - 15:35, 2 October 2022
- |Pb=2 2;T:GT3 KB (336 words) - 16:58, 15 April 2024
- 3,2128 bytes (12 words) - 09:57, 30 July 2021
- 3,2,20905#1996#Anders Björn,Hans Riesel656 bytes (73 words) - 21:56, 16 August 2021
- |Pb=21 KB (144 words) - 11:12, 24 August 2021
- |Pb=2 2;T:G2 KB (267 words) - 21:47, 5 July 2023
- category=Category:Proth 2 title>=Proth prime 2 0750 bytes (108 words) - 14:39, 12 July 2021
- |Pb=2 2;T:G3 KB (432 words) - 18:48, 9 April 2023
- 3,2,5#1996#Anders Björn,Hans Riesel305 bytes (38 words) - 18:11, 23 August 2021
- |Pb=22 KB (240 words) - 08:58, 11 January 2023
- |Pb=2 2;T:G1 KB (175 words) - 07:07, 25 August 2021
- |Pb=2 2;T:T3 KB (390 words) - 10:00, 25 August 2021
- |Pb=21 KB (141 words) - 13:50, 25 August 2021
- |Pb=21 KB (145 words) - 09:32, 26 August 2021
- |Pb=2371 bytes (31 words) - 08:06, 18 September 2021
- Sieving a range {{Kbn|3|2|n}} to {{Kbn|20|19|n}} (in general {{Kbn|(b+1)|b|n}}) create a batch file n set /a base=2775 bytes (124 words) - 08:39, 22 April 2019
- Testing a range {{Kbn|3|2|n}} to {{Kbn|20|19|n}} (in general {{Kbn|(b+1)|b|n}}) create a batch file n set /a base=2871 bytes (147 words) - 12:29, 23 April 2019
- 2713 bytes (72 words) - 16:32, 12 February 2020
- 2511 bytes (46 words) - 12:17, 1 July 2019
- 2425 bytes (33 words) - 12:20, 1 July 2019
- 2467 bytes (43 words) - 06:55, 12 August 2019
- 2611 bytes (51 words) - 08:26, 9 August 2019
- 2374 bytes (31 words) - 08:52, 13 July 2019
- 2450 bytes (38 words) - 01:20, 8 July 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 2|CKMaxn}}/5)}} |CKDate={{GP|Carol-Kynea prime 2|CKDate}}390 bytes (47 words) - 13:59, 24 April 2019
- A '''Woodall prime''' is a [[Woodall number]] ({{Kbn|n|2|n}}), which is [[prime]]. ...ime''' could be defined as a Woodall prime with a general base {{Vb}} > 2, so of the form {{Kbn|n|b|n}}.1 KB (205 words) - 09:53, 13 March 2024
- 2593 bytes (52 words) - 10:32, 17 August 2023
- 2104 bytes (9 words) - 12:34, 12 April 2023
- 1;T:T;C:{{NRi|2}}, {{NWo|+|1}}, {{NWo|-|2}} 2;C:{{NRi|5}}, {{NWo|+|3}}1 KB (122 words) - 17:00, 31 August 2021
- 2;T:T;C:{{NRi|2|3|2}} 6;C:{{NRi|2|3|7}}1 KB (115 words) - 07:13, 17 August 2023
- |WoBase=2 2;C:{{NRi|3}}2 KB (230 words) - 10:36, 27 March 2023
- 2367 bytes (38 words) - 06:11, 6 April 2023
- 2;C:{{NRi|7}}702 bytes (72 words) - 10:58, 17 August 2023
- 2684 bytes (71 words) - 08:21, 30 April 2023
- A '''Cullen prime''' is a [[Cullen number]] ({{Kbn|+|n|2|n}}), which is [[prime]]. ...ime"''' could be defined as a Cullen prime with a general base {{Vb}} > 2, so of the form {{Kbn|+|n|b|n}}.2 KB (286 words) - 17:22, 7 May 2023
- |CuBase=2 {{DISPLAYTITLE:Cullen primes {{Kbn|+|n|2|n}}|noerror}}2 KB (175 words) - 14:54, 19 September 2021
- 2 54;C:{{NPr|2|3|57}}697 bytes (65 words) - 18:55, 19 July 2023
- 1;C:{{NPr|2}} {{HistC|2023-04-23|2-100000|Mark Rodenkirch}}, double-checked849 bytes (85 words) - 19:15, 14 July 2023
- {{HistC|2023-04-23|2-100000|Mark Rodenkirch}}, double-checked407 bytes (42 words) - 19:18, 14 July 2023
- 2 {{HistC|2023-04-24|2-100000|Mark Rodenkirch}}, double-checked848 bytes (88 words) - 18:59, 17 July 2023
- {{HistC|2023-04-23|2-100000|Mark Rodenkirch}}, double-checked532 bytes (56 words) - 19:23, 14 July 2023
- {{HistC|2018-08-14|2-800000|Serge Batalov}}, confirmed by private communication679 bytes (72 words) - 16:33, 7 May 2023
- 2520 bytes (48 words) - 12:21, 23 June 2021
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 6|CKMaxn}}/2)}} |CKClist={{Reuse Primelist|Carol-Kynea prime 6|CKClist|2}}390 bytes (47 words) - 14:14, 30 April 2019
- 2470 bytes (43 words) - 12:21, 23 June 2021
- 2277 bytes (21 words) - 12:31, 1 July 2019
- 2412 bytes (34 words) - 10:50, 16 April 2023
- |Pb=21 KB (103 words) - 12:07, 7 September 2021
- Here are shown the least {{Vn}}-value ≥ 1 for any base {{Vb}} with 2 ≤ {{Vb}} ≤ 1024 which generates a [[Williams prime]] of the form {{Kbn|3 KB (408 words) - 08:00, 1 August 2021
- Here are shown the least {{Vn}}-value ≥ 1 for any base {{Vb}} with 2 ≤ {{Vb}} ≤ 1024 which generates a [[Williams prime]] of the form {{Kbn|1 KB (161 words) - 13:57, 1 August 2021
- Here are shown the least {{Vn}}-value ≥ 1 for any base {{Vb}} with 2 ≤ {{Vb}} ≤ 1024 which generates a [[Williams prime]] of the form {{Kbn|2 KB (306 words) - 09:54, 7 September 2020
- |Rb=22 KB (184 words) - 22:47, 18 April 2024
- |WiNlist={{Reuse Primelist|Riesel prime 2 127|RNlist|7}}277 bytes (36 words) - 14:08, 16 March 2023
- 2 4217;35890;C:Divides Phi(3^4217,2)2 KB (151 words) - 00:47, 25 May 2020
- 2210 bytes (19 words) - 21:30, 16 May 2019
- 2195 bytes (17 words) - 09:49, 17 May 2019
- 2184 bytes (17 words) - 09:53, 17 May 2019
- 2170 bytes (17 words) - 10:58, 17 May 2019
- 2167 bytes (17 words) - 10:59, 17 May 2019
- 2191 bytes (17 words) - 11:04, 17 May 2019
- |Rb=2 2;T:S2 KB (224 words) - 06:12, 9 May 2024
- |WiMaxn={{#expr:floor({{GP|Riesel prime 2 63|RMaxn}}/6)}} |WiDate={{GP|Riesel prime 2 63|RDate}}325 bytes (42 words) - 21:05, 31 July 2021
- |WiMaxn={{Reuse Primelist|Proth prime 2 3|PMaxn|2}} |WiDate={{GP|Proth prime 2 3|PDate}}258 bytes (36 words) - 08:07, 1 August 2021
- |WiMaxn={{Reuse Primelist|Proth prime 2 7|PMaxn|3}} |WiDate={{GP|Proth prime 2 7|PDate}}284 bytes (41 words) - 08:16, 1 August 2021
- |WiMaxn={{#expr:floor({{GP|Proth prime 3 8|PMaxn}}/2)}} |WiNlist={{Reuse Primelist|Proth prime 3 8|PNlist|2}}387 bytes (53 words) - 08:30, 12 July 2021
- |WiMaxn={{#expr:floor({{GP|Riesel prime 2 5|RMaxn}}/2)}} |WiDate={{GP|Riesel prime 2 5|RDate}}265 bytes (37 words) - 14:05, 1 August 2021
- 2358 bytes (27 words) - 21:59, 20 April 2024
- 2444 bytes (35 words) - 12:23, 12 March 2024
- |Rb=24 KB (357 words) - 23:04, 19 April 2024
- |WiMaxn={{#expr:floor({{GP|Riesel prime 2 9|RMaxn}}/3)}} |WiDate={{GP|Riesel prime 2 9|RDate}}265 bytes (37 words) - 14:09, 1 August 2021
- 2428 bytes (42 words) - 22:03, 20 April 2024
- 2250 bytes (17 words) - 11:02, 23 May 2019
- 2439 bytes (38 words) - 16:04, 29 September 2020
- 2255 bytes (23 words) - 01:08, 29 September 2020
- |WiMaxn={{#expr:floor({{GP|Proth prime 2 15|PMaxn}}/4)}} |WiDate={{GP|Proth prime 2 15|PDate}}267 bytes (37 words) - 08:22, 1 August 2021
- 2313 bytes (23 words) - 18:30, 19 November 2020
- 2237 bytes (18 words) - 13:11, 22 May 2019
- |WiMaxn={{Reuse Primelist|Proth prime 5 24|PMaxn|2}} |WiNlist={{Reuse Primelist|Proth prime 5 24|PNlist|2}}358 bytes (45 words) - 08:28, 1 August 2021
- 2204 bytes (18 words) - 13:27, 22 May 2019
- 2233 bytes (18 words) - 13:32, 22 May 2019
- 2198 bytes (18 words) - 13:35, 22 May 2019
- |Pb=2826 bytes (91 words) - 09:28, 31 August 2021
- |WiMaxn={{Reuse Primelist|Proth prime 2 31|PMaxn|5}} |WiDate={{GP|Proth prime 2 31|PDate}}263 bytes (36 words) - 08:31, 1 August 2021
- 2201 bytes (18 words) - 14:03, 22 May 2019
- 2228 bytes (18 words) - 14:10, 22 May 2019
- |Pb=2328 bytes (32 words) - 13:00, 12 August 2021
- |WiMaxn={{#expr:floor({{GP|Proth prime 2 511|PMaxn}}/9)}} |WiDate={{GP|Proth prime 2 511|PDate}}272 bytes (37 words) - 09:15, 1 August 2021
- 2228 bytes (17 words) - 11:06, 23 May 2019
- 2233 bytes (17 words) - 11:29, 23 May 2019
- |Rb=2 22 KB (174 words) - 18:41, 5 May 2024
- |WiMaxn={{#expr:floor({{GP|Riesel prime 2 17|RMaxn}}/4)}} |WiDate={{GP|Riesel prime 2 17|RDate}}363 bytes (46 words) - 14:14, 1 August 2021
- 2211 bytes (18 words) - 12:47, 23 May 2019
- 2230 bytes (18 words) - 13:12, 23 May 2019
- 2275 bytes (26 words) - 13:19, 23 May 2019
- 2209 bytes (18 words) - 13:21, 23 May 2019
- 2277 bytes (26 words) - 13:23, 23 May 2019
- 2229 bytes (18 words) - 13:27, 23 May 2019
- |Rb=2 2;T:S3 KB (295 words) - 22:47, 5 July 2023
- |WiMaxn={{#expr:floor({{GP|Riesel prime 2 33|RMaxn}}/5)}} |WiDate={{GP|Riesel prime 2 33|RDate}}363 bytes (46 words) - 14:16, 1 August 2021
- 2251 bytes (18 words) - 14:15, 23 May 2019
- 2197 bytes (18 words) - 14:22, 23 May 2019
- 2567 bytes (52 words) - 06:08, 18 June 2020
- |WiMaxn={{#expr:floor({{GP|Proth prime 2 9|PMaxn}}/3)}} |WiDate={{GP|Proth prime 2 9|PDate}}278 bytes (38 words) - 11:59, 13 July 2021
- |WiMaxn={{#expr:floor({{GP|Proth prime 3 10|PMaxn}}/2)}} |WiNlist={{Reuse Primelist|Proth prime 3 10|PNlist|2}}268 bytes (37 words) - 08:34, 12 July 2021
- 2234 bytes (19 words) - 16:38, 26 May 2019
- 2224 bytes (19 words) - 10:19, 27 May 2019
- 2215 bytes (18 words) - 10:37, 27 May 2019
- 2210 bytes (18 words) - 10:40, 27 May 2019
- 2220 bytes (18 words) - 10:54, 27 May 2019
- 2216 bytes (18 words) - 11:02, 27 May 2019
- |Pb=22 KB (202 words) - 11:31, 31 August 2021
- |WiMaxn={{#expr:floor({{GP|Proth prime 2 33|PMaxn}}/5)}} |WiDate={{GP|Proth prime 2 33|PDate}}377 bytes (47 words) - 11:53, 13 July 2021
- 2210 bytes (18 words) - 11:34, 27 May 2019
- 2209 bytes (19 words) - 21:59, 27 May 2019
- 2197 bytes (19 words) - 22:10, 27 May 2019
- 2268 bytes (23 words) - 12:39, 1 July 2019
- 2324 bytes (28 words) - 12:46, 1 July 2019
- 2316 bytes (28 words) - 12:48, 1 July 2019
- 2231 bytes (19 words) - 08:52, 13 July 2019
- 2242 bytes (19 words) - 08:58, 13 July 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 2|CKMaxn}}/6)}} |CKDate={{GP|Carol-Kynea prime 2|CKDate}}390 bytes (47 words) - 20:26, 6 June 2019
- 2 2249 bytes (19 words) - 08:54, 13 July 2019
- 2213 bytes (19 words) - 08:52, 13 July 2019
- 2225 bytes (19 words) - 08:57, 13 July 2019
- 2229 bytes (19 words) - 08:56, 13 July 2019
- 2225 bytes (19 words) - 08:55, 13 July 2019
- 2215 bytes (19 words) - 09:01, 13 July 2019
- 2231 bytes (19 words) - 08:50, 13 July 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 10|CKMaxn}}/2)}} |CKClist={{Reuse Primelist|Carol-Kynea prime 10|CKClist|2}}398 bytes (47 words) - 20:53, 6 June 2019
- ...[[Riesel prime]] of the form {{Kbn|k|b|n}} for 2 ≤ {{Vb}} ≤ 1030 and 2 ≤ {{Vk}} ≤ 12. {{HistF|2017-06-16| {{Kbn|2|578|129468}}|Laurentiu Vornicu|461354}}6 KB (684 words) - 09:40, 17 March 2024
- ...a [[Proth prime]] of the form {{Kbn|+|k|b|n}} for 2 ≤ ''b'' ≤ 1030 and 2 ≤ ''k'' ≤ 12. ==={{Vk}} = 2===7 KB (795 words) - 08:03, 5 May 2024
- 2297 bytes (23 words) - 08:48, 13 July 2019
- 2283 bytes (23 words) - 08:54, 13 July 2019
- 2267 bytes (23 words) - 09:02, 13 July 2019
- 2279 bytes (23 words) - 08:53, 13 July 2019
- 2294 bytes (23 words) - 08:52, 13 July 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 2|CKMaxn}}/7)}} |CKDate={{GP|Carol-Kynea prime 2|CKDate}}391 bytes (47 words) - 10:32, 11 June 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 12|CKMaxn}}/2)}} |CKClist={{Reuse Primelist|Carol-Kynea prime 12|CKClist|2}}398 bytes (47 words) - 10:34, 11 June 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 14|CKMaxn}}/2)}} |CKClist={{Reuse Primelist|Carol-Kynea prime 14|CKClist|2}}398 bytes (47 words) - 10:35, 11 June 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 2|CKMaxn}}/8)}} |CKDate={{GP|Carol-Kynea prime 2|CKDate}}391 bytes (47 words) - 10:40, 11 June 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 18|CKMaxn}}/2)}} |CKClist={{Reuse Primelist|Carol-Kynea prime 18|CKClist|2}}398 bytes (47 words) - 10:42, 11 June 2019
- 2224 bytes (18 words) - 23:07, 17 June 2019
- 2219 bytes (18 words) - 23:11, 17 June 2019
- 2203 bytes (18 words) - 23:12, 17 June 2019
- 2204 bytes (18 words) - 23:16, 17 June 2019
- 2227 bytes (18 words) - 23:20, 17 June 2019
- 2207 bytes (18 words) - 23:23, 17 June 2019
- 2238 bytes (18 words) - 23:26, 17 June 2019
- 2235 bytes (18 words) - 23:33, 17 June 2019
- 2212 bytes (18 words) - 23:39, 17 June 2019
- 2186 bytes (18 words) - 23:41, 17 June 2019
- |Rb=2 {{HistC|2007-03-05|989600|65*2^n-1 thread|99924}}, released2 KB (222 words) - 06:13, 9 May 2024
- |WiMaxn={{#expr:floor({{GP|Riesel prime 2 65|RMaxn}}/6)}} |WiDate={{GP|Riesel prime 2 65|RDate}}319 bytes (41 words) - 14:24, 1 August 2021
- 2219 bytes (18 words) - 12:18, 18 June 2019
- 2210 bytes (18 words) - 12:20, 18 June 2019
- 2184 bytes (18 words) - 12:20, 18 June 2019
- |WiMaxn={{Reuse Primelist|Proth prime 6 35|PMaxn|2}} |WiNlist={{Reuse Primelist|Proth prime 6 35|PNlist|2}}356 bytes (45 words) - 08:33, 1 August 2021
- 2227 bytes (18 words) - 12:20, 18 June 2019
- 2206 bytes (18 words) - 12:18, 18 June 2019
- 2211 bytes (18 words) - 12:20, 18 June 2019
- 2195 bytes (18 words) - 12:20, 18 June 2019
- |WiMaxn={{Reuse Primelist|Proth prime 7 48|PMaxn|2}} |WiNlist={{Reuse Primelist|Proth prime 7 48|PNlist|2}}356 bytes (45 words) - 08:40, 1 August 2021
- 2292 bytes (31 words) - 08:42, 1 August 2021
- 2205 bytes (18 words) - 12:19, 18 June 2019
- 2203 bytes (18 words) - 12:22, 18 June 2019
- 2199 bytes (18 words) - 12:25, 18 June 2019
- |Pb=22 KB (279 words) - 19:01, 9 April 2023
- |WiMaxn={{#expr:floor({{GP|Proth prime 2 63|PMaxn}}/6)}} |WiDate={{GP|Proth prime 2 63|PDate}}267 bytes (37 words) - 08:43, 1 August 2021
- |Rb=2 {{HistC|2019-08-18|2200000|RPS Megabit Drive 2|523851}}2 KB (178 words) - 05:51, 9 May 2024
- |WiMaxn={{#expr:floor({{GP|Riesel prime 2 129|RMaxn}}/7)}} |WiDate={{GP|Riesel prime 2 129|RDate}}324 bytes (41 words) - 14:25, 1 August 2021
- |Rb=21 KB (126 words) - 03:35, 6 May 2024
- |WiMaxn={{#expr:floor({{GP|Riesel prime 2 257|RMaxn}}/8)}} |WiDate={{GP|Riesel prime 2 257|RDate}}324 bytes (41 words) - 14:26, 1 August 2021
- |Rb=2 {{HistC|2008-03-25|333200|NPLB Drive 2|129767}}2 KB (157 words) - 10:53, 5 April 2023
- |WiMaxn={{#expr:floor({{GP|Riesel prime 2 513|RMaxn}}/9)}} |WiDate={{GP|Riesel prime 2 513|RDate}}324 bytes (41 words) - 14:27, 1 August 2021
- |Rb=2 23 KB (249 words) - 13:48, 21 March 2023
- |WiMaxn={{#expr:floor({{GP|Riesel prime 2 1025|RMaxn}}/10)}} |WiDate={{GP|Riesel prime 2 1025|RDate}}282 bytes (37 words) - 14:30, 1 August 2021
- * {{Kbn|±|k|b|n}} (by default {{Vb}} is 2 but it can be changed)667 bytes (101 words) - 16:44, 31 August 2021
- |Pb=2 21 KB (103 words) - 09:49, 29 September 2021
- |WiMaxn={{#expr:floor({{GP|Proth prime 2 127|PMaxn}}/7)}} |WiDate={{GP|Proth prime 2 127|PDate}}272 bytes (37 words) - 08:49, 1 August 2021
- |Pb=2 2;T:T2 KB (245 words) - 10:36, 12 September 2021
- |WiMaxn={{#expr:floor({{GP|Proth prime 2 255|PMaxn}}/8)}} |WiDate={{GP|Proth prime 2 255|PDate}}272 bytes (37 words) - 08:51, 1 August 2021
- |Pb=2 2;T:T3 KB (289 words) - 10:52, 21 September 2021
- |WiMaxn={{#expr:floor({{GP|Proth prime 2 1023|PMaxn}}/10)}} |WiDate={{GP|Proth prime 2 1023|PDate}}279 bytes (37 words) - 09:20, 1 August 2021
- 2201 bytes (18 words) - 10:33, 25 June 2019
- 2205 bytes (18 words) - 10:57, 25 June 2019
- 2194 bytes (18 words) - 11:06, 25 June 2019
- 2215 bytes (18 words) - 11:13, 25 June 2019
- 2191 bytes (18 words) - 11:17, 25 June 2019
- 2197 bytes (18 words) - 12:00, 25 June 2019
- 2208 bytes (18 words) - 12:03, 25 June 2019
- 2199 bytes (18 words) - 12:04, 25 June 2019
- 2201 bytes (18 words) - 12:15, 25 June 2019
- |Pb=22 KB (186 words) - 18:58, 9 April 2023
- |WiMaxn={{#expr:floor({{GP|Proth prime 2 129|PMaxn}}/7)}} |WiDate={{GP|Proth prime 2 129|PDate}}290 bytes (38 words) - 12:03, 13 July 2021
- |Pb=2 22 KB (177 words) - 09:40, 7 September 2021
- |WiMaxn={{#expr:floor({{GP|Proth prime 2 513|PMaxn}}/9)}} |WiDate={{GP|Proth prime 2 513|PDate}}272 bytes (37 words) - 12:05, 13 July 2021
- 2370 bytes (34 words) - 13:35, 30 May 2020
- 2391 bytes (34 words) - 13:40, 30 May 2020
- 2219 bytes (18 words) - 08:48, 13 July 2019
- 2209 bytes (18 words) - 08:52, 13 July 2019
- 2199 bytes (18 words) - 08:51, 13 July 2019
- 2198 bytes (18 words) - 08:57, 13 July 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 20|CKMaxn}}/2)}} |CKClist={{Reuse Primelist|Carol-Kynea prime 20|CKClist|2}}398 bytes (47 words) - 12:28, 2 July 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 22|CKMaxn}}/2)}} |CKClist={{Reuse Primelist|Carol-Kynea prime 22|CKClist|2}}398 bytes (47 words) - 12:31, 2 July 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 2|CKMaxn}}/9)}} |CKDate={{GP|Carol-Kynea prime 2|CKDate}}391 bytes (47 words) - 12:32, 2 July 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 24|CKMaxn}}/2)}} |CKClist={{Reuse Primelist|Carol-Kynea prime 24|CKClist|2}}398 bytes (47 words) - 12:37, 2 July 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 26|CKMaxn}}/2)}} |CKClist={{Reuse Primelist|Carol-Kynea prime 26|CKClist|2}}398 bytes (47 words) - 12:38, 2 July 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 28|CKMaxn}}/2)}} |CKClist={{Reuse Primelist|Carol-Kynea prime 28|CKClist|2}}398 bytes (47 words) - 12:39, 2 July 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 30|CKMaxn}}/2)}} |CKClist={{Reuse Primelist|Carol-Kynea prime 30|CKClist|2}}398 bytes (47 words) - 12:40, 2 July 2019
- |CKMaxn={{#expr:floor({{GP|Carol-Kynea prime 2|CKMaxn}}/10)}} |CKDate={{GP|Carol-Kynea prime 2|CKDate}}395 bytes (47 words) - 12:43, 2 July 2019
- 2216 bytes (18 words) - 08:45, 13 July 2019
- 2210 bytes (18 words) - 08:45, 13 July 2019
- 2210 bytes (18 words) - 08:53, 13 July 2019
- 2237 bytes (18 words) - 08:47, 13 July 2019
- 2212 bytes (18 words) - 08:49, 13 July 2019
- 2204 bytes (18 words) - 08:44, 13 July 2019
- 2279 bytes (25 words) - 08:20, 3 July 2019
- 2207 bytes (18 words) - 08:21, 3 July 2019
- 2202 bytes (18 words) - 08:32, 3 July 2019
- 2218 bytes (18 words) - 08:35, 3 July 2019
- 2220 bytes (18 words) - 08:56, 3 July 2019
- 2209 bytes (18 words) - 08:59, 3 July 2019
- 2237 bytes (18 words) - 09:04, 3 July 2019
- 2225 bytes (18 words) - 10:04, 3 July 2019
- 2223 bytes (18 words) - 08:54, 13 July 2019
- 2219 bytes (18 words) - 08:52, 13 July 2019
- 2190 bytes (18 words) - 08:50, 13 July 2019
- 2198 bytes (18 words) - 08:47, 13 July 2019
- 2201 bytes (18 words) - 08:59, 13 July 2019
- 2201 bytes (18 words) - 08:46, 13 July 2019
- 2211 bytes (18 words) - 12:45, 3 July 2019
- 2188 bytes (18 words) - 07:16, 4 July 2019
- 2204 bytes (18 words) - 07:17, 4 July 2019
- 2227 bytes (18 words) - 07:24, 4 July 2019
- 2 2231 bytes (18 words) - 07:34, 4 July 2019
- 2212 bytes (18 words) - 07:51, 4 July 2019
- 2200 bytes (18 words) - 07:55, 4 July 2019
- 2207 bytes (18 words) - 07:58, 4 July 2019
- 2213 bytes (18 words) - 08:15, 4 July 2019
- 2180 bytes (16 words) - 08:42, 4 July 2019
- 2259 bytes (23 words) - 09:07, 4 July 2019
- 2 2205 bytes (18 words) - 10:10, 4 July 2019
- 2204 bytes (18 words) - 13:53, 4 August 2020
- 2210 bytes (18 words) - 11:52, 4 July 2019
- 2224 bytes (23 words) - 11:35, 28 July 2019
- 2264 bytes (28 words) - 12:21, 10 September 2019
- 2234 bytes (23 words) - 14:45, 29 August 2019
- 2291 bytes (28 words) - 00:18, 20 May 2021
- 2298 bytes (28 words) - 00:23, 20 May 2021