Skip to main contentSkip to solution

For some natural number nn, assume that (15000)!(15000)! is divisible by (n!)!(n!)!. The largest possible value of nn is

Solution

✅ Correct Option: 2

We need to find the largest natural number nn such that (15000)!(15000)! is divisible by (n!)!(n!)!.

For (15000)!(15000)! to be divisible by (n!)!(n!)!, we need:

(n!)!≤15000!(n!)! \leq 15000!

This fundamental rule of factorials tells us that a!a! divides b!b! if and only if a≤ba \leq b.

Therefore, our condition becomes:

n!≤15000n! \leq 15000


Now we need to find the largest nn where n!≤15000n! \leq 15000.

Let us calculate factorials:

1!=11! = 1

2!=22! = 2

3!=63! = 6

4!=244! = 24

5!=1205! = 120

6!=7206! = 720

7!=50407! = 5040 (This is ≤15000\leq 15000)

8!=403208! = 40320 (This exceeds 15000)


Since 7!=5040≤150007! = 5040 \leq 15000 but 8!=40320>150008! = 40320 > 15000, the largest possible value of nn is 77.


When n=7n = 7: (n!)!=(7!)!=5040!(n!)! = (7!)! = 5040!

Since 5040≤150005040 \leq 15000, we have 5040!≤15000!5040! \leq 15000!

When n=8n = 8: (n!)!=(8!)!=40320!(n!)! = (8!)! = 40320!

Since 40320>1500040320 > 15000, we cannot have 40320!≤15000!40320! \leq 15000!

The factorial function grows extremely rapidly. This is why even a small increase from n=7n = 7 to n=8n = 8 makes such a dramatic difference (from 50405040 to 4032040320).

Therefore, the largest possible value of nn is 7\boxed{7}.

Keyboard Shortcuts

  • Left arrow: Previous question
  • Right arrow: Next question
  • S key: Jump to solution
  • Q key: Jump to question