Help simplifying this using Stirlings' Formula?

eprparadox
Messages
133
Reaction score
2
Hey guys!

So I'm self studying Daniel Schroeder's Intro to Thermal Physics and we're to use Stirlings Approximation to simplify the following (assume that BOTH q and N are large, but we don't have a relationship between q and N):

<br /> \Omega \left( N,q\right) \approx \dfrac {\left( \dfrac {q+N} {q}\right) ^{q}\left( \dfrac {q+N} {N}\right) ^{N}} {\sqrt {2\pi q\left( q+N\right) / N}}<br />

The formula to find the multiplicity of an Einstein solid is:

<br /> \Omega \left( N,q\right) =\dfrac {\left( N-1+q\right) !} {q!\left( N-1\right) !}<br />

The hint in the text says to show that first:

<br /> \Omega \left( N,q\right) =\dfrac {N} {q+N}\dfrac {\left( q+N\right) !} {q!N!}<br />

With q and N being large, I thought I could immediately say that

<br /> \Omega \left( N,q\right) \approx \dfrac {\left( q+N\right) !} {q!N!}<br />

But I don't know where you get the

<br /> \dfrac {N} {q+N}<br />

I tried immediately applying Stirlings Approximation but got nothing like the hint or the answer we're looking for.

I'm a little lost on where to begin here. Any thoughts?

Thanks so much.
 
Mathematics news on Phys.org
eprparadox said:
<br /> \Omega \left( N,q\right) =\dfrac {N} {q+N}\dfrac {\left( q+N\right) !} {q!N!}<br />

If you cancel the common factor of N in the numerator and N in the N! expression in the denominator, what do you get?
 
oh nice! got it.

Man, I'm dumb! Thanks so much.
 
  • Like
Likes perplexabot
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top