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

Proth primes of the form 2n+1

From Prime-Wiki
Revision as of 14:53, 11 July 2021 by Karbon (talk | contribs) (Karbon moved page Proth prime 1 to Proth prime 2 1 without leaving a redirect: renamed)
Jump to: navigation, search
Reserved! This sequence is currently reserved by: FermatSearch

Current data

k , b : 1 , {{{Pb}}}
Count : 5
Nash : 78
Max n : 8,589,934,591
Date : 2010-10-01
Reserved : FermatSearchFermatSearch/Reserved
1, 2[1], 4[2], 8[3], 16[4]
Remarks :
These n-values form the Fermat primes.

[[Category:Proth {{{Pb}}}|#.....00001]][[Category:Proth {{{Pb}}} Low-weight|#.....00001]]

Notes

  1. Is GF Divisor of xGF(1,4,3) [+15]
  2. Is GF Divisor of GF(3,3) [+34]
  3. Is GF Divisor of GF(7,3) [+39]
  4. Is GF Divisor of GF(15,3) [+39]