Prove (n!)! divided by (n!)^(n-1)! is an integer

[juantheron]

Prove by permutations or otherwise $\displaystyle \frac{\left(n!\right)!}{\left(n!\right)^{(n-1)!}}$, where $n\in \mathbb{N}$

 

[Siron]

Your question is not complete. What do you need to prove?

 

[kaliprasad]

This is not a new question. it is same as previous question with diffeent value

I think you mean it to be integer

Spoiler

this is same as previous solution with m= (n-1)! http://mathhelpboards.com/challenge-questions-puzzles-28/integer-quantity-12418.html