Fermat pseudoprimes: Difference between revisions
Content added Content deleted
Thundergnat (talk | contribs) m (→{{header|Raku}}: better parenthesis placement) |
Thundergnat (talk | contribs) m (err. opposite meaning) |
||
Line 1: | Line 1: | ||
{{draft task}} |
{{draft task}} |
||
A [[wp:Fermat_pseudoprime|Fermat pseudoprime]] is a positive composite integer that |
A [[wp:Fermat_pseudoprime|Fermat pseudoprime]] is a positive composite integer that passes 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'''''. |
[[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'''''. |