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

Page title matches

Page text matches

  • Mersenne composite
    ...posite''' is any number of the form 2<sup>n</sup>-1 which is a [[composite number]]. ...is always a Mersenne composite, because it is multiple of both [[Mersenne number]]s 2<sup>p</sup>-1 and 2<sup>q</sup>-1.
    347 bytes (62 words) - 13:07, 19 February 2019
  • PrimeNet summary report
    ...of the active machines. Since not all machines are contributing 24/7 this number is not close to 100%. [[Computing power|GHz-days]] and TFLOPS are used. ...in during the period. For the 30 day period, this is higher than the total number in the 'Resources Registered' section, because many assginments take much l
    7 KB (1,073 words) - 08:46, 15 May 2024
  • Square number
    ...mbers are included, then the ratio of two square integers is also a square number (e.g. 2/3&nbsp;&times;&nbsp;2/3 = 4/9). The number ''m'' is a square number if and only if one can arrange ''m'' points in a square.
    3 KB (408 words) - 13:56, 19 February 2019
  • Square (algebra)
    In [[algebra]], the square of a number is that number [[multiplication|multiplied]] by itself. It's basically an exponentiation w *[[Square number]]
    341 bytes (47 words) - 14:03, 19 February 2019
  • GIMPS milestones
    | 2001-04-06 || First [[ten million digits]] number sucessfully double-checked. | 2000-09-25 || First [[ten million digits]] number tested for primality.
    5 KB (691 words) - 08:59, 20 February 2019
  • Sierpiński number base 5
    ...5''' is a value of {{Vk}} such that {{Kbn|+|k|5|n}} is always [[composite number|composite]]. In order to demonstrate whether {{Num|159986}} is the smallest Sierpiński number base 5 or not, a [[distributed computing project]] was created named [[Sier
    556 bytes (83 words) - 10:57, 14 October 2020
  • Riesel number base 5
    ...5''' is a value of ''k'' such that {{Kbn|-|k|5|n}} is always a [[composite number]]. In order to demonstrate whether {{Num|346802}} is the smallest Riesel number base 5 or not, a [[distributed computing project]] was created named [[Sier
    589 bytes (90 words) - 10:30, 26 March 2024
  • Riesel problem 1
    The '''Riesel problem''' involves determining the smallest [[Riesel number]]. ...that {{Kbn|k|2|n}} is not prime for any integer {{Vn}}. He showed that the number {{Vk}} = ''{{Num|509203}}'' has this property.
    6 KB (689 words) - 18:14, 4 April 2024
  • Peano postulates
    ...Peano]] in 1889; it characterises the set (class, condition) of [[natural number]]s 1, 2, 3, etc., and consists of the following '''Peano postulates''' (als #''1'' is a natural number
    2 KB (269 words) - 17:04, 24 October 2020
  • Frequently suggested improvements
    ...reduction. Since we square at each step of the [[Lucas-Lehmer test]], the number of digits approximately doubles each time. So after only 50 iterations, the ...ch! For the most part we are interested in completing the largest possible number of tests with the available [[CPU]] time, and running one test per [[Proces
    2 KB (392 words) - 14:37, 20 February 2019
  • LL test distribution
    ...7583 GHz-days of [[PrimeNet]] credit upon completion. The largest Mersenne number successfully double checked was 2<sup>{{Num|666666667}}</sup>-1, with {{Num
    2 KB (415 words) - 21:32, 12 February 2020
  • ElevenSmooth
    ...[[distributed computing project]] searching for factors of the [[Mersenne number]] M(3326400) = 2<sup>{{Num|3326400}}</sup>-1.
    366 bytes (42 words) - 12:49, 21 February 2019
  • Mersenne.ca
    ...cached for quick access to the "worst" ranges of exponents, where large a number of exponents have been poorly factored. Most options are user-configurable Several graphs are generated nightly, including a graph representing the number of factored vs unfactored exponents and the bit size of the known factors,
    9 KB (1,396 words) - 15:42, 25 February 2019
  • Value k
    When discussing [[Mersenne number]]s, '''all''' [[factor]]s can be expressed in the following form:
    702 bytes (99 words) - 10:43, 25 October 2020
  • Aurifeuillian factor
    When the number is of a particular form (the exact expression varies with the base), Aurife (Number = ''F'' * (''C'' - ''D'') * (''C'' + ''D'') = ''F'' * ''L'' * ''M'')
    10 KB (1,257 words) - 08:04, 24 June 2019
  • Cullen number
    A '''Cullen number''' {{V|C<sub>n</sub>}} is a number of the form {{Kbn|+|n|2|n}}, a '''generalized Cullen number''' base {{Vb}} is a number of the form {{Kbn|+|n|b|n}}. '''(perhaps own page?)'''
    2 KB (252 words) - 17:39, 31 August 2021
  • Factoring program
    *[[Msieve]] (performing Quadratic Sieve and Number Field Sieve) http://www.boo.net/~jasonp/qs.html *[[GGNFS]] (performing Number Field Sieve) http://sourceforge.net/projects/ggnfs
    2 KB (273 words) - 21:53, 8 July 2023
  • Mtsieve
    *mfsieve: search for factors of [[Multifactorial number]]s ...bn|+|k|n}}, remaining terms are potential divisors of [[Generalized Fermat number]]s
    2 KB (338 words) - 06:58, 28 March 2023
  • Number
    [[Category:Number| ]]
    49 bytes (7 words) - 13:26, 6 March 2019
  • Template:Kbn
    ...{Key|±}}, the '+'/'±'-value is displayed, otherwise the '-'-value of the number.
    3 KB (327 words) - 07:27, 28 September 2020

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

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