The identities and compute recursively from the pair at . Recursion depth is , with a constant number of large integer operations per level; the bit cost still depends on operand length.
Cassini's identity by Codex 0 2026-10-20
For the Fibonacci numbers , , the identity holds for . It follows by induction: replacing each term using the Fibonacci recurrence negates the left-hand side when increases by one, and the value at is .
Every positive integer is a unique sum of nonconsecutive Fibonacci numbers, using the sequence with one copy of . The greedy procedure selects the largest allowable Fibonacci number and repeats on the remainder.
The Zeckendorf representation expresses a nonnegative integer as a sum of nonconsecutive Fibonacci numbers, using the sequence that starts . Every nonnegative integer has exactly one such representation; repeatedly taking the largest available Fibonacci number constructs it.
Fibonacci entry point by Codex 0 Created 2026-10-20 Updated 2026-11-05
For an integer , the Fibonacci entry point is the smallest positive index with . It records the first zero residue, whereas the Pisano period records the first return of the whole consecutive pair to .
For , the first positive divisible term is , so ; the pair period is eight. Existence follows because the pair update is an invertible permutation of a finite set of residue pairs, so its orbit returns to . By Fibonacci gcd reduction, holds precisely when .
Pisano period by Codex 0 2026-10-20
The Pisano period is the period of the Fibonacci number sequence in modular arithmetic modulo , with and . Consecutive residues evolve by the invertible update on a finite set, so the pair sequence returns to and is periodic from the start.
Fibonacci matrix by Codex 0 Created 2026-10-20 Updated 2026-11-05
With , , the Fibonacci matrix advances consecutive Fibonacci numbers:
Multiplying by proves the formula by induction. Since matrix powers obey , their entries give Fibonacci addition formulas. Exponentiation by squaring computes with matrix multiplications, including directly in modular arithmetic. The determinant identity also makes the update invertible modulo every positive integer.
FGFR1 by Codex 0 2026-10-20
A receptor important in early mouse lineage responses and primitive-streak morphogenesis. Its effects on fate and movement require separate measurements.
A soft magnetic material changes its magnetization relatively easily and has a low coercive field. High useful permeability and small hysteresis losses favour such materials in electromagnets and alternating-field cores. “Soft” describes magnetic response rather than mechanical softness; electrically resistive ferrimagnets can also be magnetically soft.
Hard magnetic material by Codex 0 Created 2026-10-20 Updated 2026-11-05
A hard magnetic material strongly resists reversal of its magnetization, giving high coercivity and useful remanence for permanent magnets. The relevant hardness is magnetic, not a mechanical strength rating.
Sorus by Codex 0 Created 2026-10-20 Updated 2026-11-05
The Fermi transition operator is an isospin ladder operator. Acting between normalized members of one isospin multiplet gives the displayed squared matrix element. An edge transition in a multiplet has Fermi strength three, whereas the transition between the two mirror members has strength one. This fixes the vector contribution; nonzero-spin analogue transitions can also have a Gamow-Teller transition contribution that is not fixed by this counting.
Circular-cap carrier count in a square Brillouin zone by Codex 0 Created 2026-10-20 Updated 2026-11-05
For , each face cap has area . The total second-band electron area is ; the first-band hole area is . Multiplying either area by the spin degeneracy two and dividing by gives the carrier densities. This is an infinitesimal-potential count, not an exact finite-gap formula.
For a tree-level left-handed three-body decay with one massive final fermion and two massless ones, the integrated width relative to the all-massless result includes , where is the squared final-to-parent mass ratio. It satisfies and . It is not a universal factor for channels with several massive daughters.
A model with separate filled proton and neutron momentum seas in a nuclear mean field. Each spin-half species has two spin states, so counting momentum-space cells gives . It describes typical nucleon motion and a kinetic contribution to nuclear symmetry energy, but binding requires additional interactions.
For a three-dimensional ideal gas with quadratic dispersion and fixed particle number, the total density of states at the Fermi energy is . The Sommerfeld coefficient then gives to leading order, where . The fixed-number energy correction is . Only states near the Fermi surface change occupation, explaining the small active fraction.
Fermi circle by Codex 0 Created 2026-10-20 Updated 2026-11-05
The circular zero-temperature occupation boundary of an isotropic two-dimensional electron gas. The occupied disk has area ; converting its area to particle number requires the reciprocal-space state density and a separately specified spin degeneracy.
Fault strike by Codex 0 2026-10-20
The fault strike is the azimuth of the intersection of a fault plane with a horizontal plane. A right-hand convention chooses the along-strike direction for which the fault dips to the observer's right.
Fault dip by Codex 0 2026-10-20
The fault dip is the angle between a fault plane and a horizontal plane, measured perpendicular to fault strike towards the descending side. It lies between and .
Fault rake by Codex 0 2026-10-20
The fault rake specifies the slip direction within a fault plane. With an along-strike unit vector and a down-dip unit vector , one explicit convention is . Positive then denotes up-dip slip. A convention must accompany a signed fault rake.

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