A number theory problem by Jawad Arman

True or false :

For all positive integer n n , ( n ! ) ! (n!)! is divisible by ( n ! ) ( n 1 ) ! (n!)^{(n-1)!} .

False True

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Jawad Arman
Feb 17, 2016

(n!)! can be written as (n-1)! sets of integers all of them contains n consecutive integers and all of the set is divisible by n! so taking n! from each set we can get (n!)^(n-1)! from (n!)!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...