Information for "Fermat pseudoprimes"

Basic information

Display titleFermat pseudoprimes
Default sort keyFermat pseudoprimes
Page length (in bytes)47,313
Page ID14390
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
Number of subpages of this page0 (0 redirects; 0 non-redirects)

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorThundergnat (talk | contribs)
Date of page creation11:55, 16 August 2022
Latest editorGordonCharlton (talk | contribs)
Date of latest edit20:24, 8 November 2022
Total number of edits25
Total number of distinct authors9
Recent number of edits (within past 180 days)25
Recent number of distinct authors9

Page properties

Transcluded templates (7)

Templates used on this page:

SEO properties



Article description: (description)
This attribute controls the content of the description and og:description elements.
A Fermat pseudoprime is a positive composite integer that passes the Fermat primality test. Fermat's little theorem states that if p is prime and a is coprime to...
Information from Extension:WikiSEO