Brookhaven's proton beam struck stationary beryllium. A two-arm magnetic pair spectrometer measured electron–Positron momenta and directions. Cherenkov detectors, tracking chambers and shower counters rejected the much larger hadron background. Calibration used an electron beam; timing and track matching rejected accidental coincidences. The pair invariant mass distribution showed a narrow excess. Reducing magnet currents left its reconstructed position unchanged; changing target thickness and reversing spectrometer polarity supplied further checks. The unresolved intrinsic width did not mean a zero decay width.^[ref]

The logic of the magnet-current check is especially useful. A real state should retain its reconstructed invariant mass when a calibrated change of magnetic field makes its daughters follow different accepted paths. A feature tied to one detector location or one setting need not do so. This checks a possible instrumental origin; it does not by itself determine the state's quark composition.

EcoRI is a restriction enzyme whose usual recognition sequence is GAATTC. Staggered cleavage produces complementary single-stranded ends.

A restriction digest is cleavage of DNA using a restriction enzyme. Complete cutting at all specified sites and partial cutting can give different fragment patterns.

Gamboge is a yellow gum-resin material obtained from certain plants and historically used as a pigment. It contains a mixture of organic constituents rather than one pure yellow molecule.

Its color and interaction with a binder depend on that composition and on particle dispersion. Distinguishing a natural colorant material from an isolated chemical compound is important when interpreting historical pigment descriptions.

Let an observer move towards the centre of a small distant source with velocity $\beta c$, where $c$ is the speed of light. For source-direction angle $\theta$, the photon arrives with longitudinal momentum $-E\cos \theta /c$. A Lorentz transformation gives $E^{\prime }=\gamma E(1+\beta \cos \theta )$ and therefore the relativistic aberration lawwhere $\eta =\mathrm{artanh}\beta$ is the rapidity. For a small angular diameter $\Theta$, the displayed angular-size ratio follows by linearizing at $\theta =0$. Two momentarily coincident observers can consequently measure different angular sizes without any change in their observation event. If their diameter ratio is $q\ge 1$, their relative speed is $c(q^2-1)/(q^2+1)$.

Stipulate a constant relative volatility $\alpha =2$. The vapor-liquid equilibrium model then becomesAn initial liquid mole fraction $x_0=3/10$ gives an equilibrium vapor mole fraction $y_0=6/13\approx 0.461538$. Now imagine completely condensing a small sample of that vapor and using this condensate as a fresh liquid for another equilibration. Repeating this formal operation givesThese are original model calculations of ideal-stage enrichment. They are not measured compositions, a reflux design, or successive compositions of one pot undergoing simple distillation. That pot loses the more volatile component and becomes depleted; each step here instead starts from the previous enriched condensate. The displayed sequence specifies compositions, not the recoverable amount at each step.

The algebra makes the enrichment especially transparent. With composition odds $r_n=x_n/(1-x_n)$, every formal step doubles the odds, soFor every finite $n$, $x_n<1$, although $x_n\to 1$ as $n\to \infty$. This explains why repeated ideal equilibration can improve composition without making finite-step perfect separation a consequence of the model.

An inertial force is an additional term used to express Newton's second law in an accelerating reference frame. For origin acceleration $\mathbf{A}$ and axes with angular velocity $\mathbf{\Omega }$, the apparent force on a particle isHere $\mathbf{r}$ and ${\mathbf{v}}^{\prime }$ are measured relative to that frame. The rotation terms are the Coriolis force, Euler force and centrifugal force. Their values depend on the frame rather than on an additional physical interaction.

An electron donor supplies electrons to an electron acceptor in a redox conversion.

An invocation made by a recursive procedure of itself, directly or through another procedure. Each invocation has its own arguments and local variables; a returning invocation supplies an output to its caller.

A case answered without further recursive calls. Complete base cases are one part of an algorithm termination argument; the other cases must progress in a well-founded relation.

A base case and a decreasing natural number measure work together. Check that every invocation satisfies its precondition, each base case finishes with the correct output, and every other invocation makes finitely many recursive calls with strictly smaller measure. All local work must also terminate. By well-founded induction, the children finish, so their caller finishes; if their answers are correct and the combination rule preserves the postcondition, the caller is correct too. This proves total correctness, not just correctness conditional on return.

Strict decrease without a lower bound is insufficient: subtracting one forever from a negative integer never reaches zero. Even a positive real-valued measure can decrease indefinitely, as $1,1/2,1/4,\dots$ shows. A well-founded relation rules out that descent. In structural recursion, a proper child subtree of a finite binary tree supplies progress without numeric arguments. The proof obligation is the relation between parent and child instances, together with terminating local work and complete base cases.

Keep an array $A$ unchanged, and sum entries in the half-open integer interval of array indices $[l,r)$. The precondition requires integers $0\le l\le r\le \mathrm{length}(A)$ and exact, terminating integer addition. An empty range returns the empty sum zero; a one-entry range returns that entry. Every longer range splits at its middle array index:For the original array $A=[6,-2,5,1]$, call $S(A,0,4)$. The left half returns $6+(-2)=4$, the right half returns $5+1=6$, and the original invocation returns $4+6=10$. The right half's left endpoint increases from zero to two: what decreases is range length $r-l$, not every argument. Negative entries affect the answer but do not affect algorithm termination.

