Search results

Create the page "Fermat prime" on this wiki! See also the search results found.

• Miller-Rabin pseudoprimality test
  The '''Miller-Rabin pseudoprimality test''' is based in two facts for prime numbers: *The Fermat Little Theorem that states: <math>a^{p-1}\equiv 1\,\pmod p</math>.
  3 KB (432 words) - 15:33, 28 January 2019
• GeneferCUDA
  ...DAGenefer''') is a program for finding large probable [[generalized Fermat prime]]s.
  362 bytes (48 words) - 09:20, 29 January 2019
• Generalized Fermat prime
  ...'generalized Fermat prime''' is a [[generalized Fermat number]] which is [[prime]]. *[[Wikipedia:Fermat_number#Generalized_Fermat_primes|Generalized Fermat prime]]
  372 bytes (49 words) - 13:35, 6 March 2019
• Generalized Fermat number
  There are different kinds of '''generalized [[Fermat number]]s'''. ...2^{2p^n}+2^{p^n}+1 \ = \ (2^{p^{n+1}}-1)/(2^{p^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 equa
  5 KB (774 words) - 07:39, 27 May 2024
• PrimeGrid
  '''PrimeGrid''' is a [[distributed computing]] project for searching for [[prime]] numbers of world-record size. It makes use of the [[BOINC|Berkeley Open I :[[PrimeGrid 321 Prime Search|321 Prime Search]] searching for mega primes of the form {{Kbn|±|3|2|n}}.
  3 KB (458 words) - 10:28, 26 March 2024
• Worktype
  ...omplished, in order to achieve the main goals of GIMPS (finding [[Mersenne prime]]s, ensuring that no Mersenne primes have been missed, and lastly finding [ ...The primality test. This is the only work type that can prove a number is prime.
  4 KB (603 words) - 02:31, 18 August 2019
• Why participate in GIMPS?
  ...s of the form 2^p-1, for some prime ''p'' (now called [[Mersenne prime|Mersennes]]). So the quest for these jewels began near 300 BC. ...studied (in chronological order) by Cataldi, Descartes, [[Pierre de Fermat|Fermat]], [[Marin Mersenne|Mersenne]], Frenicle, Leibniz, [[Leonhard Euler|Euler]]
  7 KB (1,252 words) - 09:47, 7 March 2019
• Sieving program
  ...ng [[twin prime]]s of the same form) http://sites.google.com/site/kenscode/prime-programs *[[AthGFNSieve]] (performing sieving of generalized Fermat numbers b^2ⁿ+1) http://www.underbakke.com/AthGFNsv/
  2 KB (220 words) - 11:42, 7 March 2019
• Introductory stuff
  It is feasible, but unlikely. A [[positive claim]], that of a new [[Mersenne prime]], is subject to [[Double check|double]] and [[triple check]]s by others, i ==What is a Mersenne prime?==
  14 KB (2,370 words) - 15:15, 17 August 2019
• Help:Glossary
  *'''[[Composite number]]''' - An [[integer]] that is not [[prime]]. *'''[[Fermat number]]''' - Numbers of the form <math>2^{2^n} + 1</math>.
  1 KB (190 words) - 08:32, 15 May 2024
• Proth number
  A [[Proth prime]] is a Proth number, which is prime. [[Cullen number]]s ({{Kbn|+|n|2|n}}) and [[Fermat number]]s ({{Kbn|+|2ⁿ}}) are special forms of Proth numbers.
  670 bytes (104 words) - 10:59, 9 July 2021
• Template:Navbox NumberClasses
  *[[Prime]] *[[Probable prime]]
  1 KB (170 words) - 16:41, 5 April 2024
• Help:Editing
  *The Prime Database: <code><nowiki>[https://primes.utm.edu/primes/status.php Status]</ ...re de Fermat|Fermat]]</nowiki></code> creates [[Wikipedia:Pierre de Fermat|Fermat]]
  5 KB (805 words) - 08:26, 15 May 2024
• Mtsieve
  *cksieve: search for factors of [[Carol-Kynea prime]]s ...of {{Kbn|+|k|n}}, remaining terms are potential divisors of [[Generalized Fermat number]]s
  2 KB (338 words) - 06:58, 28 March 2023
• Template:Proth prime
  Template Proth prime {{Proth prime
  9 KB (1,060 words) - 17:03, 25 July 2021
• Proth prime 2 1
  {{Proth prime |PRemarks=These n-values form the [[Fermat number|Fermat primes]].
  212 bytes (30 words) - 15:35, 2 October 2022
• Proth prime 2 5
  {{Proth prime {{HistC|2021-04-01|9000000|PrimeGrid Fermat Divisor Search}}
  1 KB (148 words) - 13:21, 26 May 2024
• Proth prime 2 7
  {{Proth prime {{HistC|2021-04-01|6000000-9000000|PrimeGrid Fermat Divisor Search|P#8778#149792}}
  2 KB (272 words) - 07:24, 27 May 2024
• Proth prime 2 9
  {{Proth prime For all even {{Vn}}-values {{Kbn|+|9|2|n}} is a [[Generalized Fermat number]].<br>
  3 KB (456 words) - 04:11, 15 May 2024
• Proth prime 2 11
  {{Proth prime {{HistC|2021-04-01|9000000|PrimeGrid Fermat Divisor Search}}
  2 KB (252 words) - 13:26, 26 May 2024

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