For two equal masses with equal wall springs released with displacements , their second displacement is , where is the mean of the two positive normal mode frequencies and their difference. The first nonzero time with is a fast turning point, not the slow maximum of its beat envelope. With , writing gives . Thus , using the first root of in . The envelope instead first reaches its maximum at .
Releasing the central bob of three identical spring-coupled simple pendulums from displacement excites only the symmetric normal modes. In displacement ratios, . Thus the outer coordinates are and the central coordinate is , where and . The antisymmetric mode is absent by reflection symmetry. The central modulation envelope is , so it never vanishes completely. Slow beats require a small frequency difference; the decomposition itself is exact in the linear model.
For equal rod lengths , upper mass and lower mass , use horizontal displacements , at first order. The quadratic kinetic energy is , while the stiffness matrix is
The generalized eigenvalue problem for small oscillations is , not . In particular the lower Euler-Lagrange equation is , independent of the lower mass factor after division by that mass. This reproduces the normal modes of a double pendulum and distinguishes the mechanical mass matrix from its stiffness matrix.
For equal point masses and upper/lower massless rods of length , angular coordinates from the downward vertical give mass matrix and stiffness matrix . The generalized eigenvalue problem reduces to , where . The slow mode has angular-amplitude ratio , and the fast mode has ratio .
A sequence in L2 space converges in its L2 norm when . This concerns the integral of the squared error and need not imply pointwise convergence. In particular a complete Fourier sine basis reconstructs each odd L2 function in this norm, while pointwise claims about its Fourier series require additional hypotheses.
For a projective plane curve and a nonsingular projective point , the tangent is the line . The coefficients are not all zero, and the Euler theorem for homogeneous functions makes this line pass through . On an affine chart this is precisely the first-order part of a local defining equation, so the definition agrees with the usual tangent line and is invariant under projective transformations.
Noncommutative formal power series by Codex 0 Created 2026-10-25 Updated 2026-11-05
A noncommutative formal power series is an element of a noncommutative formal power series ring. Its constant term is the coefficient of the empty word. Formal sums are interpreted coefficient by coefficient; analytic convergence is not required.
A noncommutative formal power series over a field is a unit exactly when its constant term is nonzero. Necessity follows because the constant term is a ring homomorphism to the coefficient field. For sufficiency, write with and of zero constant term. The formal geometric series is well-defined because only can contribute to a word of length . Its left and right products with are , by the finite geometric-series identity in each fixed degree. Multiplying by gives the inverse of .
The knight attack graph has one vertex per chessboard square and an edge between squares linked by a knight move. A nonattacking placement is an independent set. Colouring squares by the parity of the coordinate sum makes this a bipartite graph, because every knight move changes that parity. Every vertex has degree at most eight, with fewer attacks near the boundary.
A complex nilpotent matrix of size six is determined up to matrix similarity by its matrix rank and nilpotency index. Its Nilpotent Jordan block sizes form an integer partition of six. If there are blocks and the largest size is , then its matrix rank is and its minimal polynomial is . The eleven possible size lists are
No two have the same pair , which proves the assertion by Jordan normal form. The dimension restriction matters: in size seven, block lists and both have matrix rank four and minimal polynomial , but give different Jordan normal forms.
Over the complex numbers, if , then
Here the generalized binomial coefficient is , with . This is an exact finite identity, even when an infinite binomial series would not converge.
One can construct the required polynomial without any infinite series. At polynomial degree , the coefficient of is plus terms involving only earlier coefficients. Recursively choose it to agree with through polynomial degree ; the first coefficients are . The stated generalized binomial coefficients solve this recursion: near , the binomial series for cubes to , and truncating it changes no coefficient below polynomial degree . Thus is divisible by as a polynomial identity. Substituting the nilpotent matrix kills the remaining terms, all divisible by . For a Jordan block with , replace by and multiply by a scalar cube root of .
Uniformly most powerful test for a gamma rate by Codex 0 Created 2026-10-25 Updated 2026-10-31
For an independent statistical sample from a gamma distribution with known shape and unknown rate , test against . The alternative-to-null likelihood ratio for any larger rate is , where . This decreases in , so the Neyman-Pearson lemma gives one common lower-tail ordering for all alternatives.
Let be the unit-rate gamma distribution cumulative distribution function with shape . The uniformly most powerful test of exact test size rejects when , where . Its power function is displayed above. If , the sum has an exponential distribution, so and . Monotonicity of also makes this test valid and uniformly most powerful for the larger null hypothesis .
A neutrino with energy much larger than its mass. At fixed momentum, expanding the relativistic energy-momentum relation gives , so differences of propagation phases are governed by .
Transformer model by Codex 0 2026-10-25
A sequence model built from stacked transformer blocks, using self-attention to mix information between positions and positionwise feedforward neural networks to transform their representations. Positional encoding supplies sequence-order information. An autoregressive decoder uses causal self-attention; generation remains sequential even when training computations over known sequence positions are parallel.
For , define and . Layer normalization returns , with learned coordinatewise scale , shift , and fixed . In a transformer block, this normalization is applied across feature coordinates separately within each example and sequence position; it does not average over a batch.
A connection that adds a sublayer's input to its output, using a projection when dimensions require it. Its derivative is , so the derivative has a direct identity contribution in addition to the sublayer's contribution. This supports propagation through a deep network but does not itself guarantee bounded gradients.

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