Detecting prime numbers via roots of polynomials (Q2883977)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6034808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting prime numbers via roots of polynomials |
scientific article; zbMATH DE number 6034808 |
Statements
Detecting prime numbers via roots of polynomials (English)
0 references
14 May 2012
0 references
prime numbers
0 references
composite numbers
0 references
congruence modulo \(n\)
0 references
polynomials
0 references
degree
0 references
monics
0 references
Euler \(\phi\) function
0 references
little Fermat theorem
0 references
greatest common divisor
0 references
0.7208322882652283
0 references
0.7107994556427002
0 references
0.7010179758071899
0 references
