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

Page title matches

  • Proth prime 2 1
    {{Proth prime |Pk=1
    212 bytes (30 words) - 15:35, 2 October 2022

Page text matches

  • Fermat number
    :{{V|F}}<sub>{{Vn}}</sub> = {{Kbn|+|1|2|2<sup>n</sup>}} :{{V|F}}<sub>0</sub> = {{Kbn|+|1}} = 3
    12 KB (1,913 words) - 14:35, 9 August 2021
  • 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
  • Riesel number
    ...Sierpiński problem]] article, [[Hans Riesel]] found in 1956 that [[Riesel prime 2 509203|{{Kbn|509203|n}}]] is always composite. ...ether 509203 is the smallest Riesel number or not (the '''[[Riesel problem 1]]'''), a [[distributed computing project]] was created named [[Riesel Sieve
    827 bytes (112 words) - 08:21, 25 March 2024
  • 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
  • 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". ...s, like the [[Generalized 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
  • LLR
    **[[Proth's theorem|Proth algorithm]] for {{Kbn|+|k|n}} numbers. **{{V|N}}-1 [[Pocklington algorithm]] for {{Kbn|+|k|b|n}} numbers.
    2 KB (300 words) - 22:00, 16 December 2023
  • Generalized Fermat number
    ...+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 equal to 0. :<math>F_{n,1}</math> generates the [[Fermat number]]s.
    5 KB (726 words) - 09:57, 12 September 2021
  • PrimeGrid
    ...ipants (on about 16,000 host computers) from 89 countries, reporting about 1,860 [[Computing power#FLOPS|teraflops]].<ref>[https://www.boincstats.com/st *Type Proth:
    3 KB (458 words) - 10:28, 26 March 2024
  • Sieving program
    ...ing sieving of generalized Cullen/Woodall numbers n &times; b<sup>n</sup>+-1) http://sites.google.com/site/geoffreywalterreynolds/programs/gcwsieve ...ng [[twin prime]]s of the same form) http://sites.google.com/site/kenscode/prime-programs
    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. Different from this definition all values ''n'' ≥ 1 are listed in {{SITENAME}}.
    656 bytes (91 words) - 07:02, 31 August 2020
  • Riesel prime
    Although there's no official definition of a '''Riesel prime''' mostly all primes of the form {{Kbn|k|n}} with 2<sup>{{Vn}}</sup> > {{Vk Different from this definition all values {{Vn}} ≥ 1 are listed in {{SITENAME}}.
    2 KB (279 words) - 03:48, 24 April 2024
  • Proth number
    In [[number theory]], a '''Proth number''' is a number of the form ...that 2<sup>{{Vn}}</sup> > {{Vk}}, all odd integers greater than 1 would be Proth numbers, but most pages lists them, too.
    670 bytes (104 words) - 10:59, 9 July 2021
  • Gerbicz error checking
    ...e validity of [[Proth prime|Proth]] tests and PRP tests on base-2 [[Riesel prime]] candidates, and by those programs and [[PRST]] in an extended version for ...the original formulation of the Gerbicz error check for [[Proth's theorem|Proth tests]], as described in [https://www.mersenneforum.org/showthread.php?t=22
    3 KB (528 words) - 14:59, 3 October 2023
  • Williams prime MP 2
    {{Williams prime |WiMaxn={{GP|Proth prime 2 1|PMaxn}}
    243 bytes (35 words) - 08:06, 1 August 2021
  • Williams prime PP 2
    {{Williams prime |WiMaxn={{GP|Proth prime 2 3|PMaxn}}
    259 bytes (36 words) - 10:52, 13 July 2021
  • Proth prime 2 1
    {{Proth prime |Pk=1
    212 bytes (30 words) - 15:35, 2 October 2022
  • Proth prime 2 3
    {{Proth prime 1;T:GT
    3 KB (336 words) - 16:58, 15 April 2024
  • Proth prime 2 5
    {{Proth prime 1
    1 KB (144 words) - 11:12, 24 August 2021
  • Proth prime 2 9
    {{Proth prime 1;T:T
    3 KB (456 words) - 04:11, 15 May 2024
  • Proth prime 2 11
    {{Proth prime 1
    2 KB (248 words) - 08:42, 15 May 2024
  • Proth prime 2 15
    {{Proth prime 1;T:T
    3 KB (412 words) - 08:00, 15 May 2024
  • Williams prime MP 5
    {{Williams prime |WiMaxn={{Reuse Primelist|Proth prime 5 4|PMaxn|1}}
    260 bytes (36 words) - 08:29, 11 February 2023
  • Williams prime MP 6
    {{Williams prime |WiMaxn={{Reuse Primelist|Proth prime 6 5|PMaxn|1}}
    260 bytes (36 words) - 16:08, 10 February 2023
  • Williams prime PP 3
    {{Williams prime |WiMaxn={{GP|Proth prime 3 4|PMaxn}}
    293 bytes (41 words) - 11:57, 13 July 2021
  • Proth prime 2 33
    {{Proth prime 1
    2 KB (210 words) - 02:44, 15 May 2024
  • Proth prime small bases least n
    {{DISPLAYTITLE:Proth primes of the form {{Kbn|+|k|b|n}}, least ''n''-values}} Here are shown the least ''n'' ≥ 1 generating a [[Proth prime]] of the form {{Kbn|+|k|b|n}} for 2 ≤ ''b'' ≤ 1030 and 2 ≤ ''k'' ≤
    7 KB (795 words) - 08:03, 5 May 2024
  • Proth prime 2 63
    {{Proth prime |PMultiRes=1
    3 KB (299 words) - 01:29, 15 May 2024
  • Proth.exe
    |title=Proth |latest=7.1<br>2004-05
    667 bytes (101 words) - 16:44, 31 August 2021
  • Proth prime 2 127
    {{Proth prime |PMultiRes=1
    1 KB (111 words) - 00:53, 15 May 2024
  • Proth prime 2 255
    {{Proth prime |PMultiRes=1
    3 KB (263 words) - 10:10, 14 May 2024
  • Proth prime 2 129
    {{Proth prime |PMultiRes=1
    2 KB (194 words) - 00:52, 15 May 2024
  • Proth prime 2 32268186233370440249391495
    {{Proth prime 1
    1 KB (19 words) - 16:09, 11 July 2021
  • Proth prime 3 26
    {{Proth prime 1
    1 KB (124 words) - 08:43, 12 July 2021
  • Proth prime 2 19683
    {{Proth prime 1
    681 bytes (56 words) - 15:43, 11 July 2021
  • Proth prime 2 10223
    {{Proth prime |PCount=1
    561 bytes (72 words) - 17:14, 13 August 2021
  • PrimeGrid Sierpiński base 5
    |debug=1 |include={Proth prime}:Pk,{Proth prime}:Pk
    2 KB (245 words) - 11:43, 5 September 2021
  • Liskovets-Gallot conjectures
    ...ding primes of the required parity for all smaller {{Vk}}-values. The even Proth conjecture was proven in 2015, and CRUS is continuing the [[CRUS Liskovets- got an irregular contribution of odd and even exponents yielding a prime.
    2 KB (367 words) - 12:42, 9 May 2024
  • Proth prime 7 48
    {{Proth prime 1
    403 bytes (36 words) - 09:59, 12 July 2021
  • Proth prime 7 4
    {{Proth prime 1
    459 bytes (40 words) - 09:57, 12 July 2021
  • Proth prime 5 2
    {{Proth prime 1
    582 bytes (53 words) - 10:16, 12 July 2021
  • Proth prime 3 10
    {{Proth prime 1;T:T
    657 bytes (66 words) - 08:33, 12 July 2021
  • PrimeGrid Seventeen or Bust
    To solve the [[Sierpiński problem]] by finding a prime of the form {{Kbn|+|k|n}} for each remaining value of {{Vk}} < 78,557. |debug=1
    1 KB (135 words) - 11:42, 5 September 2021
  • Proth prime 5 118568
    {{Proth prime |PCount=1
    314 bytes (35 words) - 08:43, 10 April 2023
  • Proth prime 5 138514
    {{Proth prime |PCount=1
    310 bytes (35 words) - 08:44, 10 April 2023
  • Proth prime 2 168451
    {{Proth prime |PCount=1
    225 bytes (24 words) - 15:53, 11 July 2021
  • PrimeGrid Cullen Prime Search
    The goal of this project is to find [[Cullen prime 2|Cullen prime]]s of the form {{Kbn|+|n|2|n}}. *2009-07-25: [[Proth prime 6679881|{{Kbn|+|6679881|2|6679881}}]] ([http://primes.utm.edu/primes/page.p
    753 bytes (97 words) - 08:45, 12 September 2021
  • Proth 2 3k-value
    {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with {{Vk}} mod 3 = 0}} Proth numbers {{Kbn|+|k|n}} where {{Vk}}-value is a multiple of 3.
    1 KB (156 words) - 09:18, 23 July 2021
  • Proth prime 2 23971
    {{Proth prime |PCount=1
    1 KB (129 words) - 18:02, 6 April 2023
  • Proth prime 2 45323
    {{Proth prime |PCount=1
    225 bytes (24 words) - 14:34, 7 April 2023
  • Proth prime 2 50777
    {{Proth prime |PCount=1
    871 bytes (98 words) - 12:55, 8 April 2023
  • Proth prime 2 50873
    {{Proth prime |PCount=1
    225 bytes (24 words) - 14:35, 7 April 2023
  • Proth prime 2 76877
    {{Proth prime |PCount=1
    859 bytes (98 words) - 13:02, 8 April 2023
  • Proth prime 3 80
    {{Proth prime 1
    558 bytes (46 words) - 09:40, 12 July 2021
  • Proth prime 3 34
    {{Proth prime 1
    642 bytes (53 words) - 09:32, 12 July 2021
  • Proth prime 3 2
    {{Proth prime 1;C:Divides Phi(3^1,2)
    2 KB (204 words) - 11:06, 18 April 2023
  • Proth prime 11 120
    {{Proth prime 1
    313 bytes (27 words) - 09:51, 12 July 2021
  • Proth prime 6 35
    {{Proth prime 1
    391 bytes (32 words) - 10:04, 12 July 2021
  • Proth prime 3 32
    {{Proth prime 1
    339 bytes (28 words) - 09:31, 12 July 2021
  • Proth prime 3 14
    {{Proth prime 1
    475 bytes (36 words) - 08:35, 12 July 2021
  • Proth prime 3 20
    {{Proth prime 1
    370 bytes (26 words) - 08:40, 12 July 2021
  • Proth prime 3 22
    {{Proth prime 1
    364 bytes (21 words) - 08:41, 12 July 2021
  • Proth prime 3 4
    {{Proth prime 1
    1 KB (120 words) - 21:11, 1 August 2021
  • Proth prime 3 6
    {{Proth prime 1
    473 bytes (37 words) - 18:11, 2 August 2021
  • Proth prime 5 81556
    {{Proth prime |PCount=1
    320 bytes (36 words) - 08:44, 10 April 2023
  • Proth prime 2 35
    {{Proth prime 1
    2 KB (236 words) - 02:10, 15 May 2024
  • Proth prime 2 121
    {{Proth prime |PMultiRes=1
    1 KB (120 words) - 01:43, 15 May 2024
  • Proth 2 15k-value
    {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with {{Vk}} mod 15 = 0}} Proth numbers {{Kbn|+|k|n}} where {{Vk}}-value is a multiple of 15.
    1 KB (156 words) - 09:22, 23 July 2021
  • Proth 2 2145k-value
    {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with {{Vk}} mod 2145 = 0}} Proth numbers {{Kbn|+|k|n}} where {{Vk}}-value is a multiple of 2145.
    1 KB (156 words) - 09:36, 23 July 2021
  • Proth 2 2805k-value
    {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with {{Vk}} mod 2805 = 0}} Proth numbers {{Kbn|+|k|n}} where {{Vk}}-value is a multiple of 2805.
    1 KB (158 words) - 09:16, 22 March 2024
  • Proth 2 1-300
    {{DISPLAYTITLE:Proth primes of the form {{Kbn|+|k|n}}, {{Vk}} < 300}} Automatically generated table from available [[:Category:Proth 2 1-300|Proth primes {{Vk}} < 300]].
    850 bytes (117 words) - 17:18, 25 July 2021
  • Proth prime 2 21
    {{Proth prime 1;T:T
    2 KB (275 words) - 04:14, 15 May 2024
  • Proth 2 Count-0
    {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with no prime value so far}} Proth numbers {{Kbn|+|k|n}} where no prime values are known.
    867 bytes (117 words) - 07:46, 26 July 2021
  • Proth 2 Count-100
    {{DISPLAYTITLE:Proth numbers of the form {{Kbn|+|k|n}} with 100 and more primes}} Proth numbers {{Kbn|+|k|n}} with 100 or more prime values {{Vn}}.
    916 bytes (122 words) - 07:51, 26 July 2021
  • Proth 2 Missing-range
    {{DISPLAYTITLE:Proth primes of the form {{Kbn|+|k|n}} with missing ranges}} Proth {{Vk}}-values with missing ranges below the largest known prime for that {{Vk}}.
    778 bytes (107 words) - 07:57, 26 July 2021
  • Proth prime 2 23
    {{Proth prime 1
    940 bytes (120 words) - 04:12, 15 May 2024
  • Proth prime 2 29
    {{Proth prime 1
    2 KB (277 words) - 03:09, 15 May 2024
  • Proth prime 2 14476720225405
    {{Proth prime 1
    311 bytes (23 words) - 14:06, 9 April 2023
  • PrimeGrid Proth Prime Search
    ...ional info in the [http://www.primegrid.com/forum_thread.php?id=2665 Proth Prime Search thread]. *[[Multi Reservation:1|here]]
    1 KB (139 words) - 23:57, 13 May 2024
  • Proth new
    Fill in the <base> and <k> to create a new page for a Proth prime and press "Create".<br> For example <b>"Proth prime 2 99"</b> will create a page for <b>{{Kbn|+|99|2|n}}</b>.<br>
    532 bytes (83 words) - 14:51, 15 August 2021
  • Proth prime 2 6395
    {{Proth prime 1
    769 bytes (66 words) - 14:33, 9 May 2024
  • Proth prime 2 915
    {{Proth prime 1
    2 KB (178 words) - 09:31, 14 May 2024
  • Proth prime 2 699
    {{Proth prime 1
    2 KB (183 words) - 09:21, 14 May 2024
  • Proth prime 2 615
    {{Proth prime 1;T:T
    2 KB (222 words) - 09:16, 14 May 2024
  • Proth prime 2 1065
    {{Proth prime 1;T:T
    3 KB (274 words) - 09:38, 14 May 2024
  • Proth prime 2 261
    {{Proth prime |PMultiRes=1
    3 KB (321 words) - 10:00, 14 May 2024
  • Proth prime 2 345
    {{Proth prime 1
    4 KB (381 words) - 09:07, 14 May 2024
  • Proth prime 2 639
    {{Proth prime 1;T:T
    3 KB (241 words) - 09:18, 14 May 2024
  • Proth prime 2 791
    {{Proth prime 1
    1 KB (114 words) - 09:28, 14 May 2024
  • Proth prime 2 453
    {{Proth prime 1
    2 KB (194 words) - 09:12, 14 May 2024
  • Proth prime 2 37
    {{Proth prime 2;C:Is {{DGF|1|10|7}}
    2 KB (259 words) - 02:40, 15 May 2024
  • Proth prime 2 39
    {{Proth prime 1
    4 KB (518 words) - 02:03, 15 May 2024
  • Proth prime 2 629
    {{Proth prime 1
    2 KB (211 words) - 09:17, 14 May 2024
  • Proth prime 2 177
    {{Proth prime |PMultiRes=1
    2 KB (262 words) - 00:46, 15 May 2024
  • Proth prime 2 765
    {{Proth prime 1
    3 KB (262 words) - 09:26, 14 May 2024
  • Proth prime 2 789
    {{Proth prime 1
    2 KB (162 words) - 09:27, 14 May 2024
  • Proth prime 2 41
    {{Proth prime 1
    1,017 bytes (121 words) - 02:00, 15 May 2024
  • Proth prime 2 45
    {{Proth prime 2;T:T;C:Is {{DGF|1|10|9}}
    3 KB (389 words) - 01:56, 15 May 2024
  • Proth prime 2 1601
    {{Proth prime 1
    613 bytes (52 words) - 10:24, 14 May 2024
  • Proth prime 2 933
    {{Proth prime 1
    3 KB (251 words) - 09:35, 14 May 2024
  • Proth prime 2 259
    {{Proth prime |PMultiRes=1
    602 bytes (66 words) - 10:04, 14 May 2024
  • Proth prime 2 207
    {{Proth prime |PMultiRes=1
    2 KB (222 words) - 00:39, 15 May 2024
  • Proth prime 2 202705
    {{Proth prime |PCount=1
    386 bytes (41 words) - 08:42, 13 January 2022
  • Proth prime 6 5
    {{Proth prime 1
    1 KB (126 words) - 18:51, 27 October 2023
  • Williams prime MP 999
    {{Williams prime |WiMaxn={{Reuse Primelist|Proth prime 999 998|PMaxn|1}}
    278 bytes (36 words) - 21:54, 26 April 2023
  • Proth prime 2 165
    {{Proth prime |PMultiRes=1
    4 KB (446 words) - 00:50, 15 May 2024
  • Proth prime 2 2379
    {{Proth prime 1
    319 bytes (16 words) - 14:47, 15 May 2024
  • Proth prime 2 93
    {{Proth prime |PMultiRes=1
    824 bytes (47 words) - 15:04, 13 May 2024
Retrieved from "https://www.rieselprime.de/ziki/Special:Search"