Wilson’s theorem result

The following is a variant of Wilson’s theorem:

Let $p$ be a positive integer and $1\le k\le p-1$. Then:
$p$ is prime if and only if

$$(p-k)!(k-1)!\equiv {(-1)}^k(modp).$$

For particular $k=1,2,\mathrm{\dots }$ one gets nice results.