For range length $n=r-l\ge 2$, the children have lengths $\lfloor n/2\rfloor$ and $\lceil n/2\rceil$, both positive and strictly less than $n$. The floor function chooses the split; the ceiling function gives the other length. Algorithm termination follows by this natural number measure. For algorithm correctness, apply mathematical induction on $n$: the two base cases return the specified sum; for a larger range, the two disjoint child ranges cover every original array index exactly once, so addition of their correct sums gives the required sum.

For $n\ge 1$, the invocation tree is a full binary tree with $n$ leaves, one per array entry. If $I$ is its number of nonleaf vertices, counting edges gives $2I=I+n-1$, so $I=n-1$. Thus the total invocation count is $2n-1$, and there are $n-1$ combining additions. Here $n=4$ gives seven calls and three combining additions. For $n=1$, there is one call and no combining addition; for $n=0$, there is also one call and no combining addition, but no entry leaf, so the $2n-1$ formula does not apply.

The call stack holds the active branch, rather than the entire invocation tree. Execute the left child completely before the right child, retaining the left result in the parent stack frame. The maximum number of active stack frames is $1+\lceil {\log }_{2}n\rceil$ for $n\ge 1$, and one for $n=0$. Balanced splitting therefore needs $O(\log n)$ frames for $n\ge 2$, compared with the $O(n)$ frames of the factorial recursive process. Assuming constant-cost array access, index operations and addition, its time complexity is $O(n)$ and its auxiliary space complexity is $O(\log n)$ machine words for $n\ge 2$, excluding the stored input. Pass the same array with different endpoints, rather than copying slices. These bounds require all stored indices and partial sums to fit in a constant number of machine words; exact unbounded integer addition and storage require a separate bit cost analysis.

For a natural number $n$, the factorial satisfies $0!=1$ and $n!=n(n-1)!$ for $n\ge 1$. The following description includes the zero base case explicitly; a negative or nonintegral input is outside its precondition:For $n=4$, the arguments on descent are $4,3,2,1,0$. Each positive-argument invocation postpones one multiplication until its recursive call returns. At the deepest point, the call stack has five stack frames: four suspended callers and the active zero base case. The invocation at zero returns $1$ to the invocation at one, rather than finishing the entire computation. Returns then giveA stack frame retains the caller's argument and where to resume. When the invocation at three receives $2$, it uses its own $n=3$, obtains $6$, and returns that value to the invocation at four. The recursive calls share a definition, but their local variables belong to separate invocations.

The natural number measure $n$ decreases by one on every recursive call, so algorithm termination follows. For algorithm correctness, use mathematical induction: the zero base case returns $0!=1$; assuming the child's answer is $(n-1)!$, the caller returns $n(n-1)!=n!$. This also explains why keeping the caller's $n$ matters.

There are exactly $n+1$ invocations and $n$ multiplications, including one invocation and no multiplications when $n=0$. Ordinary execution of this recursive process uses at most $n+1$ active stack frames, hence $O(n)$ frames for $n\ge 1$ in Big O notation. If each test, call, subtraction and multiplication is counted as constant cost, its time complexity is $O(n)$. That is an arithmetic-operation model: exact arbitrary-length integer multiplication has growing cost, and neither the factorial output nor every stack frame's numeric contents occupies a universally fixed number of bits.

A computation that retains pending operations while further calls run, then completes those operations as results return. A recursive procedure can instead describe an iterative process: passing an updated accumulator onward may leave no arithmetic pending. Avoiding growing call stack storage in that case depends on the implementation. A fixed number of variables also does not imply fixed storage in bits when their integer values grow.^[ref]

A procedure whose definition invokes itself directly or indirectly. This is a property of its programming language syntax. It does not determine whether execution accumulates unfinished operations.^[ref]

Section of Random: Probability, Mathematical Statistics, Stochastic Processes by Kyle Siegrist by Kyle Siegrist. No separate section byline or publication date is established.

Online text: www.randomservices.org/random/special/Arcsine.html

By Kyle Siegrist.

Online text: www.randomservices.org/random/special/Rayleigh.html

Section of Random: Probability, Mathematical Statistics, Stochastic Processes by Kyle Siegrist, authored by Kyle Siegrist. Random Services hosts the text. No separately credited section author or publication or revision date is established.

Online text: www.randomservices.org/random/bernoulli/Geometric.html

Cited passages: Basic Theory, Definitions; Distribution Functions and the Memoryless Property; Moments.

Section of Random: Probability, Mathematical Statistics, Stochastic Processes by Kyle Siegrist. Whole-textbook author: Kyle Siegrist; no separate chapter byline is established. Random Services hosts the online text. No publication or revision date is established.

Online text: www.randomservices.org/random/special/Pareto.html

Cited passages: The General Pareto Distribution, Distribution Functions and Moments; Related Distributions, right-tail conditioning and exponential transformation. The section’s $a,b$ parameters must be matched to the shape and minimum conventions used in each application.