由 ---- 於 星期四 四月 03, 2003 11:25 pm
Q1. What is wilson theorem ?
If p is a prime, we have
(p-1)!+1=0(mod p)
Q2. pk > n-k
pk-1 >= n-k ???
This step ???
Because pk, n, k are integers, when pk>n-k, pk-1>=n-k
Q3. xxxx ( mod xx) ???
What is mod ?
We say
a congruent to b (mod c) when
the remainder of a divided by c equals to the remainder of b divided by c.
It's similar to that of pascal.
You can express by this way:
a-b=ck (a,b,c,k are integers)
then a=b(modc)