Irreducible trinomials over GF(2)
The form of these polynomials is P(x)=xd+xn+1
with n < d.
These irreducible polynomials can be displayed in Maple
format to allow easy check.
From degree 2 to 2000, one can count 6031 irreducible trinomials, with the following repartition:
0 irreducible trinomials of degree d = 0 mod 8
1702 irreducible trinomials of degree d = 1 mod 8
554 irreducible trinomials of degree d = 2 mod 8
18 irreducible trinomials of degree d = 3 mod 8
1416 irreducible trinomials of degree d = 4 mod 8
24 irreducible trinomials of degree d = 5 mod 8
633 irreducible trinomials of degree d = 6 mod 8
1684 irreducible trinomials of degree d = 7 mod 8
This table is a result from
Reynald Lercier.
Please select range to display irreducible trinomials over GF(2).
|
