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 "4" on this wiki! See also the search results found.

Page title matches

Page text matches

  • Why participate in GIMPS?
    ...d 28 who are equal to the sum of their aliquot divisors: 6 = 1+2+3, 28=1+2+4+7+14). He realized that the even perfect numbers (no odd perfect numbers ar
    7 KB (1,252 words) - 09:47, 7 March 2019
  • Sophie Germain prime
    | 4 || 11 || {{NRi|3|2}} | 17 || 239 || {{NRi|15|4}}
    1 KB (171 words) - 04:26, 3 November 2020
  • Torture test
    ...sing the default "Blend" setting, the first instance each will use about 3/4 of memory the system memory. The second instance will try to do the same. T
    2 KB (323 words) - 10:59, 18 June 2019
  • Introductory stuff
    ...[prime]] number that is one less than a [[power of two]]. For example, 3 = 4 - 1 = 2<sup>2</sup> - 1 is a Mersenne prime; so is 7 = 8 - 1 = 2<sup>3</sup
    14 KB (2,370 words) - 15:15, 17 August 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
  • Square (geometry)
    A '''square''' is a regular polygon with 4 sides of equal length and with 4 equal interior angles (90 degrees), thus having opposing sides parallel. A square is the most constrained of all types of 4 sided figures.
    296 bytes (42 words) - 13:44, 18 September 2022
  • Pocklington's theorem
    ...the [[KonyaginPomerance|Konyagin-Pomerance Test]] can be used. If <math>f^4 > n</math>, there is a polynomial-time algorithm, due to Coppersmith and Ho ...simplest one which will work for the value of ''f'' you have. For <math>f^4 < n</math>, there is no known algorithm which enhances Pocklington's theore
    2 KB (346 words) - 19:51, 30 August 2019
  • Multiple polynomial quadratic sieve
    :<math>45^2\,\equiv \,2^4*7^0*13^1</math>
    6 KB (1,068 words) - 14:33, 13 February 2019
  • How to get started with GIMPS
    ==Step 4==
    4 KB (623 words) - 13:39, 26 March 2019
  • GIMPS networking, PrimeNet and communication
    Packets: Sent = 4, Received = 4, Lost = 0 (0% loss),
    8 KB (1,269 words) - 10:09, 7 March 2019
  • Strong law of small numbers
    ...numbers. [[Double Mersenne number]]s are a good example of this. The first 4 terms yield primes, but factors for next four terms have been found (after
    1 KB (197 words) - 15:02, 11 February 2019
  • P+1 factorization method
    If we define <math>D = u^2 - 4</math>, then for any odd prime <math>p</math>, <math>p</math> divides both
    8 KB (1,536 words) - 11:35, 12 February 2019
  • SNFS polynomial selection
    ...lo ''N'', the number to be factored. Typically one polynomial is of degree 4, 5 or 6 (the algebraic side) and the other one is linear (the rational side 4. For <math>a^{11k}-1</math> and <math>a^{13k}-1</math> you'd get degrees 10
    7 KB (1,238 words) - 16:14, 12 February 2019
  • ECMclient
    4. Run ecmclient.exe and it should get some work and start working on it.
    2 KB (383 words) - 11:16, 26 February 2019
  • GMP-ECM
    ....1.tar.bz2 MPIR] and [https://gforge.inria.fr/frs/download.php/30965/ecm-6.4.3.tar.gz GMP-ECM] (don't unpack them, just place them on your desktop). 4. Time to open MSYS again. Inside MSYS you'll need to do as shown on this sc
    4 KB (567 words) - 10:54, 6 December 2019
  • Gerbicz error checking
    *in [[Prime95]] since version 29.4 ...ot hold, then we roll back to the last stored <math>u</math> value (value (4) above). If we roll back too much (e.g. 100 times to the same term), then w
    3 KB (528 words) - 14:59, 3 October 2023
  • System requirements and compatible hardware
    :Windows NT (3 / 4 / 4 SP 1 / 4 SP 2 / 4 SP 3 / 4 SP 4 / 4 SP 5 / 4 SP 6) :Windows 2000 (SP 1 / SP 2 / SP 3 / SP 4)
    766 bytes (95 words) - 12:25, 19 February 2019
  • PrimeNet summary report
    ...[exponent]]s of the [[Mersenne number]]s by ranges. It is broken down into 4 sets of vertical columns. The exponents below {{Num|10000000}} are treated
    7 KB (1,073 words) - 08:46, 15 May 2024
  • Square number
    ...square integers is also a square number (e.g. 2/3&nbsp;&times;&nbsp;2/3 = 4/9). :2<sup>2</sup> = 4
    3 KB (408 words) - 13:56, 19 February 2019
  • Riesel problem 1
    | 4 || 7 || {{Num|155274}} || {{Num|{{PAGESINCATEGORY:Riesel 2 1Intervals2|page ! scope="row" | [[:Category:Riesel 2 1Intervals4|4]]
    6 KB (689 words) - 18:14, 4 April 2024

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

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