Fermat's little theorem and a bounded modular-factorial code
Statement
Question 1 (D'Aquino). Fermat's little theorem states that
xp ≡ x mod p
Proof 1: F∗
p
is cyclic using the fact that
#{x | P (x) = 0 } ≤ deg( P )
Proof 2: List R = {1, 2,..., p − 1}. Show that for a ∈ R, multiplication by a is a permuation. Then p−1
∏
i=1
i ≡
p−1
∏
i=1
(ai ) mod p
From this follows that
(p − 1)! ≡ ap−1(p − 1)! mod p
Give a "simple" definition of n! mod p (this is OK for exponentiation). Proof 3: Use
(x + y)p = xp + yp mod p
Find other proofs.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.