Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Search results
Create the page "1" on this wiki! See also the search results found.
Page title matches
- '''P-1''' is a [[:Category:Factorization|factorization method]] invented by John P ...a prime which does not divide the integer ''a'', then <math>a^{p-1}\equiv 1 \mbox{( mod } p)</math>.5 KB (814 words) - 01:35, 12 March 2019
- ...Hugh Williams in 1982 and it is based in the [[p-1 factorization method|p-1]] method. <math>\large U_0 = 0\,,\, U_1 = 1\,,\, V_0 = 2\,,\, V_1 = u </math>8 KB (1,536 words) - 11:35, 12 February 2019
- Currently, there are '''{{#expr:{{PAGESINCATEGORY:Riesel problem 1|pages|R}}-2}}''' {{Vk}}-values smaller than {{Num|509203}} that have no kno ...with {{Vn}} in the interval 2<sup>{{V|m}}</sup> ≤ {{Vn}} < 2<sup>{{V|m}}+1</sup>. <ref>[http://www.prothsearch.com/rieselprob.html Riesel problem] by6 KB (689 words) - 18:14, 4 April 2024
- |Rk=1 2;T:ST;C:'''[[M1]]''', {{NWo|+|1}}, {{NWo|-|2}}, {{NWo|4|1}}2 KB (288 words) - 11:41, 3 April 2023
- |Pk=1 1212 bytes (30 words) - 15:35, 2 October 2022
- |GFNn=1128 bytes (12 words) - 09:57, 30 July 2021
- |GFNn=1125 bytes (12 words) - 15:10, 17 August 2021
- |GFNb=1133 bytes (12 words) - 07:54, 18 September 2021
- |GFNb=1133 bytes (12 words) - 07:49, 18 September 2021
- |GFNb=1127 bytes (12 words) - 19:00, 17 September 2021
- |GFNb=1133 bytes (12 words) - 18:55, 17 September 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
- ...> {{Num|2520000}}, {{Vk}} = 37 for {{Vn}} > {{Num|2500000}} only {{Vn}} != 1 mod 10, {{Vk}} = 103 for {{Vn}} ≥ {{Num|2550223}}, and {{Vk}} = 111 for ...000000}} < {{Vn}} < {{Num|4000000}} available <b>[[:File:RPS Megabit Drive 1 sieve.zip|here]]</b> (LLR-format, {{Num|290225}} candidates).4 KB (439 words) - 10:45, 9 May 2024
- This is the Maxi Drive 1 of [[No Prime Left Behind]]. [[Category:No Prime Left Behind|Maxi Drive 1]]576 bytes (60 words) - 11:57, 5 September 2021
- |GFNb=1141 bytes (12 words) - 08:56, 18 September 2021
- This is team drive #1 for [[No Prime Left Behind]]. We will be searching all {{Vk}}=400-1001 for [[Category:No Prime Left Behind|Drive 1]]416 bytes (55 words) - 11:51, 5 September 2021
- |GFNb=1124 bytes (12 words) - 12:34, 6 July 2021
- |GFNb=1124 bytes (12 words) - 14:11, 28 July 2021
- [[Category:Free-DC's Prime Search|Drive 1]]306 bytes (38 words) - 10:25, 15 May 2021
- |GFk=1 3,1,3302 bytes (8 words) - 07:36, 23 August 2021
- |GFk=1 4,3,1178 bytes (8 words) - 14:10, 23 August 2021
- |GFk=1 3,1,7337 bytes (8 words) - 16:28, 4 July 2021
- |GFk=1 3,1,15#1992#Harvey Dubner509 bytes (22 words) - 14:11, 22 August 2021
- |GFNb=1130 bytes (12 words) - 12:32, 6 July 2021
- |GFNb=1 |GFNDigits=1120 bytes (12 words) - 08:54, 5 July 2021
- |GFNb=1 |GFNn=1120 bytes (12 words) - 18:11, 1 August 2021
- |GFNb=1122 bytes (12 words) - 08:54, 5 July 2021
- |GFNb=1124 bytes (12 words) - 08:55, 5 July 2021
- |GFNb=1128 bytes (12 words) - 08:55, 5 July 2021
- |GFNb=1140 bytes (12 words) - 00:56, 23 June 2021
- |GFNb=1159 bytes (12 words) - 10:46, 23 June 2021
- |GFNb=1 1,4129 bytes (12 words) - 14:07, 28 July 2021
- |GFNb=1178 bytes (12 words) - 08:18, 16 September 2021
- |GFNb=1122 bytes (12 words) - 16:02, 17 August 2021
- |GFNb=1 |GFNn=1120 bytes (12 words) - 15:52, 17 August 2021
- |GFNb=1134 bytes (12 words) - 16:10, 17 August 2021
- |GFNb=1149 bytes (12 words) - 16:14, 17 August 2021
- |GFNb=1169 bytes (12 words) - 16:19, 17 August 2021
- |GFNb=1177 bytes (13 words) - 10:30, 2 July 2021
- |GFNb=1 1,8204 bytes (12 words) - 14:01, 28 July 2021
- |GFNb=1196 bytes (13 words) - 10:05, 16 September 2021
- |GFNb=1134 bytes (12 words) - 14:12, 28 July 2021
- |GFNb=1192 bytes (14 words) - 12:21, 2 July 2021
- |GFNb=1206 bytes (14 words) - 11:50, 8 July 2021
- |GFNb=1233 bytes (21 words) - 13:32, 8 July 2021
- |GFNb=1267 bytes (25 words) - 13:34, 8 July 2021
- |GFNb=1117 bytes (12 words) - 14:54, 5 July 2021
- |GFNb=1134 bytes (12 words) - 12:35, 6 July 2021
- |GFNb=1133 bytes (12 words) - 12:35, 6 July 2021
- |GFNb=1139 bytes (12 words) - 12:33, 6 July 2021
Page text matches
- 1 {{HistC|2018-12-06|1 - 321000|Karsten Bonath|501959}}917 bytes (86 words) - 12:13, 22 May 2019
- ...ber]] of the form {{Kbn|(b-1)|b|n}} for integers ''b'' ≥ 2 and ''n'' ≥ 1. | MM: {{Kbn|(b-1)|b|n}} || [[:Category:Williams prime MM|here]] ||[[Williams prime MM table|5 KB (744 words) - 07:30, 5 August 2019
- 15 KB (537 words) - 08:17, 9 October 2020
- 1 11 KB (85 words) - 10:45, 16 April 2023
- 11 KB (144 words) - 16:10, 29 March 2024
- srsieve -G -n 1 -N 100000 -P 10000000000 "1000*999^n+1" *<code>-n 1</code>: lowest value of ''n'' to search2 KB (265 words) - 07:36, 28 May 2021
- BEGIN {getline line; i=1} head[i]=11 KB (203 words) - 18:52, 2 October 2022
- 3n+1, & \mbox{if }n\mbox{ is odd} 3n+1, & \mbox{if }n\mbox{ is odd}11 KB (1,236 words) - 14:41, 3 September 2020
- ...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 ...>''': 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
- ...ime; so is 7 = 8 − 1 = {{Kbn|3}}. On the other hand, 15 = 16 − 1 = {{Kbn|4}}, for example, is not a prime, because 15 is divisible by 3 and :<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]]. ...r <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
- ...to its diameter in 1755, <math>\large i</math> for the <math>\large\sqrt{-1}</math> in 1777, the notation for finite differences <math>\large\delta y</16 KB (2,614 words) - 11:48, 14 January 2024
- <math> f=\frac{1}{2L}\sqrt{\frac{T}{\mu}}, </math> ...would be explained if the ratio of the air oscillation frequencies is also 1 : 2, which in turn is consistent with the source-air-motion-frequ11 KB (1,582 words) - 01:17, 15 January 2024
- ...with the definitions of the most basic and fundamental parts of geometry; 1. A point is that which has no part. 2. A line is breadthless length. From t2 KB (341 words) - 11:43, 14 January 2024
- ...with [[Landon Curt Noll]] discovered on 1978-10-30 that 2<sup>21701</sup>-1 was the [[M25|25th Mersenne prime]]. This made international news because N2 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>0</sub> = {{Kbn|+|1}} = 312 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/primes/press/M77232917.ht *[[Aaron Blosser]] verified it using [[Prime95]] on an Intel Xeon server in 1.5 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.org/primes/?press=M74207281 pr2 KB (283 words) - 11:50, 18 February 2019
- ...prime]], 2<sup>32 582 657</sup>-1. As of 2008-09-15 his account is ranked #1 on [[PrimeNet]] in [[Lucas-Lehmer test|LL testing]], with over 242 000 P90 ...3-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
- ...vement to the [[Lucas primality test]] for [[Mersenne prime]]s <math>2^p{-}1</math>, extending its application to all odd prime exponents ''p'', and ena6 KB (1,033 words) - 01:13, 15 January 2024
- {| border="1" cellpadding="4px" style="border:3px; border-color:#000; border-collapse:co {| border="1" cellpadding="4px" style="border:3px; border-color:#000; border-collapse:co2 KB (175 words) - 18:45, 14 December 2023
- ...to find the complete [[factorization]] 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 ex :<math>(b^{kn}-1) = (b^n-1) \sum _{r=0}^{k-1} b^{rn}</math>7 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. ...heory 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
- ...905 - 1991) provided a complete proof that this was not only true when p = 1 (mod 4), but for all odd prime exponents. The test therefore takes its name ...> - 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
- ...ucas-Lehmer test]]. In 1876, Lucas proved the primality of <math>2^{127}{-}1</math> ([[M12]]) and this remained the highest [[Mersenne prime]] for almos2 KB (296 words) - 01:09, 15 January 2024
- ...rious 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.1 KB (190 words) - 10:23, 18 January 2019
- | 1 || '''1''' || 12 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
- ...positive [[natural number]]s (1, 2, 3, …), their negatives (−1, −2, −3, ...) and the number zero. The set of all integers is u ...e operation of [[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
- :1 + 5 = 6333 bytes (43 words) - 16:55, 29 August 2022
- ...ponent|exponentiation]] (<math>a^0=1</math>) and [[factorial number]]s (0!=1).2 KB (271 words) - 17:00, 29 August 2022
- ...<math>a^p</math> means that we are notating the number <math>\large \frac{1}{a*a*a*a...}</math> where, you guess it, the [[absolute value]] of p repres ...th> equals the reciprocal (or the multiplicative inverse) of a, that means 1/a.1 KB (273 words) - 16:56, 29 August 2022
- :<math>n! = 1 \cdot 2 \cdot 3 \cdots (n{-}2) \cdot (n{-}1) \cdot n</math> for <math>n \ge 1</math>.729 bytes (93 words) - 13:40, 5 November 2023
- ...is a [[prime]] number, and a number that has factors other than itself and 1 is called a [[composite number]].576 bytes (107 words) - 19:03, 5 February 2019
- ...ive [[integer]] is '''composite''' if it is neither [[prime]] nor equal to 1. The smallest composite is 4. ...where the integers <math>a</math> and <math>b</math> are both greater than 1, the number is composite.358 bytes (56 words) - 23:30, 26 October 2020
- **Greatest prime factor ^2+1, ^2+2, ^2-1, ^2-2, ^3+1, ^3-11 KB (144 words) - 13:44, 24 January 2019
- ...ion method|p-1]]: It finds a factor ''p'' if the largest prime factor of p-1 is small. *[[p+1 factorization method|p+1]]: Similar to p-1, but succeeds if p+1 has no large factors.4 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.org/primes/?press=M57885161 pr .../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
- ...ormally refers to the 47th [[Mersenne prime]] 2<sup>{{Num|43112609}}</sup>-1, in order of size from the smallest to greatest. This is the primary usage On 2018-04-08 all tests below 2<sup>{{Num|43112609}}</sup>-1 were verified by [[GIMPS]], officially making it the 47th Mersenne prime.5 KB (694 words) - 13:17, 21 August 2019
- ...ehmer test|LL]], PRP, [[Trial factoring|TF]], [[P-1 factorization method|P-1]], [[Elliptic curve method|ECM]]|release=1996|latest=30.3b6<br/><small>2020 {| style="font-size: 85%; text-align: center" border="1" style="border: 1px solid #afafaf; background-color: #f9f9f9; border-collap11 KB (1,586 words) - 12:24, 7 August 2021
- When expressed in decimal 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
- CUDALucas -cufftbench 1 22680 5 CUDALucas -threadbench 1 22680 5 102 KB (275 words) - 11:11, 21 August 2019
- ...used to refer to the 41st [[Mersenne prime]] 2<sup>{{Num|24036583}}</sup>-1. ...nce using half of a Bull NovaScale 5000 HPC running Linux on 16 Itanium II 1.3 GHz CPUs for five days using the [[Glucas]] program by Guillermo Balleste1 KB (203 words) - 11:26, 18 February 2019
- ...used to refer to the 43rd [[Mersenne prime]] 2<sup>{{Num|30402457}}</sup>-1. *by Tony Reix of Bull S.A. in Grenoble, France, in 5 days using 16 Itanium2 1.5 GHz [[CPU]]s of a Bull NovaScale 6160 HPC at Bull Grenoble Research Cente1 KB (191 words) - 11:31, 18 February 2019
- ...used to refer to the 46th [[Mersenne prime]] 2<sup>{{Num|42643801}}</sup>-1.2 KB (248 words) - 11:45, 18 February 2019
- 1935 bytes (70 words) - 18:56, 10 December 2022
- 1;T:S490 bytes (35 words) - 12:22, 11 December 2022