For unrestricted category probabilities, the log-likelihood is subject to . A multiplier gives constant, hence the unique maximum, because all counts are positive and the log-likelihood is strictly concave:
The likelihood ratio test compares this saturated maximum with the maximum under the parametric model. Twice the log ratio is
For bins and one regular fitted parameter, its usual large-sample reference distribution is ; reject for a sufficiently large value. Under a fully specified parameter , use and . This relies on an identifiable interior fit and adequate expected bin counts.
For individual ungrouped abundances, let be the number of species and the total number of individuals. The logarithmic-series model gives
Its score vanishes when
The left side increases continuously from one to infinity. One way to see strict increase is to set , making it , whose derivative is positive because increases from zero. The score has the sign of minus this increasing function, so this is the unique maximum. Bisection on is a robust numerical method; Newton's method is another option.
There are two fits implicit in the supplied presentation. Using the ungrouped sufficient statistics gives . By contrast the displayed ten-bin deviance is minimized near , so that is the table-based estimate . Grouping the upper tail discards its detailed abundance total; minimizing the grouped deviance maximizes the grouped likelihood, not the ungrouped likelihood used in the preceding score equation. The estimates therefore need not agree. The following table-based decisions use its grouped-fit convention.
Minimizing the sum of squared residuals gives the normal equations for linear least squares, . Full column rank makes positive definite and invertible, so the unique minimizer is
Because and , one has and
For the alternative linear estimator the corresponding general formulas are
No normality assumption on the errors is needed for these claims.

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