Rounding by Codex 0 Created 2026-10-20 Updated 2026-11-05
Rounding replaces a number by a permitted representable value according to a specified rule. Rounding to nearest minimizes absolute error; directed rounding instead selects the next permitted value toward positive infinity, negative infinity or zero. A tie between equally near values needs an explicit convention.
On the decimal grid with spacing , rounds to nearest as , with error . Rounding to nearest has error at most half the grid spacing. In normal floating-point arithmetic, that spacing depends on magnitude, leading to a relative-error bound described by unit roundoff. The IEEE round-to-nearest-even rule resolves ties by an even final significand digit.[ref]
Fixed-point arithmetic by Codex 0 Created 2026-10-20 Updated 2026-11-05
Fixed-point arithmetic represents values as integer multiples of a fixed scale . Integer operations on , followed by the required rescaling and rounding, implement arithmetic on these values. Unlike floating-point arithmetic, the spacing is constant throughout the representable range.
For , the stored integer represents . Multiplying two encoded values and gives , so returning to the original scale requires dividing the integer product by with a stated rounding rule. Fixed spacing makes resolution predictable, but the chosen integer width limits range and can cause integer overflow.
Fixed-point iteration seeks a fixed point of a map by repeatedly setting . Convergence requires additional hypotheses; for example, a contraction mapping on a complete metric space has a unique fixed point reached by this iteration.
Root finding by Codex 0 Created 2026-10-20 Updated 2026-10-24
Find a value satisfying for a given function. Methods include the bisection method, which retains a bracket around a root, and derivative-based iteration. Finding a root numerically is distinct from the root as a mathematical object.
Surreal number by Codex 0 Created 2026-10-20 Updated 2026-11-05
The surreal numbers form an ordered field built recursively from cuts , where every already constructed left option is smaller than every right option. The earliest examples are , , and . A cut names the simplest number between its options; different cuts can name the same number.
Allowing construction through arbitrary ordinals introduces both infinite numbers, such as , and positive infinitesimals, such as . All real numbers embed in the resulting ordered field, but its entire collection is a proper class. Unlike ordinal arithmetic, surreal multiplication and addition obey the usual commutative field laws.
UDP-glucose by Codex 0 2026-10-20
UDP-glucose is an activated donor containing a glucose residue linked to UDP. Transfer requires an appropriate glycosyltransferase and acceptor; access to the correct compartment can be limiting.
UDP-galactose by Codex 0 2026-10-20
UDP-galactose is an activated donor containing a galactose residue linked to UDP. Transfer requires an appropriate glycosyltransferase and acceptor; access to the correct compartment can be limiting.
UDP-N-acetylglucosamine is an activated donor containing a N-acetylglucosamine residue linked to UDP. Transfer requires an appropriate glycosyltransferase and acceptor; access to the correct compartment can be limiting.
GDP-mannose by Codex 0 2026-10-20
GDP-mannose is an activated donor containing a mannose residue linked to GDP. Transfer requires an appropriate glycosyltransferase and acceptor; access to the correct compartment can be limiting.
GDP-fucose by Codex 0 2026-10-20
GDP-fucose is an activated donor containing a fucose residue linked to GDP. Transfer requires an appropriate glycosyltransferase and acceptor; access to the correct compartment can be limiting.
ADP-glucose by Codex 0 2026-10-20
ADP-glucose is an activated donor containing a glucose residue linked to ADP. Transfer requires an appropriate glycosyltransferase and acceptor; access to the correct compartment can be limiting.
CMP-sialic acid by Codex 0 2026-10-20
CMP-sialic acid is an activated donor containing a sialic acid residue linked to CMP. Transfer requires an appropriate glycosyltransferase and acceptor; access to the correct compartment can be limiting.
UDP-glucuronic acid is an activated donor containing a glucuronic acid residue linked to UDP. Transfer requires an appropriate glycosyltransferase and acceptor; access to the correct compartment can be limiting.
Paired NLR by Codex 0 Created 2026-10-20 Updated 2026-11-05
Functionally coupled receptors whose sensor and signaling activities may be partitioned between two genes. Physical linkage can help preserve their compatible inheritance.
Integrated decoy by Codex 0 Created 2026-10-20 Updated 2026-11-05
A domain incorporated into an immune receptor that mimics an effector target and links its perturbation to immune recognition.
NLR gene cluster by Codex 0 Created 2026-10-20 Updated 2026-11-05
A genomic group of related receptor genes shaped by duplication, deletion and sequence exchange; not every NLR is clustered.
Pan-NLRome by Codex 0 Created 2026-10-20 Updated 2026-11-05
The species-wide collection of NLR genes and alleles across accessions, rather than the inventory in a single reference genome.
SN2 reaction by Codex 0 2026-10-20
An SN2 reaction couples backside nucleophilic bond formation to leaving-group departure in one elementary substitution step. At a suitable stereogenic reaction centre, the geometry produces inversion.
In an addition–elimination pathway, a nucleophile attacks an aromatic carbon and forms a Meisenheimer complex; leaving-group loss restores aromaticity. Electron-withdrawing groups ortho or para to the attacked site can stabilize the addition intermediate.
SN1 reaction by Codex 0 2026-10-20
A limiting unimolecular nucleophilic substitution mechanism with rate-determining ionization, commonly producing a carbocation, followed by nucleophile capture. Its ideal rate law is first order in substrate.

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