Fermat pseudoprimes: Difference between revisions

m
err. opposite meaning
m (→‎{{header|Raku}}: better parenthesis placement)
m (err. opposite meaning)
Line 1:
{{draft task}}
 
A [[wp:Fermat_pseudoprime|Fermat pseudoprime]] is a positive composite integer that failspasses the Fermat primality test.
 
[[wp:Fermat's_little_theorem|Fermat's little theorem]] states that if '''''p''''' is prime and '''''a''''' is coprime to '''''p''''', then '''''a<sup>p−1</sup> − 1''''' is divisible by '''''p'''''.
10,327

edits