- #1

- 1

- 0

Prove that (n!)! is divisible by (n!)^(n-1)!

- Thread starter sothea hoeung
- Start date

- #1

- 1

- 0

Prove that (n!)! is divisible by (n!)^(n-1)!

- #2

jedishrfu

Mentor

- 12,235

- 5,941

first try playing with n=2 then n=3 then n=4 and see if you can find a pattern and only evaluate the n! itself not everything to see the pattern

(2!)! = 2! and (3!)! = 6! and (4!)!=24! vs (2!)^(1!)= 2^1 ...

Next I think you need to use induction to prove it.

- #3

- 22,089

- 3,291

Are you familiar with multinomial coefficients??

- Replies
- 7

- Views
- 9K

- Last Post

- Replies
- 7

- Views
- 8K

- Replies
- 11

- Views
- 24K

- Replies
- 6

- Views
- 22K

- Last Post

- Replies
- 13

- Views
- 2K

- Last Post

- Replies
- 12

- Views
- 7K

- Last Post

- Replies
- 10

- Views
- 6K

- Last Post

- Replies
- 7

- Views
- 4K

- Last Post

- Replies
- 33

- Views
- 10K

- Replies
- 2

- Views
- 7K