A primitive trinomial of degree 6972593

DOI10.1090/S0025-5718-04-01673-4zbMath1077.11002OpenAlexW2018043194WikidataQ55739357 ScholiaQ55739357MaRDI QIDQ4654034

Samuli Larvala, Paul Zimmermann, Richard P. Brent

Publication date: 1 March 2005

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-04-01673-4

zbMATH Keywords

Mersenne numberscharacteristic 2primitive trinomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Special sequences and polynomials (11B83) Software, source code, etc. for problems pertaining to number theory (11-04)

Related Items

Ten new primitive binary trinomials

Uses Software

• NTL

Cites Work

• Unnamed Item
• Algorithms for Finding Almost Irreducible and Almost Primitive Trinomials
• A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377
• New primitive $t$-nomials $(t = 3,5)$ over $GF(2)$ whose degree is a Mersenne exponent