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

sothea hoeung · Jan 12, 2012

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

jedishrfu · Jan 12, 2012

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.

micromass · Jan 12, 2012

Are you familiar with multinomial coefficients??

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

Undergrad The vector to which a dual vector corresponds

Undergrad Spinor calculus

Undergrad Matrix representation of rank-2 spinors

Undergrad Looking for a paper about spinors

Undergrad Why are these cycles disjoint and of equal length?

On the Moore–Penrose inverse from a banal linear algebra viewpoint

Insights Revisiting the Velocity-Time Function

Insights Remote Operated Gate Control System

Insights AI Enriched Problem Solving

Insights Thinking Outside The Box Versus Knowing What’s In The Box

Insights Why Entangled Photon-Polarization Qubits Violate Bell’s Inequality

Insights Quantum Entanglement is a Kinematic Fact, not a Dynamical Effect

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

Similar threads