English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

Okay, so the proof of the fact that the value of (p-1)! mod p is always p-1 is below:

If p is prime, the numbers {1,2,....p-1} form a group under multiplication modulo p. So for each element a in this group, there is an element b such that ab is congruent to 1 mod p.

If a is congruent to b mod p, then a^2 is congruent to 1 (mod p). This means that a^2 - 1 = (a+1)(a-1) = 0 (mod p). Since p is prime, this means a is congruent to 1 or -1 mod p (which means a = 1 or a = p-1).

Okay, so my question is, how did they get this part:
"If a is congruent to b mod p, then a^2 is congruent to 1 (mod p)."

2007-10-18 04:56:41 · 2 answers · asked by 3545 2 in Science & Mathematics Mathematics

2 answers

because a=1 and 1^2= 1

2007-10-18 05:00:06 · answer #1 · answered by Julian S 2 · 0 1

From the previous paragraph, ab = 1 (mod p), so if a = b (mod p), then a^2 = ab = 1 (mod p). Cute, huh?

2007-10-19 10:40:23 · answer #2 · answered by Tony 7 · 0 0

fedest.com, questions and answers