Which is Larger: $2005!$ or $2^{18000}$?

  • Context: MHB 
  • Thread starter Thread starter anemone
  • Start date Start date
  • Tags Tags
    Value
Click For Summary
SUMMARY

The discussion centers on comparing the sizes of $2005!$ and $2^{18000}$. Using Stirling's approximation, it is established that $\ln 2005! \sim 13244.536$ while $\ln 2^{18000} = 12476.649$. Therefore, $2005!$ is definitively larger than $2^{18000}$. The Stirling approximation formula used is $\ln n! \sim (n + \frac{1}{2}) \ln n - n + \frac{1}{2} \ln (2 \pi)$.

PREREQUISITES
  • Understanding of Stirling's approximation
  • Basic knowledge of logarithmic functions
  • Familiarity with factorial notation
  • Concept of exponential growth
NEXT STEPS
  • Study Stirling's approximation in depth
  • Learn about logarithmic properties and their applications
  • Explore factorial growth rates compared to exponential functions
  • Investigate induction methods for proving inequalities
USEFUL FOR

Mathematicians, students studying combinatorics, and anyone interested in comparing large numbers using approximations and logarithmic analysis.

anemone
Gold Member
MHB
POTW Director
Messages
3,851
Reaction score
115
Which is larger, $2005!$ or $2^{18000}$?
 
Mathematics news on Phys.org
anemone said:
Which is larger, $2005!$ or $2^{18000}$?

[sp]Using the Stirling approximations You have...

$\displaystyle \ln n! \sim (n + \frac{1}{2})\ \ln n - n + \frac{1}{2}\ \ln (2\ \pi)\ (1)$

... so that is $\displaystyle \ln 2005! \sim 13244,536...$

On the other side is...

$\displaystyle \ln 2^{n} = n\ \ln 2\ (2)$

... so that is $\displaystyle \ln 2^{18000} = 12476.649...$ [/sp]

Kind regards

$\chi$ $\sigma$
 
chisigma said:
[sp]Using the Stirling approximations You have...

$\displaystyle \ln n! \sim (n + \frac{1}{2})\ \ln n - n + \frac{1}{2}\ \ln (2\ \pi)\ (1)$

... so that is $\displaystyle \ln 2005! \sim 13244,536...$

On the other side is...

$\displaystyle \ln 2^{n} = n\ \ln 2\ (2)$

... so that is $\displaystyle \ln 2^{18000} = 12476.649...$ [/sp]

Kind regards

$\chi$ $\sigma$

Thank you chisigma for participating in this challenge problem! And thank you for your nice solution using the Stirling approximations route!:cool:

Solution proposed by other through induction method:
We show that for all $n$, $n!>\left(\dfrac{n}{3} \right)^n$. This is true for $n=1$.

Suppose it is true for $n$. Then $(n+1)!=(n+1)n!>(n+1)\left(\dfrac{n}{3} \right)$.

Now, $\left(\dfrac{n+1}{3} \right)^{n+1}\left(\dfrac{3}{n} \right)^n=\dfrac{n+1}{3}\left(1+\dfrac{1}{n} \right)^n<\dfrac{(n+1)e}{3}<(n+1)$, this proves that $(n+1)!>\left(\dfrac{n+1}{3} \right)^{n+1}$ which then justifies the claim by induction.

Therefore, $2005!>2004!>668^{2004}>512^{2004}=2^{9\cdot2004}=2^{18036}>2^{18000}$ and we can conclude by now that $2005!$ is the greater of the two.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
Replies
18
Views
2K
  • · Replies 7 ·
Replies
7
Views
4K
  • · Replies 7 ·
Replies
7
Views
3K
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K