Assume head comparison and construction of one list cell take constant time. In the merge algorithm, every comparison removes one head from the recursive inputs, and evaluation stops as soon as either is empty. For lengths , at most comparisons and the same number of newly constructed cells are required; the untouched suffix is shared. Inputs which keep both lists nonempty until the last comparison attain this bound. Thus
An initially empty input makes this particular implementation constant-time; not every pair requires linear work.
The balanced merge sort spends time per call on list length, splitting and merging. Hence its time complexity satisfies
At each recursion level the lengths of its disjoint subproblems sum to , so the work per level is , and balanced splitting gives levels. Consequently
The length and splitting traversals change the constant factor, not this asymptotic order; repeatedly inserting elements into a sorted list would not give the same complexity.
Split the list into two contiguous halves, sort each recursively, and use the merge algorithm from part (a):
fun mergesort [] = []
  | mergesort [x] = [x]
  | mergesort xs =
      let
        val k = List.length xs div 2
        val left = List.take (xs, k)
        val right = List.drop (xs, k)
      in
        merge (mergesort left, mergesort right)
      end;
List.length counts elements, List.take(xs,k) returns the first elements and List.drop(xs,k) returns the remaining suffix. Since when , both recursive inputs are smaller and differ in length by at most one. Mathematical induction on length proves that each half is sorted without losing elements, and the correctness of the merge algorithm proves the same for the combined result. Contiguous splitting and left-biased equal-key merging preserve the original relative order of equal keys. This is a stable top-down merge sort.
For integer linked lists, compare their heads and copy the smaller head, retaining the other list for the next step:
fun merge ([], ys) = ys
  | merge (xs, []) = xs
  | merge (xs as x :: xt, ys as y :: yt) =
      if x <= y then x :: merge (xt, ys)
      else y :: merge (xs, yt);
