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

  • Context: Graduate 
  • Thread starter Thread starter sothea hoeung
  • Start date Start date
Click For Summary
SUMMARY

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.

PREREQUISITES
  • Understanding of factorial notation and properties
  • Familiarity with mathematical induction techniques
  • Knowledge of multinomial coefficients
  • Basic combinatorial mathematics
NEXT STEPS
  • Study mathematical induction proofs in combinatorial contexts
  • Research multinomial coefficients and their applications
  • Explore advanced properties of factorials and their divisibility
  • Practice problems involving divisibility of factorial expressions
USEFUL FOR

Mathematicians, students studying combinatorics, and anyone interested in advanced factorial properties and proofs.

sothea hoeung
Messages
1
Reaction score
0
Prove that (n!)! is divisible by (n!)^(n-1)!
 
Physics news on Phys.org


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.
 


Are you familiar with multinomial coefficients??
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 22 ·
Replies
22
Views
3K
  • · Replies 25 ·
Replies
25
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 12 ·
Replies
12
Views
4K