// output of ./demo/gf2n/all-irredpoly-demo.cc:
// Description:
//% Generate all irreducible binary polynomials of given degree (from Lyndon words).
//% Indicate which are primitive (P) and normal (N).

arg 1: 9 == n  [Degree of polynomials n<BITS_PER_LONG]  default=9
arg 2: 0 == st  [Stop after st polynomials where found,  zero==>list all polynomials]  default=0
arg 3: 2 == fm  [Print format:
    0==>binary,
    1==>hexadecimal,
    2==>coefficients,
    3==>polynomials]  default=2
     P    [9,4,0]
     P    [9,6,4,3,0]
  N  P    [9,8,5,4,0]
          [9,7,4,3,0]
  N  P    [9,8,4,1,0]
     P    [9,6,5,4,2,1,0]
     P    [9,5,3,2,0]
     P    [9,8,6,5,0]
     P    [9,7,6,4,3,1,0]
  N  P    [9,8,7,6,5,1,0]
          [9,4,2,1,0]
  N  P    [9,8,6,5,3,1,0]
  N  P    [9,8,7,2,0]
  N  P    [9,8,7,3,2,1,0]
     P    [9,8,7,6,5,3,0]
     P    [9,4,3,1,0]
  N       [9,8,0]
  N  P    [9,8,6,5,4,1,0]
     P    [9,7,6,5,4,2,0]
     P    [9,6,5,3,2,1,0]
     P    [9,7,4,2,0]
     P    [9,6,5,4,3,2,0]
     P    [9,6,4,3,2,1,0]
  N  P    [9,8,7,6,4,2,0]
  N  P    [9,8,7,6,3,1,0]
     P    [9,7,6,3,2,1,0]
     P    [9,8,7,6,3,2,0]
     P    [9,7,5,4,3,2,0]
  N  P    [9,8,6,4,3,1,0]
          [9,6,5,2,0]
  N       [9,8,6,3,0]
  N  P    [9,8,7,6,5,4,3,1,0]
  N  P    [9,8,7,6,2,1,0]
  N  P    [9,8,4,2,0]
     P    [9,7,5,4,2,1,0]
  N  P    [9,8,6,3,2,1,0]
     P    [9,8,6,5,4,3,2,1,0]
     P    [9,7,6,5,4,3,0]
     P    [9,7,6,4,0]
     P    [9,7,5,3,2,1,0]
     P    [9,7,5,1,0]
          [9,6,3,1,0]
     P    [9,7,2,1,0]
     P    [9,7,5,2,0]
          [9,1,0]
  N  P    [9,8,4,3,2,1,0]
  N  P    [9,8,7,5,4,3,0]
     P    [9,6,5,3,0]
     P    [9,8,7,5,4,2,0]
          [9,8,7,5,0]
  N  P    [9,8,7,6,4,3,0]
  N  P    [9,8,5,4,3,1,0]
     P    [9,5,4,1,0]
     P    [9,8,5,1,0]
  N  P    [9,8,6,5,3,2,0]
     P    [9,5,0]

 n = 9:    #irred. =56  #prim. =48  #normal =21 = ( 19 prim. + 2 non-prim.)