Thank you for registering.

One of our academic counsellors will contact you within 1 working day.

Please check your email for login details.
MY CART (5)

Use Coupon: CART20 and get 20% off on all online Study Material

ITEM
DETAILS
MRP
DISCOUNT
FINAL PRICE
Total Price: Rs.

There are no items in this cart.
Continue Shopping

Prove by permutation of otherwise (n 2 )! / (n!) n is an integer (n ∈ I).

Prove by permutation of otherwise (n2)! / (n!)n  is an integer (n ∈ I).

Grade:upto college level

1 Answers

Navjyot Kalra
askIITians Faculty 654 Points
7 years ago
Hello Student,
Please find the answer to your question
Let there be n sets of different objects each set containing n identical objects
[eg (1, 1, 1 . . . . . . . . . . . (n times) ), (2, 2, 2 . . . . . . . . . . . . . . . 2 (n times)) . . . . . . . . . . . . . . . (n, n, n . . . . . . . n) n times) )]
Then the no. of ways in which these n x n = n2 objects can be arranged in a row
= (n2)! / n! n! . . . . . . . n! = (n2)! / (n!)n
But these number of ways should be a natural number
Hence (n2)! / (n!)n is an integer. (n ∈ I)

Thanks
navjot kalra
askIITians Faculty

Think You Can Provide A Better Answer ?

Provide a better Answer & Earn Cool Goodies See our forum point policy

ASK QUESTION

Get your questions answered by the expert for free