The total under has Poisson distribution with mean , and the observed total is . Its one-sided p-value is therefore
The supplied also shows that the observed count does not enter the approximate 10% upper-tail rejection region. Thus there is insufficient evidence to reject at either the 10% or 5% level. The question specifies no testing level, so the p-value gives the general conclusion: rejection is justified only at levels at least about .
The printed concerns a Poisson variable with mean one, not the twelve-month total. It is therefore not the null tail for this data; substituting it would incorrectly treat the yearly count as one month's count.
For , the ratio of the two sample likelihood functions is
For it is strictly increasing in . The Neyman-Pearson lemma therefore selects an upper tail:
Under the null, , so choose with this upper-tail probability at most . If exact size is required, randomize at the adjacent boundary value as needed. The rejection rule is the same for every , giving a uniformly most powerful test for the one-sided alternative.
The Neyman-Pearson lemma concerns testing a simple null density against a simple alternative . A test that rejects where , accepts where the ratio is below , and if necessary randomizes on the boundary to have null rejection probability , is a most powerful test among tests of size at most . Thus a likelihood-ratio threshold maximizes power at the specified simple alternative. The boundary randomization is relevant for discrete distributions.
Since the true mean is known to be zero, the chi-squared distribution gives . Let be the quantile of this law. The probability
rearranges, using positivity, to the exact confidence interval
There are degrees of freedom, because no unknown mean was fitted.
Put . For , the log-likelihood is . Its derivative is , changing from positive to negative at . Thus
The known mean is zero, so no centring at the sample mean is needed. Taking the expected negative second derivative gives . The large-sample variance is consequently . With the indicated standard-normal quantile, a Wald confidence interval is
The interval may be restricted to the parameter space . The parameter is the variance itself, so the standard error is proportional to , not to its square root.
With probability , the chain starts at and . Conditional on starting at , it takes a geometric number of transitions to first reach , with success probability , so . The probability generating function is therefore
The parameter is absent because the process stops at its first visit to . At the expression equals one, confirming eventual hitting with probability one.
The finite irreducible aperiodic Markov chain converges to its stationary distribution, regardless of its initial law. Therefore . Taking the arithmetic means of this convergent sequence gives
This uses linearity of expectation and convergence of Cesàro means; it does not require the variables to be independent.
A stationary distribution is a probability row vector satisfying . Its coordinates obey and . Thus
Because both transitions between distinct states have positive probability, the finite Markov chain is irreducible; its positive self-transition probabilities also make it aperiodic.
Condition on the intermediate state. Starting at , a return to after two transitions occurs through with probability or through with probability . These alternatives are disjoint, so
By the addition rule for independent Poisson random variables, has the same distribution as a sum of independent variables . Each has expectation and variance . The central limit theorem therefore gives
For , every variable is zero, and the conclusion is the degenerate normal law with zero variance.
Independence and convolution give
by the binomial theorem. Thus
A Poisson distribution with parameter has
For it is concentrated at zero. For , shifting the index in the defining series gives and , so .

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