GCD calculation in the search task of pseudoprime and strong pseudoprime numbers (Q2361677)
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 6737910
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | GCD calculation in the search task of pseudoprime and strong pseudoprime numbers |
scientific article; zbMATH DE number 6737910 |
Statements
GCD calculation in the search task of pseudoprime and strong pseudoprime numbers (English)
0 references
30 June 2017
0 references
pseudoprime integers
0 references
strong pseudoprime
0 references
Euclidean algorithm
0 references
Weber algorithm
0 references
GCD
0 references
0.757515013217926
0 references
0.7551001310348511
0 references
0.7484082579612732
0 references
0.7467896938323975
0 references
0.7448422908782959
0 references