This merge algorithm preserves duplicates and chooses the left list on a tie, making it stable when elements have an ordering key. Each recursive step decreases the combined length. For correctness, the chosen head is no greater than either remaining head and therefore no greater than any remaining element; structural induction then proves that the result is ordered and contains exactly the elements of both inputs. For other element types, replace the integer comparison by a supplied ordering function. Merge repeatedly emits the smaller head and reuses the remaining list when the other becomes empty.
Along the holonomic constraint , we have and hence speed squared . The smooth wire's normal reaction is perpendicular to the permitted velocity and does no work. Conservation of mechanical energy, with release from rest at height , gives
The turning points are with . One full oscillation has twice the travel time between them:
Set and . After cancelling the scale factors,
so the bead on a parabolic wire has
For , expand the numerator uniformly on :
The integrable endpoint weight gives and , for example by . Therefore the requested small-oscillation period is
The leading frequency is , and the first finite-amplitude correction increases the period. At the ring is stationary; the expression is the limiting period of nonzero small oscillations.
The relevant parameters are and the ring mass , with dimensions length, length, length/time and mass. The wire is fixed and smooth, so there is no additional friction parameter. Because is the only parameter carrying a mass dimension, it cannot enter a dimensionless group governing the period. Using and as the length and time scales, the independent dimensionless variables are and . Dimensional analysis therefore gives
The physical mass cancellation also follows from the energy equation in part (ii), since kinetic and gravitational potential energy are both proportional to .
The Fermat-Euler theorem states that, for a positive integer and an integer coprime to , , where the Euler totient function counts residue classes coprime to . The case is trivial. For , let be a reduced residue system. Multiplication by permutes it: equality of two resulting residues can be cancelled using the modular inverse of , and the products remain coprime to . Multiplying the residues before and after the permutation gives
Every factor on the right is a unit, so its product can be cancelled. This proves
The integer is prime: none of the primes up to divides it. Therefore . Apply the theorem to and use the supplied congruence:
To connect this to individual digits rather than merely assert periodicity, use long-division remainders and
Induction gives . Since is coprime to , no remainder is zero. The congruence above therefore implies for every , using the unique representative in . In particular
Hence
This is the mechanism of decimal period from multiplicative order: the period divides .
If the prime does not divide , then . The Bezout identity gives integers with . Multiplying by gives . If , both terms on the left are divisible by , so . Thus Euclid lemma holds:
For completeness, existence in the fundamental theorem of arithmetic follows by strong induction on a positive integer . If is prime there is nothing to prove; otherwise with , and the inductive prime factorizations of give one for . The integer has the empty factorization.
For uniqueness, suppose are two prime factorizations. Repeated application of Euclid lemma shows that divides some . Both are primes, so they are equal. Reorder the second list, cancel this equal factor, and repeat. All factors must be matched, including their multiplicities. Thus prime factorization exists and is unique up to the order of its factors. For nonzero negative integers one also records the sign.
Factor the expression as . One of three consecutive integers is divisible by , so . If is odd, its neighbours and are consecutive even integers. One is divisible by and the other by , so their product is divisible by . Since and are coprime integers, their product divides the expression:
The argument also includes negative odd integers and the zero product at .
The Euclidean algorithm gives
Back-substitution supplies the Bezout identity
Thus one solution is . If is any solution, subtraction gives . Since and are coprime, divides . Write ; substitution then gives . Conversely these values satisfy the equation for every integer . Hence all solutions are
Let and . A differentiable central potential energy gives the internal forces
There are no external forces. Differentiating the total kinetic energy and using Newton's second law therefore gives
Since , the last expression is . Thus
This conserves total mechanical energy, including the kinetic energy of centre-of-mass motion, not merely the relative kinetic energy.
Write and , where . The definition of the centre of mass and its derivative give
Expand the total angular momentum:
The two middle terms vanish. Thus the angular momentum decomposition about the centre of mass is
The first term is orbital angular momentum of the centre; the second is angular momentum about the centre of mass.
About a fixed inertial origin, the total angular momentum is . Differentiation gives
because . Separate the external and internal contributions. The combined torque of an internal pair is
The first equality uses Newton's third law, and the second uses the given central-force condition. All internal torques therefore cancel, leaving
An equal-and-opposite pair which is not central need not have zero combined torque; this explains why both internal-force hypotheses matter.
For constant particle masses define the centre of mass by , with . Summing Newton's second law over all particles gives
Each pair of internal forces cancels by Newton's third law. Hence
Only the action-reaction condition is needed for this translation law; centrality of the internal forces is needed for the angular momentum result in part (ii).
Let . Since the field is constant, dotting the equation of motion with eliminates the magnetic term:
This is a harmonic oscillator with frequency . Initially and , because the particle starts at rest. Therefore
The magnetic force modifies the transverse motion but not this projection. The formula also holds trivially when .
Write . The original PDF contains the cross product ; the TeX aid drops its velocity dot. Since , differentiation and the equation of motion give
The radial restoring force contributes no torque. The vector triple-product identity yields
Meanwhile
The derivatives cancel, proving
This is the magnetic axial angular-momentum invariant. Its first term is the negative of the ordinary angular momentum projected on ; retaining that sign is essential.
Dot Newton's second law with . The magnetic cross-product term is perpendicular to this velocity, so
Thus
or
The two halves are the kinetic energy and the isotropic spring's potential energy. The expression in the question is twice their sum. The Lorentz force changes the direction of motion but supplies no power, because it is perpendicular to velocity; this explains why the magnetic field does not appear in the conserved mechanical energy. The sign corresponds to charge .
Assume are continuously differentiable on a neighbourhood of a bounded region with a positively oriented piecewise smooth simple boundary. To prove Green theorem, first take a region between the graphs and , , with . Counterclockwise orientation traverses the lower graph to the right and the upper graph to the left; vertical end pieces contribute nothing to . Thus the fundamental theorem of calculus gives
Likewise, for a region between graphs and , the right boundary is traversed upwards and the left one downwards. Horizontal end pieces contribute nothing to , so
For a polygonal region, triangulate its interior. Each triangle is of both graph types with piecewise linear bounds, so adding the formulae gives the result: the double integrals add and the integrals on internal edges cancel because the adjacent triangles traverse them in opposite directions. For a regular piecewise smooth simple boundary, choose inscribed simple polygonal approximations to its piecewise smooth parametrization. Their line integrals converge to the original line integral, since the parametrizations converge uniformly and their piecewise constant tangent vectors converge in the integral norm on each smooth arc. Their regions converge in area: the symmetric difference lies in a shrinking neighbourhood of the original boundary, which has planar measure zero. Boundedness of the continuous integrand then gives convergence of the area integrals. Passing to the limit proves the formula for the stated boundary class. Combining the two identities gives
Positive orientation is essential for the sign.
Choose and , for which . The boundary formula for planar area is
For the ellipse, take so the given increasing-angle parametrization is counterclockwise. Then and , so
If signed nonzero parameters are allowed, the unsigned area is , with orientation corrected accordingly.
A conservative vector field is the gradient of a single-valued differentiable scalar potential. Its line integral is path independent and equals the potential difference. If with a twice continuously differentiable potential, equality of mixed partial derivatives gives
The product rule then gives . Rearranging proves the integrating-factor equation for a planar vector field:
This argument does not require division by , so it remains valid even at its zeros. A nonvanishing integrating factor is normally sought when one wants to recover useful potential curves for the original field.
Take
The real eigenvalues are one and two, with eigenlines spanned by and respectively. These independent vectors form a real eigenbasis, so is a diagonalizable matrix over . Their inner product is one, and any two nonzero vectors on those eigenlines have nonzero inner product. Rescaling can normalize their lengths but cannot make them orthogonal. Hence no orthonormal eigenbasis exists.
Use
It has independent complex eigenvectors and , with eigenvalues and . Taking these as columns gives an invertible complex matrix with , so is a diagonalizable matrix over . It cannot be diagonalized over , since a real diagonal matrix would have real eigenvalues, whereas similarity preserves the characteristic polynomial.

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