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

  • What use are prime numbers anyway?
    ...orem of Arithmetic", states that every positive integer (except the number 1) can be expressed in exactly one way as the product of one or more primes.
    3 KB (497 words) - 07:17, 22 May 2020
  • Overclocking and Prime95
    ...If you proved that the maximum accumulated error cannot be more than +/-0.1 on a correct calculation then a processing error must have occurred. ...ng around the TLC site. Get things working stable and then drop the FSB by 1 MHz to give you a better safety factor.
    12 KB (1,995 words) - 09:55, 7 March 2019
  • Overclocking
    ...de Bus' (hereafter referred to as the FSB) speed. Lets say you have a nice 1.6A P4. (Historically this was one of the best CPUs for overclocking). That ...omething called a multiplier. It just so happens that the multiplier for a 1.6GHz P4 is 16. The reason behind this is quite simple...
    14 KB (2,326 words) - 15:17, 11 February 2019
  • Triangular number
    :4△ = 4 + 3 + 2 + 1 = 10 (10 pin bowling uses a triangular arrangement.) :5△ = 5 + 4 + 3 + 2 + 1 = 15 (a common billiards arrangement is 15 balls in a triangle.)
    655 bytes (81 words) - 12:49, 25 March 2019
  • Pocklington's theorem
    ...= 1</math>, then each prime factor ''q'' of ''N'' has the form <math>q^kr+1</math>. ...it can be deduced a primality test when only a partial factorization of N-1 is known:
    2 KB (346 words) - 19:51, 30 August 2019
  • Multiple polynomial quadratic sieve
    :<math>45^2\,\equiv \,2^4*7^0*13^1</math> :<math>123^2\,\equiv \,2^{10}*7^0*13^1</math>
    6 KB (1,068 words) - 14:33, 13 February 2019
  • Proth number
    ...condition that 2<sup>{{Vn}}</sup> > {{Vk}}, all odd integers greater than 1 would be Proth numbers, but most pages lists them, too.
    670 bytes (104 words) - 10:59, 9 July 2021
  • 27121 Search
    ...f the form: 27 &times; 2<sup>n</sup> ± 1 and 121 &times; 2<sup>n</sup> ± 1. ...es are 27 &times; 2<sup>1902689</sup>-1 and 27 &times; 2<sup>2218064</sup>+1, which weighs in at 572768 digits and 667706 digits, found on 2009-12-10 a
    983 bytes (138 words) - 13:25, 8 February 2019
  • 12121 Search
    ...2<sup>n</sup>-1, it also searches for primes of 121 &times; 2<sup>n</sup>+1 after being a partner of [[PrimeGrid]]. ...The Prime Pages]], their largest number is 121 &times; 2<sup>2033941</sup>-1 which weighs in at 612280 digits. This prime was found on 2006-01-28.
    984 bytes (143 words) - 13:30, 8 February 2019
  • Assignments
    ==How is CPU years calculated for P-1, and LL test?== *'''P-1 credit'''
    20 KB (3,473 words) - 18:42, 14 December 2023
  • 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

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

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