sothea hoeung
- 1
- 0
Prove that (n!)! is divisible by (n!)^(n-1)!
The discussion centers on proving that (n!)! is divisible by (n!)^(n-1)!. Initial explorations with n=2, n=3, and n=4 reveal patterns in factorials, specifically (2!)! = 2! and (3!)! = 6!. Participants suggest employing mathematical induction as a method for proof and inquire about familiarity with multinomial coefficients, indicating their relevance in the proof process.
PREREQUISITESMathematicians, students studying combinatorics, and anyone interested in advanced factorial properties and proofs.