2
24
1
2
1
4
1
2
10
20
2
2
12
4
3
6
3
We need to find largest possible value of ‘n’ such
that (n!)! divides 15000! for that n! < 15000
Note: 7! = 5040 and 8! = 40320 > 15000
which implies 15000! is not divisible by 40320!
Therefore, maximum value n can take is 7.
4
14
2
4
47