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

Page title matches

  • Proth prime 2 1089927
    {{Proth prime
    432 bytes (32 words) - 13:38, 2 January 2023
  • Proth prime 2 12321
    {{Proth prime
    498 bytes (31 words) - 13:34, 2 January 2023
  • Proth prime 2 1943873
    {{Proth prime
    334 bytes (32 words) - 15:12, 27 January 2023
  • Riesel and Proth Prime Database
    ...oth prime]]s and some others subjects like [[Aliquot sequence]]s or [[Home prime]]s. *[https://www.rieselprime.de/default.htm Riesel and Proth Prime Database main page]
    380 bytes (59 words) - 14:14, 24 January 2019
  • Proth prime 2 28831
    {{Proth prime
    581 bytes (64 words) - 19:18, 5 April 2023
  • Proth prime
    ...in the form {{Kbn|+|k|n}} with 2<sup>''n''</sup> > ''k'' are often called Proth primes. *[[Proth's theorem]]
    656 bytes (91 words) - 07:02, 31 August 2020
  • Proth prime 2 1
    {{Proth prime
    212 bytes (30 words) - 15:35, 2 October 2022
  • Proth prime 2 3
    {{Proth prime {{HistF|2020-10-25|16408818|James Scott Brown,PrimeGrid 321 Prime Search|561613}} ([https://www.primegrid.com/download/321-16408818.pdf Offic
    3 KB (336 words) - 16:58, 15 April 2024
  • Proth prime 2 5
    {{Proth prime
    1 KB (144 words) - 11:12, 24 August 2021
  • Proth prime 2 7
    {{Proth prime {{HistF|2012-11-10|5775996|Martyn Elvy,PrimeGrid Proth Prime Search}} ([http://www.primegrid.com/download/PPS-5775996.pdf Official annou
    2 KB (267 words) - 21:47, 5 July 2023
  • Proth prime table
    Automatically generated table from available [[:Category:Proth prime|Proth primes]]. category=Category:Proth 2
    750 bytes (108 words) - 14:39, 12 July 2021
  • Proth prime 2 9
    {{Proth prime {{HistC|?|4000000|PrimeGrid Proth Prime Search}}
    3 KB (432 words) - 18:48, 9 April 2023
  • Proth prime 2 11
    {{Proth prime {{HistF|2013-02-26|2897409|Predrag Kurtovic,PrimeGrid Proth Prime Search}}
    2 KB (240 words) - 08:58, 11 January 2023
  • Proth prime 2 13
    {{Proth prime
    1 KB (175 words) - 07:07, 25 August 2021
  • Proth prime 2 15
    {{Proth prime {{HistF|2010-04-14|2393365|Darren Wallace,PrimeGrid Proth Prime Search}}
    3 KB (390 words) - 10:00, 25 August 2021
  • Proth prime 2 17
    {{Proth prime
    1 KB (141 words) - 13:50, 25 August 2021
  • Proth prime 2 19
    {{Proth prime
    1 KB (145 words) - 09:32, 26 August 2021
  • Proth prime 2 1527888802614951
    {{Proth prime
    371 bytes (31 words) - 08:06, 18 September 2021
  • Proth prime 2 301
    {{Proth prime {{HistF|2012-01-29|1455620|Gus Obermeyer,PrimeGrid Proth Prime Search‎}}
    1 KB (103 words) - 12:07, 7 September 2021
  • Proth prime 2 31
    {{Proth prime
    826 bytes (91 words) - 09:28, 31 August 2021

Page text matches

  • Examples
    ...de=true|title=Example of prime sequence and reservation|content=[[Williams prime MM 5]]}} *[https://www.rieselprime.de/default.htm Riesel and Proth Prime Databse RPPDb]
    11 KB (1,236 words) - 14:41, 3 September 2020
  • Fermat number
    ...ese factorisations can be found at [http://www.prothsearch.com/fermat.html Prime Factors of Fermat Numbers] ...</sup> + 1 &equiv; 0 (mod 2<sup>{{V|a}}</sup> + 1).) In other words, every prime of the form {{Kbn|+|n}} is a Fermat number, and such primes are called '''F
    12 KB (1,913 words) - 14:35, 9 August 2021
  • Proth prime 2 1089927
    {{Proth prime
    432 bytes (32 words) - 13:38, 2 January 2023
  • Proth prime 2 12321
    {{Proth prime
    498 bytes (31 words) - 13:34, 2 January 2023
  • Proth prime 2 1943873
    {{Proth prime
    334 bytes (32 words) - 15:12, 27 January 2023
  • Sierpiński problem
    ...e covered, meaning that no member of the sequence {{Kbn|+|78557|n}} can be prime. The same arguments can be said of the numbers 271129, 271577, 322523, 3277 ...oices of {{Vk}}. However, sometimes {{Vn}} has to grow very large before a prime number appears.
    5 KB (650 words) - 10:25, 26 March 2024
  • Paul Seelhoff
    :28 [[Proth prime]]s for 3 &le; {{Vk}} &le; 97 :Found factor [[Proth prime 2 5|{{Kbn|+|5|2|39}}]] of {{DGF|36}}
    2 KB (195 words) - 00:13, 15 January 2024
  • Riesel number
    ...Sierpiński problem]] article, [[Hans Riesel]] found in 1956 that [[Riesel prime 2 509203|{{Kbn|509203|n}}]] is always composite. *[[Riesel and Proth Prime Database]]
    827 bytes (112 words) - 08:21, 25 March 2024
  • Riesel and Proth Prime Database
    ...oth prime]]s and some others subjects like [[Aliquot sequence]]s or [[Home prime]]s. *[https://www.rieselprime.de/default.htm Riesel and Proth Prime Database main page]
    380 bytes (59 words) - 14:14, 24 January 2019
  • Primality test
    .... When the number is declared composite, the algorithm does not reveal the prime [[factor]]s. That is the job of the [[Factorization|factorization methods]] ...the confidence grows, but we cannot be completely sure that the number is prime until a primality test (which is far slower than a probable primality test
    3 KB (501 words) - 05:20, 3 August 2021
  • Primality testing program
    ...ne number]]s<br/>a &times; b<sup>n</sup>±c (only factoring and [[probable prime|PRP]]-testing) | [https://github.com/danaj/Math-Prime-Util-GMP]
    2 KB (314 words) - 21:23, 29 August 2019
  • Pépin's test
    ...: "The test that we today call Pépin's test is actually [[Proth's theorem|Proth's test]] with a proof provided by Lucas". Pépin's test says: If <math>n>0</math>, <math>F_n = 2^{2^n}+1</math> is a prime if and only if <math>\ 3^{(F_n-1)/2} \ \equiv -1 \ \pmod{F_n}</math>.
    2 KB (401 words) - 14:40, 6 March 2019
  • LLR
    **[[Proth's theorem|Proth algorithm]] for {{Kbn|+|k|n}} numbers. ...ith |{{V|c}}| ≠ 1 or {{V|k}} > {{Vb}}<sup>{{Vn}}</sup> can be [[probable prime|PRP]]-tested.
    2 KB (300 words) - 22:00, 16 December 2023
  • PSearch
    ...g project|distributed computing project]] in search of the largest [[Proth prime]]s. | New prime
    1 KB (182 words) - 08:17, 12 July 2020
  • Generalized Fermat number
    ...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 #If number <math>\sum_{i=0}^{p-1}\ (2^i)^{m} \ </math> is prime, then <math>m=p^n</math>.
    5 KB (726 words) - 09:57, 12 September 2021
  • 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 *Type Proth:
    3 KB (458 words) - 10:28, 26 March 2024
  • Proth prime 2 28831
    {{Proth prime
    581 bytes (64 words) - 19:18, 5 April 2023
  • Sieving program
    ...ng [[twin prime]]s of the same form) http://sites.google.com/site/kenscode/prime-programs *[[FermFact]] (performing sieving of Proth numbers) http://www.fermatsearch.org/FermFact-09b.zip
    2 KB (220 words) - 11:42, 7 March 2019
  • Proth's theorem
    This article is about '''Proth's theorem'''. Proth's theorem (1878) states:
    549 bytes (88 words) - 18:15, 28 September 2023
  • Proth prime
    ...in the form {{Kbn|+|k|n}} with 2<sup>''n''</sup> > ''k'' are often called Proth primes. *[[Proth's theorem]]
    656 bytes (91 words) - 07:02, 31 August 2020

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

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