Scribd
Upload
8 views2 pages

HW 1

koc uni stat mech homework 1

Uploaded by

Murat Özinan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views2 pages

HW 1

koc uni stat mech homework 1

Uploaded by

Murat Özinan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

PHYS 301 - Homework #1

Rn
• Problem 1: Calculate nm=1 ln m and 1 ln xdx for increasing values of
P
n = {2, 3, 4, · · · }, and identify the critical nc where the relative error be-
comes less than 1%.

• Problem 2: Stirling’s formula can be used to derive following four approx-


imations:

– (a) log(N !) ≈ N log(N )


– (b) log(N !) ≈ N log(N ) − N
– (c) log(N !) ≈ N log(N ) − N + 21 log(N )
– (d) log(N !) ≈ N log(N ) − N + 12 log(N ) + 21 log(2π)

For each of these approximations find the smallest value of N for which the
relative error in N ! becomes less than 1%. What do you conclude from this
analysis? Hint: Relative Error = |Exact- Approximation| / Exact.

• Problem 3: Consider spin-1 particles. Each spin has a magnetic moment in


the z direction of si = {−m, 0, m}. Suppose we have N = N P0 N+ N− + N+
particles, and their total magnetization is given as: M = i=1 si . Let’s
define N+ = N/3 + s+ , N− = N/3 + s− and N0 = N/3 − s+ − s− .

– (a) Find the multiplicity function gN (s+ , s− ) and its probability PN (s+ , s− ).
– (b) Using the Stirling’s approximation, approximate ln PN (s+ , s− ) when
s+ /N ≪ 1 and s− /N ≪ 1.
– (c) Show that PN (s+ , s− ) is again given by a Gaussian distribution of
the total magnetization.

• Problem 4: A system is composed of N sites. The occupation probability


of a given site is t and only one particle can occupy a site at a given time.

– (a) Find the probability p(N, M, t) that exactly M sites are occupied.
– (b) Find the probability p(M, A) that M sites are occupied in the limit
N → ∞, where A is the average number of sites occupied, hence
A
t= N . Here, t is finite, and you may take A and M to be large.
– (c) Show that the probability you found in part (b) is normalized. Cal-
culate ⟨M ⟩ and ⟨M 2 ⟩.

1
– (d) Show that when A is very large, the
√ distribution near A can be
approximated by a Gaussian with width A.

Hint: Search for Binomial, Poisson and Gaussian distributions.

You might also like