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

Page title matches

Page text matches

  • In [[mathematics]], a '''Fermat number''', named after [[Pierre de Fermat]] who first studied them, is a positive integer of the form :{{V|F}}<sub>{{Vn}}</sub> = {{Kbn|+|1|2|2<sup>n</sup>}}
    12 KB (1,913 words) - 14:35, 9 August 2021
  • ...]] of numbers of the form <math>b^n\pm 1</math> for <math>b</math> = 2, 3, 5, 6, 7, 10, 11, 12. The values of the exponent <math>n</math> are selected s ...it is considered the oldest continuously ongoing activity in computational number theory.
    7 KB (1,150 words) - 23:48, 19 April 2023
  • '''Pépin's test''' is mainly used for proving the primality of [[Fermat number]]s, but it is of no help for finding the factors of such numbers. ...ralized Fermat number]]s <math>F_{n,2} = 4^{3^n}+2^{3^n}+1</math> with k = 5 instead of k = 3.
    2 KB (401 words) - 14:40, 6 March 2019
  • There are different kinds of '''generalized [[Fermat number]]s'''. ...^n}-1)</math> where p is the prime of apparition rank r (r(2)=1, r(3)=2, r(5)=3, ...) and n is greater or equal to 0.
    5 KB (726 words) - 09:57, 12 September 2021
  • ...ipants (on about 16,000 host computers) from 89 countries, reporting about 1,860 [[Computing power#FLOPS|teraflops]].<ref>[https://www.boincstats.com/st ...ase 5|Sierpiński base 5]]: helping to solve the [[Sierpiński-Riesel Base 5]] Problem.
    3 KB (458 words) - 10:28, 26 March 2024
  • *'''[[Composite number]]''' - An [[integer]] that is not [[prime]]. *'''[[Exponent]]''' - In <math>3^5</math>, 5 is the exponent.
    1 KB (190 words) - 08:32, 15 May 2024
  • {{Generalized Fermat number |GFNb=5
    128 bytes (12 words) - 09:57, 30 July 2021
  • {{HistF|2024-05-04|&nbsp;{{T5000|138060|{{Kbn|+|5|308|309755}}}}|Predrag Kurtovic|656421}}
    7 KB (795 words) - 08:03, 5 May 2024
  • ...p></sup> + b<sup>2<sup>n</sup></sup> (if b=1 : a<sup>2<sup>n</sup></sup> + 1) with link to the page. *one parameter: the ''n''-value is given and displays as [[Fermat number]] {{Kbn|+|2<sup>n</sup>}}
    1 KB (183 words) - 10:27, 1 July 2020
  • ...p>{{Vn}}</sup></sup> (if {{Vb}}=1 : {{V|a}}<sup>2<sup>{{Vn}}</sup></sup> + 1) with link to the page. *one parameter: the {{Vn}}-value is given and displays as [[Fermat number]] {{Kbn|+|2<sup>n</sup>}}: F(n)
    1 KB (194 words) - 10:20, 27 October 2020
  • Sequences (per base, {{Vk}}-value or individual number) with own page in this Wiki: | [[:Category:Mersenne prime|Mersenne primes]] || number || style="text-align:right;"|{{Num|{{#expr:{{PAGESINCATEGORY:Mersenne prime
    11 KB (1,385 words) - 08:35, 15 May 2024
  • Collect the [[Generalized Fermat number]]s for which a given [[Proth prime]] is a divisor. 2,1,207#2020-11-11#Hans Riesel,Ray Ballinger,David Broadhurst,(bigger team)
    4 KB (432 words) - 09:55, 16 September 2021
  • Template Generalized Fermat number ...{Vb}}=1 this is a [[Fermat number]] {{V|a}}<sup>2<sup>{{Vn}}</sup></sup> + 1.
    7 KB (861 words) - 08:51, 16 September 2021
  • {{Generalized Fermat number |GFNb=1
    120 bytes (12 words) - 18:11, 1 August 2021
  • {{Generalized Fermat number |GFNb=1
    128 bytes (12 words) - 08:55, 5 July 2021
  • {{Generalized Fermat number |GFNb=1
    140 bytes (12 words) - 00:56, 23 June 2021
  • {{Generalized Fermat number |GFNb=1
    120 bytes (12 words) - 15:52, 17 August 2021
  • {{Generalized Fermat number |GFNb=1
    149 bytes (12 words) - 16:14, 17 August 2021
  • Template: Navbox Generalized Fermat numbers {{Navbox Generalized Fermat numbers}}
    6 KB (499 words) - 08:48, 23 September 2021
  • {{Generalized Fermat number |GFNb=5
    123 bytes (12 words) - 17:43, 23 August 2021

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