Integer Quantity Prove: Permutations/Otherwise n^2! / (n!)^n

  • MHB
  • Thread starter juantheron
  • Start date
  • Tags
    Integer
In summary, an integer quantity proof is a mathematical demonstration of a relationship between integers, such as permutations or factorials. It involves using principles of combinatorics and properties of factorials. The formula for n^2! / (n!)^n is often used in these proofs to show the number of possible permutations and to solve complex problems. These proofs have practical applications in fields such as computer science, statistics, and economics.
  • #1
juantheron
247
1
Prove by permutations or otherwise $\displaystyle \frac{\left(n^2\right)!}{\left(n!\right)^n}$, where $n\in \mathbb{N}$
 
Mathematics news on Phys.org
  • #2
jacks said:
Prove by permutations or otherwise $\displaystyle \frac{\left(n^2\right)!}{\left(n!\right)^n}$, where $n\in \mathbb{N}$

we know that product of n consecutive numbers is divisible by n!

so n! is dvisible by n!
$\frac{\left(2n\right)!}{\left(n!\right)}$ is divisible by n!
$\frac{\left(3n\right)!}{(2n)!}$ is divisible by n!
...
$\frac{\left(n\right)^2!}{(n(n-1))!}$ is divisible by n!

hence the product of 1st term in each of lines that is $(n^2)!$ is divisible product of 2nd term in each of lines that is $(n!)^n$
 
Last edited:
  • #3
Thanks Kali.

My Solution:

Distribution of $(mn)$ different objects things into $m$ group each contain $n$ objects $\displaystyle = \frac{(mn)!}{(n!)^m}$

Where order of the group is important.

Now put $m=n\;,$ we get...

Distribution of $(n^2)$ different objects things into $n$ group each contain $n$ objects $\displaystyle = \frac{(n^2)!}{(n!)^n}$

Where order of the group is important.
 
Last edited by a moderator:

FAQ: Integer Quantity Prove: Permutations/Otherwise n^2! / (n!)^n

What is an integer quantity prove?

An integer quantity prove is a mathematical proof that demonstrates a particular relationship between integers, such as a permutation or factorial, using various mathematical principles and techniques.

What is a permutation?

A permutation is an arrangement of a set of objects in a specific order. It is often denoted by the symbol "n!", where n represents the number of objects in the set.

How is the formula for n^2! / (n!)^n derived?

The formula for n^2! / (n!)^n is derived using the principles of combinatorics and the properties of factorials. It is often used in integer quantity proofs to demonstrate the relationship between permutations and factorials.

What is the significance of n^2! / (n!)^n in integer quantity proofs?

The value of n^2! / (n!)^n in an integer quantity proof can be used to show the number of possible permutations of a set of n objects. It can also be used to demonstrate the relationship between permutations and factorials, and to solve complex mathematical problems involving these concepts.

Are there any real-world applications of integer quantity proofs?

Yes, integer quantity proofs have many real-world applications in various fields such as computer science, statistics, and economics. They are used to solve problems involving permutations, combinations, and factorials, and are essential in understanding and analyzing complex systems and data sets.

Similar threads

Back
Top