I take it
are the prime numbers? This is Wilsons theorem.
For any
there's an
with
(mod p).
I'm afraid this doesn't work: this presumes you already know p is prime, which is precisly what you're tring to prove!
Further,
i ff
or
. Hence, in
, the numbers forming this product can be cancelled in pairs, apart from
and
. Hence result.