3 Feb
2003
3 Feb
'03
6:10 p.m.
The low bit of x^n over GF(2^3) mod x^3+x+1 equals the parity of (n+8), 0<=n<7. Is it reasonable to expect that there will always be a pair (a,b) such that the low bit of the powers n of a generator of GF(2^k) match the parity of an+b for 0 <= n < 2^k-1? -- Mike Stay staym@clear.net.nz