Given a prime $p$ and an integer $0 \leq k \leq p-1$, a famous congruence on binomial coefficients states: $$\binom{p-1}{k} \equiv (-1)^k \pmod{p}$$ It is generally taught as a consequence of Pascal’s rule (1653-1665) and Wilson’s theorem (1770-1771).
We need someone expert in History of Mathematics (especially about the subject 11B65) to answer the following three questions:
- Who is credited for its discovery (i.e., who left the first clear statement about it)?
- Who established it (i.e., who supplied its first known proof)?
- Was it originally proved as above or via alternative formulations like, e.g., $1+(-1)^{k+1} \binom{p-1}{k} \equiv 0 \pmod{p}$?
Thank you for your help.