Suppose a line through meets each . Its intersection with is different from , so lies in . A nonzero direction vector for must therefore satisfy
A square matrix admitting a nonzero vector with has zero determinant. Expanding gives
Thus the necessary condition is
The condition is not sufficient. Take , which is on none of the three original lines. It satisfies the condition, since . The three plane equations become
Their common intersection is the single line . Any proposed line through meeting all three original lines would have to be this . But never meets : their second and third coordinates differ. The zero determinant guarantees a common direction for the three planes; it does not guarantee the required intersections. This is a parallel obstruction to a transversal of three skew lines.
The three lines have the convenient parametric equations
For , substitute , in the plane through a point and a line given by a cross product formula. Its normal vector is . Cyclically permuting the coordinates gives all three planes:
Each normal vector is nonzero because is not on the corresponding line. Thus these are genuine planes, and each is unique.
Apply the central limit theorem to the independent and identically distributed random variables , whose mean and variance are and . It gives the approximate standard normal distribution
The supplied standard normal quantile leaves probability in each tail. Hence
Since , this event is equivalent to
For , equivalently integer , both denominators below are positive. Inverting the inequalities gives the approximate confidence interval
The approximation is justified for large ; positivity at by itself does not guarantee accurate coverage. This construction is a confidence interval from a relative normal pivot: the unknown scale remains inside the pivotal ratio until the inequalities are inverted. Its meaning is that the random interval covers the fixed statistical parameter with probability approximately under repeated sampling.
The recurrence relation at gives . Consequently
By variance additivity for independent random variables, the variance of their sample mean is
Be careful about the index: the probability density function already contains a factor , so . The recurrence relation at yields . Therefore linearity of expectation gives
Thus is an unbiased estimator.
For , the change of variables gives
For , use and integration by parts:
The boundary term vanishes: at zero, and the exponential decay dominates the power at infinity. These estimates also establish convergence of the improper integrals used above.
For an observed random sample with all , which happens almost surely, independence gives the likelihood function
Ignoring a term independent of , the log-likelihood and its derivative are
This derivative is positive for and negative for . Thus there is a unique global maximum, and the maximum-likelihood estimator is
Assuming is measurable, applying it separately to independent and identically distributed random variables preserves those properties. Thus have common mean and variance . For , the central limit theorem gives
Hence, for large , the approximate probability distribution is
The second argument is the variance. If , this sample mean equals almost surely, so the appropriate description is a point mass at .
The central limit theorem states that if are independent and identically distributed random variables with finite mean and finite positive variance , then
Here the arrow means convergence in distribution: for every real , the probability that the expression on the left is at most tends to , the standard normal distribution function. If , the variables equal almost surely and their sample mean is exactly .
The probability density function must integrate to one, so
Also, linearity of expectation and the mean and variance of the standard normal distribution give
Using the probability density function to compute this expected value gives
These are the values and of the gamma function.
Differentiate the cumulative distribution function for , using and . The probability density function is
Its value at zero can be assigned arbitrarily without changing any probability. Although this probability density function diverges as , and there is no point mass at zero. Equivalently, has a gamma distribution with shape and rate one.
Since is nonnegative, its cumulative distribution function is zero for . For ,
The last equality uses the symmetry of the standard normal distribution. Thus
Normalization of the probability density function and the specified mean give two equations:
Dividing the second by the first gives . Consequently
Both are positive, as required for the stated probability density function.
Expand the square and use linearity of expectation, together with and :
This proof applies whenever the second moment is finite, and does not require the random variable to be continuous.
For a random variable with a continuous probability distribution and probability density function , the mean and variance are
A finite mean requires . A finite variance additionally requires the second moment to be finite; without that condition the nonnegative integral for the variance may be infinite.
Computing the same expected value directly from the Poisson distribution instead gives
For each fixed positive integer , the ratio test shows that this sum converges. This identity is Dobiński's formula. The case also gives if is interpreted as one in this particular moment formula.
Substitute into the polynomial identity and apply linearity of expectation to its finite sum. The factorial moments of the Poisson distribution in part (a)(iv) are all one, giving
Thus its th moment counts set partitions: it equals the th Bell number.
Every assignment determines a unique set partition into its nonempty colour classes. If there are such blocks of a set partition, there are choices for that set partition. For each fixed choice, assign distinct colours to the blocks of a set partition in
ways. Although the blocks of a set partition are unlabelled, they are distinguishable by their elements: ordering them temporarily, for instance by their least elements, counts each assignment exactly once. The falling factorial is zero when , as it should be. Summing over the possible numbers of used colours proves
Here is the Stirling number of the second kind. Both sides are polynomials in and agree at infinitely many integers , so the identity also holds for every real , including . This extension will justify substituting the random variable in part (iii).
Each of the distinct elements can receive any of the labelled colours. The multiplication principle therefore gives
colour assignments; colours are allowed to remain unused.

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