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 |
Difference between revisions of "Proth prime 2 1"
(all GF Divs) |
(Thomas Ritschel's calculator gives a weight of 39 for Proth k=1.) |
||
(5 intermediate revisions by one other user not shown) | |||
Line 1: | Line 1: | ||
{{Proth prime | {{Proth prime | ||
|Pk=1 | |Pk=1 | ||
+ | |Pb=2 | ||
|PCount=5 | |PCount=5 | ||
− | |PNash= | + | |PNash=39 |
|PMaxn=8589934591 | |PMaxn=8589934591 | ||
|PDate=2010-10-01 | |PDate=2010-10-01 | ||
Line 8: | Line 9: | ||
|PNlist= | |PNlist= | ||
1 | 1 | ||
− | 2;T: | + | 2;T:GT |
4;T:G | 4;T:G | ||
8;T:G | 8;T:G | ||
16;T:G | 16;T:G | ||
− | |PRemarks=These n-values form the [[Fermat | + | |PRemarks=These n-values form the [[Fermat number|Fermat primes]]. |
}} | }} |
Latest revision as of 15:35, 2 October 2022
Reserved! This sequence is currently reserved by: FermatSearch |
Current data
|
|
Remarks : |
These n-values form the Fermat primes. |
Notes
- ↑ Is GF Divisor of xGF(1,4,3) [+15], Twin n=2
- ↑ Is GF Divisor of GF(3,3) [+34]
- ↑ Is GF Divisor of GF(7,3) [+39]
- ↑ Is GF Divisor of GF(15,3) [+39]