MathPages: Symmetric Pseudoprimes
Edit Page
Report
Scan day: 05 March 2014 UTC
10
Virus safety - good
Description: A pseudoprime type based on symmetric functions. Basic propositions and computational techniques.
Fermat's Little Theorem states that for any integer c, if p is a prime, then c c is divisible by p. This is a necessary but not quite sufficient condition for primality, because there are (rare) composites that satisfy this type of test for certain values of c. For example, 2
Size: 281 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Symmetric Pseudoprimes |
| Keywords: | |
| Description: | |
| IP-address: | 198.65.11.82 |
WHOIS Info
| NS | Name Server: NS19A.NAMESERVERS.NET Name Server: NS19B.NAMESERVERS.NET |
| WHOIS | Status: clientTransferProhibited |
| Date | Creation Date: 08-aug-1999 Expiration Date: 07-oct-2021 |