Meaning of the mixing free energy. The supplied expression is the Flory–Huggins solution theory mixing free energy per lattice site, or per solvent-sized reference cell. Although the question calls it “per particle,” it cannot mean per polymer molecule: one chain occupies sites. Let the site volume be , the total number of sites be , and the chain and solvent counts be , so
where
The first term is the polymer's translational entropy of mixing. Its factor expresses that connected segments translate as one molecule. The second is the solvent's translational mixing entropy. Both are negative in the mixing free energy for , favoring mixing.
The final term is a mean-field excess contact contribution. The Flory interaction parameter measures the relative preference for unlike polymer-solvent contacts compared with like contacts. In the simplest lattice model with coordination number and pair energies ,
Positive penalizes unlike contacts and promotes separation; negative favors them. Effective real-solution values can also include non-enthalpic effects, so their temperature dependence need not be exactly a constant divided by . The subsequent derivatives assume composition-independent as in the supplied model.
Osmotic pressure and the special value one half. At fixed chain count, . Differentiating with respect to volume, relative to the pure-solvent reference, gives
The resulting osmotic pressure in Flory-Huggins solution theory is
The leading term is the ideal osmotic pressure of chains, since their number density is . At the second-virial term vanishes: effective two-segment attraction and excluded-volume repulsion balance. This is the theta solvent condition for a sufficiently long dilute chain; the positive third-order contribution remains, so a finite-concentration solution is not a completely noninteracting gas. The site-volume factor is necessary to give physical pressure units.
For , the effective pair excluded volume is positive. In a good solvent, the isolated chain expands relative to a Gaussian coil, with , or in the Flory approximation. For , attraction wins in a poor solvent and a sufficiently long chain collapses toward a dense polymer globule, with asymptotic size . Close to the theta condition, finite-chain crossover effects matter. At , to leading scaling order. This theta criterion is not the exact finite- phase-separation critical point; the lattice model has and .
Overlap concentration. The polymer overlap concentration is reached when there is roughly one isolated coil in its own pervaded volume. If the coil size is and a repeat unit occupies volume ,
With , the general scaling law is
The usual single-segment-volume estimate gives : in a theta solvent, approximately in a good solvent, and order one for compact globules. A coil has no sharp surface, so choosing a radius of gyration or a geometric coil volume changes numerical prefactors.
For the stated polystyrene at and , the conventional scaling estimate is
This is a volume-fraction estimate, not a molar concentration. It uses the implicit site-volume approximation; the question does not provide an independent repeat-unit volume to determine a more precise prefactor.
Semidilute length scale. Beyond overlap, a semidilute polymer solution is characterized locally by a concentration blob size . Suppose one blob contains statistical units. At the theta condition the subchain is Gaussian, so , while matching its internal concentration to the bulk gives . Eliminating gives the concentration-blob size in a theta solvent:
Using the supplied statistical step length and ,
The same convention gives , and the whole ideal chain has . Thus the blob is smaller than the chain. Because is only modestly above overlap, the value is a scaling estimate in a crossover region, not a precision asymptotic measurement. A statistical step length is not automatically a physical monomer diameter: if differs from , the more general estimates are and , with the missing prefactor left explicit.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact