Use . The Lagrange multiplier equations are
Taking the dot product with gives , so .
If , the first and third equations give . The middle equation then gives , so . The norm constraint gives and . Thus the hottest points and their temperature are
The coldest points are
For , the equations give , , and hence the other two constrained stationary points are
They are saddle points of the restriction to the sphere: with and as local tangent coordinates there, changes sign in every neighbourhood. The surface is compact and smooth, so the listed extreme temperatures are global. Here “zero gradient on the surface” means zero surface gradient; the ambient gradient at the hottest and coldest points is normal to the sphere, rather than zero.
At a regular constrained extremum, every tangent vector to the level set gives zero directional derivative of . Thus is perpendicular to the tangent plane, and must be a scalar multiple of its nonzero normal vector . The Lagrange multiplier equations are
One solves these four equations for , evaluates at the candidates, and classifies or compares the values as required. Points where , and any boundary or limiting cases of the feasible domain, require separate checks because the regularity argument does not cover them.
Evaluate at , where the original expression gives . The Fourier series gives
Rearranging proves
The convergence at this point is justified by the continuity properties noted in part (b).
Separate the already finite sine terms from the even part . Since is an even function, it has no sine coefficients. Its constant coefficient is
For , integration by parts gives
Therefore the cosine Fourier coefficients are
Only even frequencies survive: . The sine Fourier coefficients are , , with all others zero. Hence
The periodic function is continuous at zero and at its endpoint joins, and its coefficients are absolutely summable. Thus this Fourier series represents it everywhere, including those joins.
The displayed matrix is not orthogonal: its first column has squared Euclidean norm three, whereas every column of an orthogonal matrix must have squared length one.
For the general assertion, put . In the Einstein summation convention, orthogonality gives and . The entries of satisfy
This is exactly , proving that the matrix product is orthogonal. The Kronecker delta contracts the two middle indices without changing the multiplication order of the matrices.
Use cylindrical radius . The upper cone is and the lower elliptic paraboloid is , both with . They meet along the unit circle in . The enclosed solid is
Thus the coordinate ranges on the complete surface are
These separate ranges do not mean every point of their Cartesian product lies on the surface. A vertical cross-section has a straight upper cone profile and a curved lower paraboloid profile.
Figure 1.
A cone and a paraboloid joined along their unit-circle rim
. The upper cone has apex ; the lower elliptic paraboloid has vertex . Both meet at cylindrical radius one and height zero. The meridian cross-section shows the enclosed vertical range at each radius. Details.
The characteristic equation of the associated homogeneous linear differential equation is . A constant particular integral is , so
The first boundary condition gives . The second gives . Eliminating yields , hence and . Therefore
On a nonconstant branch with , regard as a function of . The equation becomes the linear ordinary differential equation
An integrating factor is , giving
Taking an antiderivative yields the implicit family
On a regular branch this can also be written . The latter form loses the constant solutions , which must be restored separately.
The implicit relation is a first integral of an ordinary differential equation: along any differentiable solution of the original equation,
Conversely, a differentiable graph satisfying this relation solves the original equation wherever . The original equation is undefined when ; points at which also need separate attention before solving explicitly for . This is why dividing immediately by can lose valid solutions and obscure nonuniqueness.
For independent seeds the probability of at least one success is . Requiring it to be at least gives . For , taking logarithms and dividing by the negative number reverses the inequality:
The smallest permitted integer is therefore
The ceiling function is necessary because seeds are counted discretely. If , no finite number suffices; if , one seed suffices. The target is interpreted as at least a ninety-five percent chance, since exact equality may not be attainable with an integer count.

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