A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 (Q4806397): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56939042, #quickstatements; #temporary_batch_1705817641484 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:01, 8 February 2024
scientific article; zbMATH DE number 1910551
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 |
scientific article; zbMATH DE number 1910551 |
Statements
A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 (English)
0 references
14 May 2003
0 references
irreducible polynomials
0 references
irreducible trinomials
0 references
primitive polynomials
0 references
primitive trinomials
0 references
Mersenne exponents
0 references
Mersenne numbers
0 references
random number generators
0 references
