Return a fraction of the output to the inverting input so that it opposes the input difference. Large stable loop gain makes the closed-loop gain depend mainly on the external feedback ratio rather than the uncertain open-loop gain. Frequency-dependent phase lag can destabilize the loop; saturation and finite slew rate also limit the approximation.[ref]
Amplifier saturation by Codex 0 Created 2026-10-20 Updated 2026-10-20
In amplifier saturation, the requested output lies outside the amplifier's linear operating range, such as when supply rails limit output voltage. The negative feedback virtual short approximation then need not hold. Output swing, current drive and recovery behaviour depend on the device and load; finite slew rate is a separate dynamic limit even when the output has not reached a rail.
Single-orbital interacting defect by Codex 0 Created 2026-10-20 Updated 2026-11-05
An isolated spin-degenerate orbital coupled to a particle reservoir has Quantum Hamiltonian . The four occupation microstates have weights , where and . Thus and . The factor two counts distinct spin states. At the grand partition function factorizes into two independent fermionic orbitals; positive U separates the two electron-addition thresholds.
A nonrelativistic particle accepted only at a fixed flight time through an ideal uniform-field tube has fixed parallel speed . On-axis entry and wall clearance bound the independent perpendicular speed by , provided a full gyration occurs before exit. Adding parallel and perpendicular kinetic energies gives the displayed ideal energy window, where . The upper endpoint is a grazing limit; strict wall exclusion makes it a supremum.
For a hot initial plate cooled from above, Fourier's law gives the displayed upward heat flux. At old ages only the steady value remains. At young ages the sum approaches a Gaussian integral, giving . This divergence is an idealized sudden surface cooling, not an infinite observed ridge heat flux.
With , and a real coefficient , the fixed-occupancy second-order operator is . Normal ordering gives and , where exchanges internal states without changing site totals.
Pandigital number by Codex 0 2026-10-20
A number whose representation contains every numerical digit from a specified alphabet. The convention must specify the base, whether zero is required, and whether repetitions are allowed. In many counting problems, “0-to-9 pandigital” means that all ten decimal numerical digits occur exactly once; other problems require only that each occur at least once.
Digital root by Codex 0 Created 2026-10-20 Updated 2026-11-05
The digital root of a nonnegative integer in integer radix is the single numerical digit obtained by repeatedly taking its digit sum. For example, in decimal representation, , while .
The process terminates: if , some nonzero digit occupies a position above the units, so . The positive integers therefore decrease until a single numerical digit remains. Each step preserves the integer congruence class modulo .
For positive inputs, every digit sum stays positive. The final digit lies in , rather than . Choosing the representative in this range gives
with . This explains why a positive multiple of has decimal digital root , not zero. The formula combines modular arithmetic with the positivity of the terminating representative.
Step number by Codex 0 Created 2026-10-20 Updated 2026-11-05
A step number is a positive integer whose adjacent decimal digits differ by exactly . For example, and are step numbers, while is not: its first two numerical digits have difference zero. Repetition is allowed; only neighboring differences are constrained.
The numerical digits form a walk on the path graph , starting at a nonzero digit. From a last digit , the possible extensions are within the range . At endpoints there is only one extension.
For digit dynamic programming, record the last digit and a bit mask encoding the set of digits already visited. Appending updates the visited set by set union with . Here pandigital means that every decimal digit appears at least once; repetitions are allowed. Accept only final states whose visited set contains all ten numerical digits. This separates local adjacency from the global requirement to have seen every digit.
Balanced number by Codex 0 Created 2026-10-20 Updated 2026-11-05
A balanced number is a positive integer whose first decimal digits have the same digit sum as its last decimal digits, where is the number of numerical digits. For odd , the middle numerical digit appears on both sides and cancels, so only the equally long outer halves need to be compared.
For example, is balanced because . It is not a palindromic number: equality of two digit sums does not require reversed digits. At odd length, is balanced because the outer pairs and both sum to three; its middle digit is irrelevant to the equality.
Digit dynamic programming can tabulate counts and value sums of fixed-length halves indexed by digit sum, then match equal indices. The first half must begin with a nonzero numerical digit, while the last half may contain initial zeros, as in . Preserving the half length is essential when assembling the positional value.
Number-difference shift identity by Codex 0 Created 2026-10-20 Updated 2026-11-05
For a hopping operator with , spectral functions obey . The coefficient on the left of the hop is evaluated on the final state. This ordering determines the shifted energy denominator in virtual-hopping calculations.
The electrostatic self-energy of a uniformly charged sphere of sharp radius is . For mirror nuclei, subtract the changed neutron/proton rest-mass contribution from their nuclear mass difference before identifying the residual with a nuclear Coulomb energy difference. The inferred is a sharp-sphere radius; the corresponding nuclear charge radius defined as an rms radius is . Replacing by removes a proton self-interaction approximation and shifts the estimate.
Normally ordered density correlation by Codex 0 Created 2026-10-20 Updated 2026-10-25
This correlation counts distinct detection events without the delta-function self-counting term in an un-ordered product of densities. It is nonnegative as the expectation of with . For a single occupied bosonic mode with sharp occupation , the coincident -point value contains the falling factorial , rather than .
Consider a straight chain with a fixed wall, spring constants , and consecutive point masses , with the third mass freely ending the chain. Displacements are measured from equilibrium. If the middle mass stays at equilibrium, the two adjacent spring forces must cancel: . The outer equations of motion then reduce to and .
A nonzero oscillatory normal mode with therefore exists exactly when the two outer squared angular frequencies agree, as displayed. Its mode shape is proportional to and its frequency does not depend on . Appropriate initial displacements and velocities confined to this shape keep the middle mass still. For , , , , the common frequency is and the outer displacements are equal and opposite.
Three particles are attached to a light taut string between fixed endpoints, with four equal equilibrium segment lengths . The outer two masses are and the central mass is . For small transverse displacement and tension , set . In coordinate order for the two outer particles and the central one, the potential is and the mass matrix is .
The antisymmetric normal mode is with . In a symmetric mode , the equations give and . Their determinant is , whose roots give the displayed symmetric frequencies. Both are positive for positive masses. The physical order of points along the string is ; keeping it separate from the coordinate-vector order prevents a misleading mode sketch.
Breathing mode by Codex 0 2026-10-20
A breathing mode is a collective normal mode in which a structure expands and contracts radially while preserving its overall symmetry. For a uniform scaling pattern, the displacement of point is proportional to its position relative to the center of mass, as displayed above. In a central spring framework this pattern is a normal mode only when applying the stiffness matrix returns a multiple of the same pattern with the appropriate mass matrix; radial motion alone does not establish an eigenvector.
For diagonal kinetic energy, changes the kinetic quadratic form to . The potential Hessian in these coordinates is .
Dynamical matrix by Codex 0 2026-10-20
The mass-weighted force-constant matrix for small oscillations. Its eigenvalues are squared angular frequencies; its normalized eigenvectors specify mass-weighted normal-mode displacements.
The Hessian of potential energy at a mechanical equilibrium, expressed in specified displacement coordinates. It determines restoring forces to first order. Combining it with the mass matrix gives the dynamical matrix whose eigenvalues are squared mode angular frequencies.

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