In SI units, Gauss's law for a closed surface with outward unit normal vector is
Spherical symmetry and the absence of an imposed external field make the electric field radial, . For (with the physical radius ),
Outside the charge distribution this becomes . Applying Gauss's law on spheres gives
Both formulas agree at , and the first tends to zero at the origin. Thus the total charge is . Negative reverses the field direction. If the radius is zero the distribution vanishes; a negative value of gives no nonnegative-radius support under the printed piecewise inequalities and likewise gives the zero distribution.
For a holonomic conservative system the Lagrangian is , the difference between kinetic energy and potential energy. The Euler-Lagrange equations are
If , this gives for the generalized momentum . Such a coordinate is a cyclic coordinate.
In cylindrical coordinates the squared speed is . The holonomic constraint gives , while gravity has potential energy . Therefore
There is no explicit dependence, so is a cyclic coordinate and
This is angular momentum about the vertical symmetry axis. At the polar angle is singular, but the Cartesian angular momentum remains well defined and has the same conserved value.
Let be a smooth variation with . Assuming the usual continuous second derivatives of , stationarity of the functional under gives its first variation
Integration by parts removes the derivative of ; its boundary term vanishes because the endpoint values are fixed. Thus
for every such variation. The fundamental lemma of the calculus of variations implies the Euler-Lagrange equation .
For arc length, , so
The function is strictly increasing; hence is constant. With endpoints and , , the extremal is
It is also the global shortest curve: integrating the unit displacement vector dotted with the curve velocity gives the endpoint distance, which is at most the integrated speed by Cauchy-Schwarz inequality; the straight segment attains equality. A vertical segment is described parametrically or after rotating axes, since it cannot be represented by on a nontrivial horizontal interval.
A topological space is connected when it cannot be written as the union of two disjoint nonempty open sets. Equivalently, the only subsets that are simultaneously open and closed are the empty set and the whole space. For a subset, connectedness refers to its subspace topology.
A complete metric space is a metric space in which every Cauchy sequence converges to a point of that space.
If , choose so that for all . The triangle inequality gives , proving the Cauchy sequence property.
Now let be complete in the induced metric. If , choose with . The sequence converges to in , so is a Cauchy sequence. Completeness of supplies a limit . Uniqueness of limits in a metric space gives , hence . Therefore a complete metric subspace is closed.
Completeness does not imply sequential compactness. In the complete space , the sequence has no convergent subsequence: a subsequence has strictly increasing indices , so and is unbounded, whereas every convergent real sequence is bounded.
The annulus is open and hence Lebesgue measurable; multiplying its indicator by the continuous Gaussian gives a measurable function. It is bounded by the indicator of , whose Lebesgue integral is . Thus it is Lebesgue integrable by comparison.
Use the change of variables formula with polar coordinates , . Removing one radial cut makes this a smooth one-to-one coordinate map; the cut is a null set and does not affect the integral. The absolute Jacobian determinant is . By Fubini theorem,
The antiderivative is , which also makes the sign of the answer transparent.
Use the agreed text encoding to split the plaintext into integer blocks . RSA encrypts each block by modular exponentiation:
Because is a product of distinct primes, its Euler totient function is . The inverse exponent follows from
Thus a decryption exponent is 275, and the three recovered blocks are
To check every block, including blocks not coprime to the modulus, reduce modulo each prime. If is nonzero modulo 29, Fermat's little theorem gives because ; if it is zero the equality is immediate. The same argument works modulo 37 because . The Chinese remainder theorem then gives the equality modulo 1073. Finally reverse the agreed text encoding. The symbols are unspecified, so there are no numerical message blocks to evaluate further.
Put . The tower law for field extensions shows that both and divide . Since are coprime, their product divides , so .
The minimal polynomial of over has degree and is still an annihilating polynomial over . The minimal polynomial over divides it, so
The upper and lower bounds agree:
Coprimality is the step forcing the lower bound to equal the product; without it the two generated fields can overlap substantially.
Write the group action as . A right group action satisfies and . Its orbit and stabilizer are
The identity belongs to . If , then , so . Also implies , so . Thus is a subgroup.
For the orbit-stabilizer theorem, the map , , is onto, and
Its fibers are precisely the right cosets , each containing elements. Counting these disjoint fibers gives
For the symmetric group , the six subgroups are
The group action has four orbits: each of , , and is fixed, while the three order-two subgroups form one orbit. Here an orbit is a collection of subgroups, rather than a collection of individual permutations.

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