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

  • M44
    ...rime]]. Currently that designation belongs to 2<sup>{{Num|32582657}}</sup>-1.
    997 bytes (129 words) - 11:35, 18 February 2019
  • M45
    '''M45''' normally refers to 2<sup>{{Num|37156667}}</sup>-1, the 45th [[Mersenne prime]] in order of size from the smallest to greatest
    2 KB (251 words) - 11:40, 18 February 2019
  • Odd Magnar Strindmo
    ...46th Mersenne prime]] (chronologically 47th), 2<sup>{{Num|42643801}}</sup>-1. Strindmo goes by the alias '''Stig M. Valstad''' on [[GIMPS]].
    991 bytes (141 words) - 00:33, 15 January 2024
  • M38
    ...he 38th [[Mersenne prime]]. Specifically it is 2<sup>{{Num|6972593}}</sup>-1. This number was discovered to be [[prime]] on 1999-06-01 by [[Nayan Hajrat
    1 KB (165 words) - 11:10, 18 February 2019
  • Nayan Hajratwala
    ...ho discovered the [[M38|38th Mersenne prime]], 2<sup>{{Num|6972593}}</sup>-1.
    809 bytes (109 words) - 23:55, 14 January 2024
  • Coprime
    ...ly primes when their [[greatest common divisor]] is 1 (<math>\gcd{(x,y)} = 1</math>). This does not mean that any of these numbers is prime.
    738 bytes (112 words) - 09:50, 23 January 2019
  • Greatest common divisor
    When the greatest common divisor is 1, both numbers are [[coprime]] or relatively prime. This does not mean that #Go back to step 1.
    2 KB (339 words) - 18:38, 27 September 2023
  • Modular arithmetic
    ...can be done when working modulo N, where N is an [[integer]] greater than 1. ...s is arithmetic modulo 12 and the set of numbers representing the hours 0, 1, 2, 3,..., 11 is known as <b>Z</b>/12<b>Z</b>.
    4 KB (625 words) - 10:25, 23 January 2019
  • Montgomery multiplication
    ...onentiation]], [[Elliptic curve method|ECM]], [[P-1 factorization method|p-1]], etc.) this method is really fast. ...ation to normal, just perform a Montgomery multiplication using the number 1 as the second factor.
    4 KB (582 words) - 17:01, 29 August 2022
  • Elliptic curve method
    :<math>O(\exp{\sqrt{(\log p \,\log \log p)(1+O(1)}})</math> ...omposite number is a number that has divisors that are neither itself, nor 1. A highly composite number is a number that has lots and lots of divisors.
    19 KB (3,181 words) - 22:27, 6 July 2023
  • M35
    Specifically 2<sup>{{Num|1398269}}</sup>-1, written out in full [http://www.mersenneforum.org/txt/35.txt {{Num|420921}
    2 KB (224 words) - 11:00, 18 February 2019
  • Raphael M. Robinson
    ...t|Lucas-Lehmer]] [[primality test]] to determine whether 2<sup>''n''</sup>-1 was prime for all prime ''n'' < 2304 on a [[SWAC (computer)|SWAC]] at [[Uni ....htm In memoriam : Raphael Mitchel Robinson,]" ''Bull. Symbolic Logic'' '''1''': 340-43.
    4 KB (526 words) - 14:51, 19 September 2021
  • M36
    ...he 36th [[Mersenne prime]], specifically it is 2<sup>{{Num|2976221}}</sup>-1. This number was dicovered to be [[prime]] on 1997-08-24 by [[Gordon Spence ...umber]] is 2<sup>{{Num|2976220}}</sup> &bull; (2<sup>{{Num|2976221}}</sup>-1). This number is {{Num|1791864}} digits long.
    2 KB (279 words) - 11:01, 18 February 2019
  • Sierpiński problem
    *{{Kbn|+|78557|4n+1}} is multiple of 5. *{{Kbn|+|78557|3n+1}} is multiple of 7.
    5 KB (650 words) - 10:25, 26 March 2024
  • Paul Seelhoff
    ...50?tify={%22pages%22:%5B306%5D,%22view%22:%22%22} "Generalregister zu Band 1-50 der Zeitschrift für Mathematik und Physik"], p.292) ...fy={%22pages%22:%5B412%5D,%22view%22:%22%22} "Die Zahlen von der Form k.2n+1"], Zeitschrift fur Mathematik und Physik, '''Vol. 31''' (1886) p380
    2 KB (195 words) - 00:13, 15 January 2024
  • Covering set
    *[[Riesel problem 1|Riesel problem]]
    380 bytes (56 words) - 10:27, 26 March 2024
  • Seventeen or Bust
    |result=11 k's eliminated as a standalone project, 1 k eliminated as a subproject on PrimeGrid The aim of the project is to find [[prime]]s of the form <math>k*2^n+1</math>, where ''k'' is one of the remaining 17 (now 5) candidates for [[Sie
    3 KB (544 words) - 16:44, 21 July 2019
  • M2
    | digits= 1
    193 bytes (19 words) - 13:43, 17 February 2019
  • Perfect number
    ...roper positive divisors and 1 + 2 + 3 = 6. The next perfect number is 28 = 1 + 2 + 4 + 7 + 14. The next perfect numbers are 496 and 8128. ...numbers are generated by the formula 2<sup>''n''-1</sup>(2<sup>''n''</sup>-1):
    6 KB (885 words) - 11:33, 7 March 2019
  • M9
    The ninth [[Mersenne prime]], 2<sup>61</sup>-1 or {{Num|2305843009213693951}}. ...mber, ([[Édouard Lucas]] having shown earlier that [[M12]], <math>2^{127}-1</math> is also prime), and it remained so until 1911. Prior to the develope
    2 KB (213 words) - 14:30, 17 February 2019

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

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