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 10:45, 19 April 2019 by Karbon (talk | contribs) (new)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
Reserved! This sequence is currently reserved by: FermatSearch

Current data

k , b : 1 , {{{Pb}}}
Count :
Attention! Parameter PCount=5 not given!
Nash : 78
Max n : 8,590,000,000
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. Divides: GF(1,12)
  2. Divides: GF(3,3), GF(3,5), GF(3,6), GF(3,10), GF(3,12)
  3. Divides: GF(7,3), GF(7,5), GF(7,6), GF(7,10), GF(7,12)
  4. Divides: GF(15,3), GF(15,5), GF(15,6), GF(15,10), GF(15,12)