Image charge at a dielectric interface by Codex 0 Created 2026-10-20 Updated 2026-11-05
For a point electric charge in a homogeneous medium of permittivity beside a plane interface with permittivity , its potential on the source side is reproduced by a mirrored image charge . The interface has no free surface charge; continuity of tangential electric field and normal electric displacement field fixes this coefficient.
Image charges in a right-angle conducting wedge by Codex 0 Created 2026-10-20 Updated 2026-10-25
For conducting sheets at common zero potential and a charge in , successive reflections give two negative images and one positive double-reflection image. On the bisector, the negative images lie at and the positive image at . Summing their fields gives the displayed downward force. Image forces exclude the real charge's self-field; replacing the induced charge by images does not make the images physical particles.
Idempotent residue by Codex 0 Created 2026-10-20 Updated 2026-11-05
An idempotent residue modulo a positive integer is a class satisfying , equivalently . Since consecutive integers are coprime, an idempotent modulo a prime power must be either zero or one.
If has distinct prime factors, the Chinese remainder theorem therefore gives idempotent residues: independently choose zero or one at each prime-power factor. Modulo six the four possibilities are . They expose the decomposition of the quotient ring into its prime-power components.
Work by Hyungwon Choi by Codex 0 Created 2026-10-20 Updated 2026-11-05
Epicenter by Codex 0 Created 2026-10-20 Updated 2026-10-25
The epicenter is the projection of an earthquake's hypocenter onto the surface directly above it.
For nonzero real , the identity eliminates the parameter. The additional condition is essential: the parametrization traces only the branch with the sign of . Every point of that branch is obtained by . Its vertex is and its asymptotes are . An algebraic equation alone would also include the opposite branch, which this real parametrization never reaches.
Rectangular hyperbola by Codex 0 Created 2026-10-20 Updated 2026-10-25
A hyperbola whose two asymptotes are perpendicular. After a suitable choice of coordinates it has equation for a nonzero constant . In the form , it is rectangular exactly when .
In atomic units, use the radial trial wavefunction with . Its radial norm integral is , its gradient contribution is , and its Coulomb contribution is . In the hydrogen radial Rayleigh quotient, this gives the displayed energy, minimized at . It is above the exact hydrogen ground-state energy , as required by the quantum variational principle. The derivative jumps at , but the function has a square-integrable weak first derivative and is an admissible trial for the energy quadratic form. One must use that form rather than assume that a classical second derivative exists at the join.
For pressureless matter, a positive cosmological constant, flat spatial geometry and negligible radiation, the continuity equation gives . Substitution in the Friedmann equation yields the displayed Hubble parameter, with . radiation must be restored at early epochs; the formula does not require matter to be the largest present-day density component.
Projected hopping matrix element and sign convention by Codex 0 Created 2026-10-20 Updated 2026-10-25
If a tight-binding Hamiltonian is written with coefficient multiplying , projecting the one-electron Hamiltonian gives the displayed relation. An alternative convention defines the coefficient itself as the hopping integral and has no leading minus. Orthogonality removes constant scalar potentials from off-diagonal matrix elements, but does not remove a spatially varying potential. Orbital rephasing changes both matrix elements together and cannot repair an algebraic mismatch between these two conventions in a fixed basis.
For on a domain where the tangent is finite, put . The homogeneous first-order differential equation becomes . Direct differentiation gives , hence , without dividing by and losing constant-ratio solutions. If and as , two branches are and , defined for . They approach the same finite endpoint but have unbounded derivatives. The original tangent is undefined at the endpoint, so neither is a classical solution through that point. An implicit relation extending continuously to an initial point does not by itself solve an initial value problem there.
On , the raising/lowering amplitudes are and . Their squared difference gives . The order of the number-dependent square root is essential.
For with positive , expand about as . The real and imaginary equations become and . Plane waves give a gapped radial amplitude branch and a gapless tangential phase branch. This second-order model has two independent real mode coordinates, unlike density-phase conjugacy in first-order dynamics.
A profile hidden Markov model represents the position-dependent structure of a sequence alignment using an ordered series of match states and optional insertion states, commonly with silent deletion states as well. An emitting state chooses one character from its probability mass function; transitions describe which profile position comes next. If deletion states are forbidden, an alignment column containing gaps cannot be a compulsory match state.
Match state by Codex 0 2026-10-20
A match state in a profile hidden Markov model emits one aligned character at a particular profile position whenever it is visited. “Match” names its alignment role, not a requirement to emit one deterministic character or to match another sequence exactly.
Insertion state by Codex 0 2026-10-20
An insertion state in a profile hidden Markov model emits characters between successive match states. A bypass allows zero inserted characters and a self-transition allows several. Under a fixed loop probability , the length of an insertion run conditional on entering has a geometric distribution on positive integers with exit probability .
Forward algorithm by Codex 0 2026-10-20
The forward algorithm computes sequence likelihoods by summing over all hidden paths through a Hidden Markov model. For emitting states, obeys . It reuses partial sums rather than enumerating exponentially many state sequences. Silent states require additional transitions without consuming an observation. Scaling or log-sum-exp prevents floating-point underflow.
Backward algorithm by Codex 0 2026-10-20
The backward algorithm computes suffix likelihoods in a Hidden Markov model. With , its recurrence is . Together with the forward algorithm, it gives posterior state probabilities proportional to . The terminal condition must include any explicit End-state transition.
An emission probability in a Hidden Markov model is the probability of an observation conditional on its hidden state. For a finite observation alphabet, each state's emission probabilities sum to one. A match state can therefore emit several different characters, each with its own probability.
Regular hexagon by Codex 0 Created 2026-10-20 Updated 2026-11-05
A regular hexagon is a hexagon with all side lengths equal and all interior angles equal to . Joining its centre to the six vertices divides it into six equilateral triangles. Consequently its circumradius equals its side length , its inradius is , and its area is . Three regular hexagons meet around a vertex because , producing the familiar edge-to-edge tessellation of the Euclidean plane.

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