|
%I #11 Aug 30 2014 18:57:21
%S 1,2,3,5,6,7,10,11,13,17,23,26,27,30,33,35,37,38,45,46,47,58,61,62,63,
%T 70,73,77,81,83,87,90,91,101,102,103,107,110,115,118,121,122,125,126,
%U 131,137,138,142,143,146,147,151,161,165,166,170,173,175,177,178
%N Numbers n such that a type-6 Gaussian normal basis over GF(2^n) exists.
%C A type-t Gaussian normal basis exists for GF(2^n) if p=n*t+1 is prime and gcd(n, (p-1)/ord(2 mod p))==1.
%H Joerg Arndt, <a href="http://www.jjj.de/fxt/#fxtbook">Matters Computational (The Fxtbook)</a>, section 42.9 "Gaussian normal bases", pp.914-920
%Y Cf. A136415.
%K nonn
%O 1,2
%A _Joerg Arndt_, Apr 05 2008
|
