Pages that link to "Item:Q4806397"

The following pages link to A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 (Q4806397):

Displaying 5 items.

• On Mersenne polynomials over \(\mathbb{F}_2\) (Q2326698) (← links)
• Ten new primitive binary trinomials (Q3055140) (← links)
• A primitive trinomial of degree 6972593 (Q4654034) (← links)
• Computing special powers in finite fields (Q4813594) (← links)
• (Q5126289) (← links)