כותרת: פתרון
Let´s prove it for the general case of (p-3)! mod p, when p> is prime.
Zp is a field. Therefore each a#0 in Zp has a unique b in Zp such as that ab=1.
Now, in Zp:
(p-1)*(p-1)=p(p-1)-(p-1)=p(p-2)+1=1.
(p-2)*[(p-1)/2]=(p(p-3)+2)/2=2/2=1.
Therefore 1*…*(p-3) has a unique reciprocal for each factor except for (p-1)/2.
That means that (p-3)!=1*…*(p-3)=(p-1)/2.
Therefore (p-3)! mod p = (p-1)/2.
Oren.
p.s: For guys not familiar with the terms, search for some basic linear algebra text and for Euclid´s extended algorithm.