Compute the curl component by component from the given vector field:
For example, and . Its divergence is
as expected because the divergence of a curl is zero.
Take counterclockwise when viewed from positive , the disc upward oriented, and the hemisphere outward oriented. These choices give both surfaces the same positive boundary orientation. Parametrize by , . On it, and , so the line integral is
On , use polar coordinates and . Since there, the surface flux is
On the unit hemisphere, the outward unit normal vector is . Since , we have . In spherical polar coordinates, and , giving the explicit surface integral
Indeed the inner integral is .
These equalities illustrate Stokes theorem twice: and either upward or outward spans the oriented circle , so each surface flux equals the same line integral. For the divergence theorem, close the upper half-ball by adjoining the downward oriented base, namely . Its outward surface flux is
The minus sign on the base is required because its outward normal vector points down. Reversing a specified orientation reverses that integral's sign.
The required matrix form of the linear system is
Subtract the first row from the third and expand the determinant along the resulting row:
Thus the linear system has a unique solution, for every real , precisely when .
For , the second equation gives . Subtracting the first equation from the third gives , and the first equation then determines :
For , the first and third left-hand sides are identical but their right-hand sides are and . Hence
For , subtracting the first equation from the third gives . The first equation now gives , while the second requires . Consequently
The free variable in a linear system in the consistent singular case describes a line of solutions. These direct reductions distinguish an inconsistent linear system from one with infinitely many solutions, which a zero determinant alone cannot do.
The number of successes has a binomial distribution. Each arrangement of successes and failures has probability by independence, and the binomial coefficient counts the arrangements. Therefore
The final equality is the binomial theorem. Writing as a sum of independent Bernoulli random variables gives its expectation and variance: , . Thus the matching normal distribution has
The normal approximation is appropriate when both expected counts and are sufficiently large; large alone is insufficient if is extremely close to zero or one.
For the guessing student, , , . Therefore the expected number of correct answers is , and , . The inclusive integer range becomes after the continuity correction. Standardizing the normal distribution gives
Here , and the last step uses the supplied bound. The approximate probability is . The normal approximation provides the requested conclusion; as a separate check, summing the five exact binomial probabilities gives approximately , also exceeding one half.
The periodically extended is even, so every sine coefficient is zero. With the convention , the Fourier coefficients are
For the second integral, two applications of integration by parts give . Consequently
The periodic extension is continuous even at the joined endpoints, where both one-sided values equal . The pointwise convergence of a piecewise smooth Fourier series therefore gives the displayed values throughout the interval; the coefficient bound also gives uniform convergence by the Weierstrass M-test. Setting and then yields

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