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

Jump to: navigation, search

Page title matches

Page text matches

  • ...actors of the [[Mersenne number]] M(3326400) = 2<sup>{{Num|3326400}}</sup>-1.
    366 bytes (42 words) - 12:49, 21 February 2019
  • ...ports, it lists the current [[bit level]] and [[P-1 factorization method|P-1]] [[bounds]] for a given list of exponents, that have no known factors.
    524 bytes (78 words) - 13:12, 21 February 2019
  • ...of finding a [[Mersenne prime]], many GIMPS users purposely skipped the P-1 stage to spend more time doing L-L first-time tests. ...sts are graphed, with known factors overlaid to show how close any known P-1 test(s) were to finding the factor(s). A similar graph shows known factors
    9 KB (1,396 words) - 15:42, 25 February 2019
  • :<math>2kp+1</math> where <math>p</math> is the [[exponent]] in <math>2^p-1</math>. <math>\begin{align}2^{23}-1 &= 8388607\\&= 47 * 178481\\
    702 bytes (99 words) - 10:43, 25 October 2020
  • *Numbers of the form <math>2^{4k+2}+1</math> have the following '''Aurifeuillian factorization''': [http://mathwo ::<math>2^{4k+2}+1 = (2^{2k+1}-2^{k+1}+1)\cdot (2^{2k+1}+2^{k+1}+1)</math>
    10 KB (1,257 words) - 08:04, 24 June 2019
  • {{V|C<sub>n</sub>}} is [[prime]] for {{Vn}} = 1, 141, {{PP|40087|4713}}, {{PP|38112|5795}}, {{PP|37374|6611}}, {{PP|23436|1
    2 KB (252 words) - 17:39, 31 August 2021
  • *[[GMP-ECM]] (performing ECM, P-1, and P+1) http://gforge.inria.fr/projects/ecm/ ...ime|MPrime]] (for Linux , FreeBSD, and MacOSX) (performing ECM, P-1, and P+1 to search for factors of a &times; b<sup>n</sup> ± c) ftp://mersenne.org/g
    2 KB (273 words) - 21:53, 8 July 2023
  • *dmdsieve: search for factors of numbers of the form 2*k*(2<sup>p</sup>-1)+1 (potential divisors of [[Double Mersenne number]]s)
    2 KB (338 words) - 06:58, 28 March 2023
  • ...numbers''' are numbers of the form <math>(b^n-1)^2-2</math> and <math>(b^n+1)^2-2</math>, respectively, while '''Carol primes''' and '''Kynea primes''' ...h>(b^n-1)^2-2</math> and a Kynea number is a number of the form <math>(b^n+1)^2-2</math>. A Carol/Kynea prime is a [[prime]] which has one of the above
    8 KB (1,172 words) - 00:38, 6 July 2023
  • ...r]] which is prime and of the form <math>\ n!_2{±}1,\ n!_3{±}1,\ n!_4{±}1</math>, and so on.
    429 bytes (50 words) - 14:29, 25 March 2019
  • :<math>n! = 1 \cdot 2 \cdot 3 \cdots (n{-}2) \cdot (n{-}1) \cdot n</math> for <math>n \geq 1</math>.
    560 bytes (81 words) - 14:36, 20 July 2021
  • |Rk=1 2;T:ST;C:'''[[M1]]''', {{NWo|+|1}}, {{NWo|-|2}}, {{NWo|4|1}}
    2 KB (288 words) - 11:41, 3 April 2023
  • 1;T:ST 2;T:ST;C:{{NWo|+|2}}, {{NWi|MM|4|1}}
    5 KB (523 words) - 09:47, 5 October 2023
  • {{HistC|2021-03-21|1-1000000|Gary Barnes|574248}}, double check, results included
    3 KB (295 words) - 11:33, 12 June 2024
  • 1 {{HistC|2021-03-21|1-1000000|Gary Barnes|574248}}, double check, results included
    3 KB (267 words) - 16:00, 13 June 2024
  • 1;T:ST {{HistC|2021-03-21|1-1000000|Gary Barnes|574248}}, double check, results included
    2 KB (245 words) - 15:55, 13 June 2024
  • 1
    4 KB (382 words) - 08:19, 25 June 2024
  • A '''Factorial prime''' is a [[prime]] of the form '''[[Factorial number]] ± 1'''. *Factorial primes of the form ''n!-1'' are of the {{OEIS|l|A002982}}.
    488 bytes (70 words) - 07:11, 1 April 2019
  • 1
    490 bytes (45 words) - 12:30, 3 July 2019
  • 1
    1 KB (143 words) - 02:41, 5 November 2020

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