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

  • Top GIMPS teams
    | 1 || [[PrimeNet]] || 32679708 *[https://www.mersenne.org/report_top_500_custom/?team_flag=1&type=0&rank_lo=1&rank_hi=50&start_date=1994&end_date= Lifetime team stats] at [[PrimeNet]]
    2 KB (206 words) - 09:56, 7 March 2019
  • Aliquot sequence
    :<math>s_n = \sigma(s_{n-1}) - s_{n-1}</math> :<math>s_0\ =\ 10,\ \sigma(10)=1\ +\ 2\ +\ 5\ +\ 10</math>
    6 KB (914 words) - 19:49, 21 February 2023
  • Abundant number
    The divisors of 12 are <math>(1, 2, 3, 4, 6, 12)</math>, so :<math>\sigma(12)\ =\ 1+2+3+4+6+12\ =\ 28</math>
    674 bytes (92 words) - 00:58, 11 August 2024
  • Prime
    ...''') is an [[integer]] greater than 1 that is only divisible by itself and 1. The first few prime numbers are 2, 3, 5, 7, 11, 13, 17, 19. ...P divides evenly into Q, because each division would leave a remainder of 1. If Q is not prime, it must be evenly divisible by some prime larger than P
    2 KB (447 words) - 00:22, 10 July 2023
  • Twin prime
    ...of the reciprocals of all twin primes converges to Brun's constant (about 1.902160583104). | align="right" | 10<sup>1</sup> || align="right" | 2
    2 KB (255 words) - 06:08, 21 February 2023
  • Riesel Prime Search
    :The project is searching for [[Riesel prime]]s {{Kbn|k|n}}, {{Vk}} > 1. ...ght {{Vk}}-values that produce a very small number of primes (opposite to (1) above)
    3 KB (330 words) - 15:18, 3 July 2024
  • Nomenclature and notation
    ...math> (the exponent) must also be prime. Thus, the notation of <math>2^{p}-1</math> is generally used when discussing the search for a [[Mersenne prime] ...mber that is itself prime '''and''' can be written in the form <math>2^{x}-1</math>. These are what [[GIMPS]] is searching for.
    3 KB (467 words) - 08:48, 15 May 2024
  • Computing power
    ...calculating effort one 90 MHz Pentium computer produces over the course of 1 calendar year (365 days). Because of the early adoption of this unit by [[G ...ay. One P90 year equals 5.075 GHz-days. 1 TFLOPS equals 500 GHz-days, thus 1 P90 year is about 10 GFLOPS.
    2 KB (258 words) - 08:40, 15 May 2024
  • Seventeen or Bust/Primes
    | 4847 || {{PP|75994|4847 &times; 2<sup>{{Num|3321063}}</sup>+1}} || 999744 || 2005-10-15 || Richard Hassler | 5359 || {{PP|67719|5359 &times; 2<sup>{{Num|5054502}}</sup>+1}} || 1521561 || 2003-12-06 || Randy Sundquist
    2 KB (163 words) - 14:20, 7 March 2019
  • Seventeen or Bust/FAQ
    *[[Seventeen or Bust/Factoring|Factoring]]: How can I P-1 factor for SoB? It's too complicated!
    550 bytes (87 words) - 13:39, 1 February 2019
  • Seventeen or Bust/Factoring
    ...actoring for Seventeen or Bust is made by the [[P-1 factorization method|P-1 factoring]] method only. The programs commonly used to P-1 factor these numbers are [[Prime95]] and [http://linux.redbird.com/~alien88
    3 KB (491 words) - 13:39, 1 February 2019
  • Why participate in GIMPS?
    ...are known) are all closely related to the primes of the form 2<sup>p</sup>-1, for some prime ''p'' (now called [[Mersenne prime|Mersennes]]). So the que ...w. Mersennes have one of the simplest possible forms for primes, <math>2^p-1</math>. The proof of their primality has an elegant simplicity (to a mathem
    7 KB (1,252 words) - 09:47, 7 March 2019
  • Sieving
    ...etween 2 and the square root of the maximum member of the sequence, set to 1 those elements of the array that correspond to the multiples of the current ...composites. But this can be fixed easily by do not setting that element to 1 if the member of the sequence is equal to the prime used in the loop.
    3 KB (521 words) - 11:14, 6 February 2019
  • Sieving program
    ...ing sieving of generalized Cullen/Woodall numbers n &times; b<sup>n</sup>+-1) http://sites.google.com/site/geoffreywalterreynolds/programs/gcwsieve ...ieving for factors of numbers of the form K &times; 2<sup>n</sup> + 1 or - 1. Independent of K's, but good for many N's too) and [[TPSieve]] (similar to
    2 KB (220 words) - 11:42, 7 March 2019
  • NewPGen
    *k&times;b<sup>n</sup>+1 *k&times;b<sup>n</sup>-1
    3 KB (529 words) - 09:32, 7 March 2019
  • Sophie Germain prime
    .... For example, 23 is a Sophie Germain prime because it is a prime and 2*23+1 = 47, also prime. | 1 || 2 || -
    1 KB (171 words) - 04:26, 3 November 2020
  • M13
    '''M13''' is the 13th known [[Mersenne prime]] 2<sup>521</sup>-1 found on 1952-01-30 by [[Raphael M. Robinson]].
    419 bytes (48 words) - 14:50, 19 September 2021
  • M14
    '''M14''' is the 14th known [[Mersenne prime]] 2<sup>607</sup>-1 found on 1952-01-30 by [[Raphael M. Robinson]].
    420 bytes (48 words) - 14:49, 19 September 2021
  • M15
    '''M15''' is the 15th known [[Mersenne prime]] 2<sup>{{Num|1279}}</sup>-1 found on 1952-06-25 by [[Raphael M. Robinson]].
    430 bytes (49 words) - 14:49, 19 September 2021
  • M16
    '''M16''' is the 16th known [[Mersenne prime]] 2<sup>{{Num|2203}}</sup>-1 found on 1952-10-07 by [[Raphael M. Robinson]].
    431 bytes (49 words) - 14:49, 19 September 2021

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

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