To start with, observe that if the claim holds for all integers, it holds for rational numbers as well.
This permits us to focus on positive integers.
For those, the mathematical induction seems a natural way to proceed.
We apply induction to show that every prime can be represented as claimed. This is true for 2 = 2!. Suppose the claim holds for all the primes less than the given prime p > 2.
Since p=p!/(p-1)! and (p - 1)!
admits a factorization into a product of primes smaller than p, we see, by the induction hypothesis, that the claim holds for p as well and so holds for all prime numbers.
Now, since every integer is subject to a prime factorization, and every prime has been shown to be in the required form, the same applies to all integer numbers.

Comments: (
You must be logged in to post comments.)