| 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"
m |
(add Cullen primes) |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Line 3: | Line 3: | ||
|Pb=2 | |Pb=2 | ||
|PCount=5 | |PCount=5 | ||
| − | |PNash= | + | |PNash=39 |
|PMaxn=8589934591 | |PMaxn=8589934591 | ||
|PDate=2010-10-01 | |PDate=2010-10-01 | ||
|PReserved=FermatSearch | |PReserved=FermatSearch | ||
|PNlist= | |PNlist= | ||
| − | 1 | + | 1;C:{{NCu|2|1}} |
| − | 2;T: | + | 2;T:GT;C:{{NCu|4|1}}, {{NCu|-|2}}, {{NCu|+|1}} |
| − | 4;T:G | + | 4;T:G;C:{{NCu|16|1}}, {{NCu|-|3}} |
| − | 8;T:G | + | 8;T:G;C:{{NCu|256|1}} |
| − | 16;T:G | + | 16;T:G;C:{{NCu|65536|1}} |
| − | |PRemarks=These | + | |PRemarks=These {{Vn}}-values form the [[Fermat number|Fermat primes]]. |
}} | }} | ||
Latest revision as of 21:20, 16 October 2024
| Reserved! This sequence is currently reserved by: FermatSearch |
Current data
|
|
Remarks : |
These n-values form the Fermat primes. |
Notes
- ↑ Cullen 21+1
- ↑ Is GF Divisor of xGF(1,4,3) [+15], Twin n=2, Cullen 41+1, Near Cullen 1•22+1, Near Cullen 2•21+1
- ↑ Is GF Divisor of GF(3,3) [+34], Cullen 161+1, Near Cullen 2•23+1
- ↑ Is GF Divisor of GF(7,3) [+39], Cullen 2561+1
- ↑ Is GF Divisor of GF(15,3) [+39], Cullen 655361+1
