| 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
- 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
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
