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

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

Page title matches

Page text matches

  • GIMPS type of work
    ==P-1 factoring== ...d. The more memory available the greater the chance of finding a factor. P-1 factoring takes longer per single unit than TF, but the chance of finding a
    4 KB (757 words) - 15:17, 25 July 2020
  • How to get started with GIMPS
    ==Step 1== ...ticly linked ''sprimexxx.tar.gz'' for systems that do not have the glibc 2.1 runtime libraries.
    4 KB (623 words) - 13:39, 26 March 2019
  • GIMPS networking, PrimeNet and communication
    ...58 days and set the network retry to 300 minutes. Set the cache option to 1 day to prevent the client from attempting to get more work. ...cure proxy, the proxy password is encoded and a new parameter '''ProxyMask=1''' set. To change the password, simply change the ProxyPass= value, and eit
    8 KB (1,269 words) - 10:09, 7 March 2019
  • GIMPS chances of finding a prime number
    ...ast fifty throws, the chances of you throwing a six on your next throw are 1:6. What has happened in the past does not affect the number of faces on the ...; 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 suppo
    3 KB (593 words) - 10:09, 7 March 2019
  • Worktodo.txt
    ...t ID]],[[exponent]],how far factored,has been [[P-1 factorization method|P-1]]'ed ...ble check|DoubleCheck]]=assignment ID,exponent,how far factored,has been P-1'ed
    2 KB (273 words) - 22:58, 11 May 2019
  • Bit level
    ...e decimals are ten times as large. A number that has 70 binary digits (all 1's) would be at the 70 bit level. To check for factors from one bit level to | align="right" | 1 0000 1001 0011 0010
    1 KB (193 words) - 18:47, 14 December 2023
  • P+1 factorization method
    ...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
  • Woodall number
    :W<sub>n</sub> = n &times; 2<sup>n</sup>-1
    374 bytes (59 words) - 16:41, 31 August 2021
  • SNFS polynomial selection
    ...a^{59}-1</math> number currently not completely factored is <math>208^{59}-1</math>, the polynomials would be <math>x^5-208</math> on the algrebraic sid ...r polynomials are, for example for <math>N=208^{61}-1</math>, <math>208x^5-1</math> and <math>x-6557827967253220516257857536</math>.
    7 KB (1,238 words) - 16:14, 12 February 2019
  • NFSNET
    |<math>5^{311}+1</math> || 13132762900451821968706840158108829466847315743095478589617724372 |<math>5^{313}-1</math> || 21428622089774767159447145142284385968882142917892658511907216761
    4 KB (237 words) - 12:17, 13 February 2019
  • Mersenneplustwo factorizations
    ...p>-1 being prime). All such numbers are divisible by 3 since 2<sup>p</sup>-1 is not divisible by 3 (it's assumed to be prime) and 2<sup>p</sup> is not d
    2 KB (215 words) - 13:33, 5 March 2019
  • ECMclient
    1. Get it [http://home.earthlink.net/~elevensmooth/ElevenSmooth.zip here] and
    2 KB (383 words) - 11:16, 26 February 2019
  • GMP-ECM
    ...d|ECM]], [[P-1 factorization method|p-1]] and [[P+1 factorization method|p+1]] algorithms. The current version is 7.0.5-dev (svn 3038). 1. First you'll need to get the right environment and stuff to work with:
    4 KB (567 words) - 10:54, 6 December 2019
  • Gerbicz error checking
    # <math>d(t+1) \equiv d(t)*u((t+1)L) \pmod{p}</math> # <math>d(t+1) \equiv u(0)*d(t)^{2^L} \pmod{p}</math>
    3 KB (528 words) - 14:59, 3 October 2023
  • Jacobi error checking
    ...the residue plus 2 <math>\left(\frac{Res+2}{M_p}\right)</math> has to be +1 ...the residue minus 2 <math>\left(\frac{Res-2}{M_p}\right)</math> has to be -1
    1 KB (166 words) - 18:36, 27 September 2023
  • ECPP-DJ
    |latest=1.04<br><small>2014-08-16</small> :BLS75 proof using N-1
    2 KB (237 words) - 18:04, 2 December 2019
  • BLS75
    ...5-0384673-1.pdf "New Primality Criteria and Factorizations of 2^{{V|m}} ± 1"]. ''Mathematics of Computation.'' Volume 29, Number 130: 620-647. ...-1 factorization method|{{V|p}}-1]] and [[P+1 factorization method|{{V|p}}+1]].
    584 bytes (85 words) - 20:12, 26 October 2020
  • GIMPS PrimeNet reports
    ...Lehmer test|LL Tests]], LL [[double check]]s, [[P-1 Factorization methid|P-1]] factoring, and [[Elliptic curve method|ECM Factoring]]. These are also up Lists the current [[bit level]] and [[P-1 factorization method|P-1]] [[bounds]] for a given list of exponents which have no known factors and
    7 KB (1,137 words) - 15:30, 13 August 2020
  • Sierpiński-Riesel Base 5
    ...base 5]]: There are <b>{{#expr:{{PAGESINCATEGORY:PrimeGrid Riesel base 5}}-1}}</b> values to prove. ...5]]: There are <b>{{#expr:{{PAGESINCATEGORY:PrimeGrid Sierpiński base 5}}-1}}</b> values to prove.
    2 KB (231 words) - 11:42, 5 October 2020
  • M27
    | foundwith=[[Lucas-Lehmer test]] / [[Cray 1]]
    302 bytes (26 words) - 08:16, 18 February 2019

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

Retrieved from "https://www.rieselprime.de/ziki/Special:Search"