Search results

Create the page "1" on this wiki! See also the search results found.

Page title matches

• Generalized Fermat number 2 1 11075
  |GFNb=1
  136 bytes (12 words) - 12:34, 6 July 2021
• Generalized Fermat number 2 1 134995
  |GFNb=1
  134 bytes (12 words) - 12:34, 6 July 2021
• Generalized Fermat number 2 1 5523858
  |GFNb=1
  133 bytes (12 words) - 12:35, 6 July 2021
• Generalized Fermat number 2 1 11
  |GFNb=1
  219 bytes (13 words) - 19:36, 6 July 2021
• Generalized Fermat number 2 1 12
  |GFNb=1
  288 bytes (20 words) - 11:49, 8 July 2021
• Generalized Fermat number 2 1 118
  |GFNb=1
  139 bytes (12 words) - 08:01, 18 September 2021
• Generalized Fermat number 2 1 28
  |GFNb=1
  196 bytes (20 words) - 07:09, 18 May 2024
• Generalized Fermat number 2 1 61
  |GFNb=1
  129 bytes (12 words) - 08:21, 7 July 2021
• Generalized Fermat number 2 1 96
  |GFNb=1
  135 bytes (12 words) - 08:47, 7 July 2021
• Generalized Fermat number 2 1 142
  |GFNb=1
  130 bytes (12 words) - 08:35, 18 September 2021
• Generalized Fermat number 2 1 459
  |GFNb=1
  136 bytes (12 words) - 09:08, 7 July 2021
• Generalized Fermat number 2 1 133
  |GFNb=1
  134 bytes (12 words) - 08:28, 18 September 2021
• Generalized Fermat number 2 1 635
  |GFNb=1
  130 bytes (12 words) - 10:41, 7 July 2021
• Generalized Fermat number 2 1 122
  |GFNb=1
  130 bytes (12 words) - 08:09, 18 September 2021
• Generalized Fermat number 2 1 943
  |GFNb=1
  133 bytes (12 words) - 11:07, 7 July 2021
• Generalized Fermat number 2 1 27
  |GFNb=1
  206 bytes (20 words) - 07:08, 18 May 2024
• Generalized Fermat number 2 1 13
  |GFNb=1
  279 bytes (19 words) - 07:46, 8 September 2021
• Generalized Fermat number 2 1 14
  |GFNb=1
  240 bytes (20 words) - 06:50, 9 July 2021
• Generalized Fermat number 2 1 15
  |GFNb=1
  261 bytes (19 words) - 08:40, 16 September 2021
• Generalized Fermat number 2 1 146
  |GFNb=1
  131 bytes (12 words) - 08:38, 18 September 2021

Page text matches

• Program
  *Knuth, Donald E., The Art of Computer Programming, Volume 1, 3rd Edition, 1997, Addison-Wesley, ISBN 0-201-89683-4
  2 KB (263 words) - 11:53, 7 February 2019
• GPU
  :P-1 testing
  2 KB (250 words) - 08:44, 13 February 2019
• M42
  '''M42''' refers to the 42nd [[Mersenne prime]] 2^{{{Num|25964951}}}-1.
  934 bytes (118 words) - 11:26, 18 February 2019
• M1
  | rank= 1 | digits= 1
  193 bytes (19 words) - 13:43, 17 February 2019
• Conjectures 'R Us
  ...|Riesel value]]' (-1 form) that is composite for all values of {{Vn}} ≥ 1. Conjectures must have a finite covering set. {{Vk}}-values are not conside ==Sub-project #1==
  3 KB (503 words) - 02:20, 1 May 2024
• Fast Fourier transform
  Let ''x''₀, ...., ''x''_''n''-1 be [[complex number]]s. The DFT is defined by the formula ...f_j = \sum_{k=0}^{n-1} x_k e^{-{2\pi i \over n} jk } \qquad j = 0, ... ,n-1.</math>
  17 KB (2,684 words) - 18:50, 28 September 2023
• GpuOwL
  ...://github.com/preda/gpuowl/tree/V1 gpuOwL V.1.x branch] at GitHub (version 1 uses 4M FFT and is about 50% faster than version 2) [http://www.mersennefor
  1 KB (216 words) - 05:22, 1 December 2020
• M32
  :2^{756 839}-1, a number {{Num|227832}} [[decimal]] [[digit]] long was found to be [[prime
  2 KB (279 words) - 08:35, 18 February 2019
• M33
  '''M33''' refers to 33rd [[Mersenne prime]] number 2^{{{Num|859433}}}-1.
  814 bytes (97 words) - 08:38, 18 February 2019
• M34
  ...and in order of discovery. Specifically M34 is 2^{{{Num|1257787}}}-1, which is a number {{Num|378632}} [[decimal]] [[digit]]s long. The number w
  3 KB (513 words) - 08:42, 18 February 2019
• 2 Plus Tables
  ==Factorizations Of Cunningham Numbers C⁺(2,n) = 2ⁿ + 1== * 001 - 100 : {{FDBCunningham|2|+|1|100}}
  2 KB (127 words) - 15:28, 17 August 2019
• Rational number
  :<math>\large a + \frac{k(b-a)}{n+1}</math> by varying the number <math>k</math> from 1 to <math>n</math>. Then we can make the value <math>n</math> as high as we
  3 KB (541 words) - 15:01, 26 March 2023
• Binary
  ...em, a representation for numbers using only two [[digit]]s (usually, 0 and 1). Thus it is a [[base]] 2 numbering system. ...the next digit to the right; the place value of the rightmost digit being 1.
  1 KB (210 words) - 11:16, 22 January 2019
• Repunit
  ...digit]]. All [[Mersenne number]]s are repunit ('''rep'''eated '''unit''', "1" being the number referred to as "unity") numbers. 111 is a repunit, in bas :(10ⁿ - 1) / 9
  1 KB (207 words) - 08:04, 12 March 2024
• Parallel computing
  ==Example 1== ! Step !! Input 1 !! Operation !! Input 2 !! Result !! 1440<br>x 365
  3 KB (416 words) - 06:47, 1 May 2019
• Trial factoring
  ...last prime factor possibility for some number N would be P(m) where P(m + 1) squared exceeds N. ...factor candidates would be close to <math>\frac {\sqrt{N}}{Ln(\sqrt{N}) - 1}</math> which for <math>N = 10^{20}</math> is 450 million.
  7 KB (1,221 words) - 13:20, 11 February 2019
• M40
  ...e 40th [[Mersenne prime]]. Specifically it is 2^{{{Num|20996011}}}-1. This number was discovered to be [[prime]] on 2003-11-17 by [[Michael Shaf ..., California (author of program [[Mlucas]]) using three weeks of time on a 1 GHz HP Alpha workstation.
  1 KB (189 words) - 11:17, 18 February 2019
• Michael Shafer
  ...scovered the [[M40|40th]] [[Mersenne prime]], 2^{{{Num|20996011}}}-1 at [[GIMPS]] project.
  660 bytes (88 words) - 00:39, 15 January 2024
• Josh Findley
  ...very of the [[M41|41st known Mersenne prime]] 2^{{{Num|24036583}}}-1.
  695 bytes (93 words) - 11:46, 14 January 2024
• M39
  | top5000id=1 ...e 39th [[Mersenne prime]]. Specifically it is 2^{{{Num|13466917}}}-1. This number was discovered to be [[prime]] on 2001-11-14 by [[Michael Came
  868 bytes (109 words) - 11:14, 18 February 2019

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)