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
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1090/s0025-5718-02-01478-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2079168443 / rank | |||
Normal rank | |||
Revision as of 10:47, 30 July 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
