The Rabin-Monier theorem for Lucas pseudoprimes (Q3127342): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Rabin-Miller Primality Test: Composite Numbers Which Pass It / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lucas Pseudoprimes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Strong Pseudoprimes to Several Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation and comparison of two efficient probabilistic primality testing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pseudoprimes to 25 ⋅10 9 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic algorithm for testing primality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Numbers Analogous to the Carmichael Numbers / rank
 
Normal rank

Revision as of 12:02, 27 May 2024

scientific article
Language Label Description Also known as
English
The Rabin-Monier theorem for Lucas pseudoprimes
scientific article

    Statements

    The Rabin-Monier theorem for Lucas pseudoprimes (English)
    0 references
    0 references
    8 April 1997
    0 references
    Rabin-Monier theorem
    0 references
    Lucas tests for primality
    0 references
    strong Lucas pseudoprime
    0 references

    Identifiers