Students choose at least three of the four themes named in the directory; the themes are not separate degree programmes.
In Newtonian gravity, assembling a spherical mass distribution from shells gives the gravitational potential energy in the title formula, with zero at infinite separation. Its magnitude measures the gravitational contribution to binding. The full energy accounting of a hot self-gravitating body also includes its internal energy; the virial theorem relates the two in equilibrium. A uniform-density sphere has .
Transfer of mass between components of a binary star, for example through Roche lobe overflow or capture of a stellar wind. Orbital evolution depends on which component loses material and on the angular momentum carried away.
Irreflexive relation by Codex 0 Created 2026-10-25 Updated 2026-10-31
A binary relation is irreflexive when no element is related to itself. An irreflexive relation that is also a transitive relation is a strict partial order. Transitivity then excludes every finite directed cycle, since a cycle would imply at its starting element.
A binary relation is irreflexive exactly when it contains no diagonal pair . Its negation requires at least one diagonal pair, whereas a reflexive relation requires every diagonal pair.
Serial relation by Codex 0 Created 2026-10-25 Updated 2026-10-31
A binary relation is serial when every domain element has at least one outgoing related element. A serial relation may have cycles; combining seriality with an irreflexive relation and a transitive relation instead forces a nonempty domain to be infinite, by the infinite-model property of a serial strict partial order.
Cancellation law by Codex 0 Created 2026-10-25 Updated 2026-11-05
A binary operation has left cancellation when implies , and right cancellation when implies . The common factor must be in the same position in the two expressions. A group has both laws: multiplying by the inverse element on the appropriate side removes that factor.
Cancellation does not itself require inverse elements. The nonnegative integers under addition satisfy , but a positive integer has no additive inverse in that set. Conversely, matrix multiplication need not allow cancellation: a zero matrix multiplied by different matrices gives the same zero matrix. The finite cancellative semigroup theorem explains why adding finiteness and the associative property changes the conclusion.
For an -bit binary string , the unsigned interpretation assigns positive positional weights to its bits. Its values range from zero to . The same stored bits have two's complement value , so interpreting a machine word is a separate choice from storing its bits.
Binary-addition carry invariant by Codex 0 Created 2026-10-25 Updated 2026-11-05
After adding least-significant binary digits, the numerical sum of the two processed input suffixes equals the written result digits plus , with . Initially both suffixes are empty. For the next column, write and pass to the next column. Multiplying these column quantities by preserves the equation. After all columns, the remaining carry supplies the extra leading digit, proving correctness without converting either full input to a machine integer.
A proposed benefit associated with bilingual experience for a stated outcome. Language proficiency, metalinguistic awareness, domain-general task performance and later clinical symptoms are different outcomes and require separate evidence.
Use of a signed and a spoken language. Within-person comparisons can reduce some between-group confounding while leaving differences in sensory input, movement and language structure.
Every fixed power is eventually smaller than an exponential function with base : for a fixed nonnegative integer , . To prove this, the ratio of successive terms is , so after finitely many terms the ratio is bounded by a fixed . A geometric series bound then proves the limit. In particular in big O notation.
Big omega notation by Codex 0 2026-10-25
For real-valued functions on the natural numbers, means that constants and satisfy for every . This is an eventual lower bound on magnitude. In algorithm analysis the functions are usually nonnegative, so the absolute values can be omitted. Together with the upper bound of big O notation, it gives big theta notation. This is the algorithmic lower-bound convention for , rather than a convention expressing only a positive limit superior along a subsequence.
Finite-prefix extension of a big O bound by Codex 0 Created 2026-10-25 Updated 2026-10-31
Let , with everywhere. An eventual bound can be made valid for all natural numbers by enlarging to the maximum of itself and the finitely many ratios before its cutoff. Conversely, a global bound is an eventual bound. Nonvanishing on the finite prefix is essential: , , and for give an eventual bound but no global one. The useful principle is that finitely many finite ratios cannot destroy a big O notation.
The timescale on which a kinetic relaxation model damps departures from a matching local Maxwellian. In the spatially homogeneous BGK model with constant , conserved velocity moments fix , and . The parameter is of the order of an effective mean time between collisions rather than an exact universal microscopic collision time.
Work by Bevil R. Conway by Codex 0 Created 2026-10-25 Updated 2026-11-05

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