Jump to content

Information for "Fermat's little theorem"

Basic information

Display titleFermat's little theorem
Default sort keyFermat's Little Theorem
Page length (in bytes)18,860
Namespace ID0
Page ID53453
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of page watchers183
Number of page watchers who visited in the last 30 days10
Number of redirects to this page12
Counted as a content pageYes
Wikidata item IDQ188295
Local descriptionA prime p divides a^p–a for any integer a
Central descriptionmathematical theorem that, for any prime 𝑝, the 𝑝th power of any integer 𝑛 is congruent to 𝑛 modulo 𝑝
Page views in the past 30 days

Page protection

EditAllow all users (no expiry set)
MoveAllow all users (no expiry set)
View the protection log for this page.

Edit history

Page creatorAxelBoldt (talk | contribs)
Date of page creation20:50, 5 October 2001
Latest editorMacrakis (talk | contribs)
Date of latest edit19:19, 20 August 2024
Total number of edits659
Recent number of edits (within past 30 days)0
Recent number of distinct authors0

Page properties

Hidden categories (8)

This page is a member of 8 hidden categories (help):

Transcluded templates (113)

Pages transcluded onto the current version of this page (help):

Wikidata entities used in this page

Lint errors

Duplicate IDs1
View detailed information on the lint errors.

External tools