juantheron Messages 243 Reaction score 1 Thread starter Sep 29, 2014 #1 Prove by permutations or otherwise $\displaystyle \frac{\left(n!\right)!}{\left(n!\right)^{(n-1)!}}$, where $n\in \mathbb{N}$
Prove by permutations or otherwise $\displaystyle \frac{\left(n!\right)!}{\left(n!\right)^{(n-1)!}}$, where $n\in \mathbb{N}$
Siron Messages 148 Reaction score 0 Sep 29, 2014 #2 Your question is not complete. What do you need to prove?
kaliprasad Gold Member MHB Messages 1,333 Reaction score 0 Sep 29, 2014 #3 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
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