// output of ./demo/gf2n/all-primpoly-srs-demo.cc:
// Description:
//% Shift register sequences (SRS) for all primitive binary polynomials of given degree.
//% The sequences are maximum period sequences (m-sequences).

arg 1: 6 == n  [Degree of polynomials 2<=n<BITS_PER_LONG]  default=6
degree = 6
c=1....11 :  .....1....11...1.1..1111.1...111..1..1.11.111.11..11.1.1.111111
c=11..111 :  .....1111..1..1.1.1..11.1....1...1.11.111111.1.111...11..111.11
c=1.11.11 :  .....1.111111..1.1.1...11..1111.111.1.11.1..11.11...1..1....111
c=11.11.1 :  .....111....1..1...11.11..1.11.1.111.1111..11...1.1.1..111111.1
c=111..11 :  .....11.111..11...111.1.111111.11.1...1....1.11..1.1.1..1..1111
c=11....1 :  .....111111.1.1.11..11.111.11.1..1..111...1.1111..1.1...11....1
 # = 6
