Using and the electrostatic Poisson equation, , integration by parts gives
The boundary potential is zero, so the surface term vanishes. Hence .
For the capacitor use the usual parallel-plate approximation, neglecting edge fields. The two gaps have widths and , and their field magnitudes are and . The field-energy expression gives
The two faces of the middle plate carry charges and . Its total charge is their sum; the grounded plates have zero potential and contribute zero to . The charge-potential expression therefore gives , exactly the same result. Since is largest at , the energy at fixed is minimized when the middle plate is centered, with value .
This is the electrostatic energy of a three-plate capacitor in the intended uniform-field model. Finite circular plates have fringing corrections; no small-gap-to-radius ratio is explicitly stated in the source, so the simple formula should not be described as an exact finite-disc solution.
The fixed-end wave equation has spatial modes and temporal factors . The zero initial velocity removes every temporal sine term. Expand the initial displacement in a Fourier sine series, whose coefficients are
Two integrations by parts give the last equality; the endpoint terms from vanish and the remaining derivative endpoints distinguish even from odd . Consequently
This solves the initial-boundary problem in the finite-energy sense, with convergent first-derivative series. At the energy in the question is . At any time, sine/cosine orthogonality gives the contribution of mode as : its kinetic and elastic pieces have factors and summing to one. Therefore
The square summability of the derivative coefficients justifies the orthogonality calculation and its limit.
Let . Its only possible finite poles are the distinct nonreal roots , and the residue of there is ; this is zero if the numerator cancels that pole. Close the real segment by a positively oriented semicircle in the upper half-plane, where decays.
For sufficiently large radius , all roots lie strictly inside or outside the contour as appropriate, and the degree bound gives uniformly on the arc. Parametrizing by bounds the arc integral by
Here on , and symmetry handles the other half. The residue theorem therefore gives
To justify that this is the ordinary improper integral rather than just its symmetric principal value, note and . On either tail, integration by parts writes the integral as a vanishing endpoint term minus an absolutely convergent integral involving . Thus both one-sided limits exist. When the degree bound is stricter the original integral is already absolutely convergent. This proves the Fourier integral of a rational function with simple nonreal poles formula with all tail and arc limits accounted for.
A norm is nonnegative with exactly when , satisfies , and obeys . The Euclidean norm has positivity and absolute homogeneity immediately. For the triangle inequality, positivity of for all real gives the Cauchy-Schwarz inequality (with immediate). Hence
which proves the triangle inequality after taking square roots.
For the prescribed set, use the Minkowski functional
Since is open and contains zero, some Euclidean ball of radius lies inside it. Since it is bounded, it lies inside a ball of radius . These inclusions imply , so the functional is finite and positive for nonzero ; it is zero at zero. Symmetry gives , and substitution in the infimum gives for , hence absolute homogeneity for all real scalars.
Convexity and imply for . Consequently, for and , one has . Convexity then gives
so . Letting and proves the triangle inequality.
Finally, if , there is a with . Conversely, if and , openness permits for some , so ; zero is immediate. Thus , completing the norm from a bounded symmetric convex neighbourhood construction.
In the upper half-plane model, a hyperbolic line is either a vertical line or a Euclidean semicircle perpendicular to the real axis. For the vertical line , set . For the circle with real , set
The vertical formula preserves and Euclidean speed. For the circular formula, , while its local Euclidean length multiplier is . Thus both preserve , the hyperbolic metric, and consequently all curve lengths and distances. Each is an involution preserving the half-plane; each fixes its specified line pointwise and moves points off that line. This establishes the required hyperbolic reflection explicitly.
To factor an arbitrary isometry , first recall why a bisector reflection exchanges any distinct points . The hyperbolic distance formula is
Equating the distances to and yields a vertical line or a circle with centre on the real axis, hence a hyperbolic line. Substitution in the reflection formulas above shows that its reflection exchanges and . Choose a base point . If , compose on the left with their bisector reflection, obtaining that fixes ; otherwise take .
Choose . The points have the same distance from , so their bisector contains . If they differ, its reflection corrects while retaining . We obtain an isometry fixing both after at most two reflections.
An isometry fixing two points is either the identity or reflection in their joining line. To see this directly, a point with prescribed distances from lies at the intersection of two hyperbolic circles; these are Euclidean circles in this model and have at most two intersections. When there are two, reflection in the line interchanges them. Pick a third point off that line. Either fixes it, or composing with that line reflection fixes it. An isometry fixing three noncollinear points is the identity: the first two distances leave only the reflected pair, and the distance to the third point distinguishes that pair. Thus is the identity or one additional reflection. Reversing the compositions proves every isometry is a product of at most three hyperbolic reflections.
The Fundamental theorem of finitely generated abelian groups states that every such group is isomorphic to
with uniquely determined rank and invariant factors, allowing an empty finite part. Modulo , the free summand contributes . If for some prime, this forces , so is finite. Conversely, if is finite, choose a prime coprime to . Bezout's identity gives an integer with . Since kills every element, multiplication by is onto, with inverse multiplication by . Hence . This proves under finite generation.
For the requested nonzero example use the additive divisible group . Each rational equals , so for every prime. It is not finitely generated: a finite list of rational generators has a common denominator , and every integral combination then lies in . The rational does not lie there. This proves non-finite-generation directly and shows why the hypothesis in finite generation detected by a prime quotient is essential.
Both candidate sets contain zero. The sum of subspaces is closed under linear combinations because , with the two terms in and . The intersection is closed because any linear combination of vectors lying in both subspaces still lies in both. Thus each is a vector subspace.
Take a basis of the intersection, extend it by to a basis of , and by to a basis of . The combined list spans . To prove independence, a zero combination makes the combination equal a vector in both and , so it is a combination of the 's. Independence of the basis of makes all coefficients zero; independence of the basis of then makes all remaining coefficients zero. Hence , giving the dimension formula for a sum of subspaces
For the concrete kernels, the equations give
Applying the two rows of to this expression gives and . Thus the intersection has basis . Choose in and in . Then
Indeed has dimension two because has rank two, and are independent. Likewise has dimension two and are independent, so the last list spans the sum. Its first three coordinates have determinant , confirming independence and dimension three.
Assume independent samples and , each consisting of independent normal random variables, with respective means and a common unknown variance . Take . Normality, independence and equal variances are the assumptions giving the exact pooled Student's t-test; unequal variances would require a different test. We test against an unrestricted difference.
Put and
The normal likelihood is proportional to , where is the residual sum of squares. Under the unrestricted model, the maximizing means are and . Under , the maximizing common mean is and decomposition about the sample means gives . For either model, maximizing over variance gives . Thus the generalized likelihood-ratio test statistic is
Small is therefore equivalent to large .
Under the null, is standard normal. In each sample an orthogonal change of Gaussian coordinates separates the sample-mean coordinate from the centered residual coordinates; those coordinates are independent. Consequently has a chi-squared distribution with degrees of freedom and is independent of . Therefore has the Student's t-distribution with degrees of freedom. At significance level , reject exactly when , the two-sample pooled t-test.
Use a translating accelerated reference frame; its axes do not rotate. If is the block's position relative to the table, then its inertial position is . Its relative velocity is and its inertial acceleration is . Let be the upward normal force. During contact , and the linear tangential resistance gives
These are Newton's second law transformed to the table's reference frame; the extra terms arise from the table's acceleration. The last equation gives while contact persists. If contact is lost, both the contact resistance and vanish, and free flight must be described by the corresponding gravity-only equations.
For , assume and put . Seek a periodic particular solution . Substitution into the first differential equation gives
Solving yields
The homogeneous solutions are a constant and a multiple of . Choose the phase with . Then and , so
Also . The decaying transients leave the stated steady orbit. Positive damping is essential to this late-time assertion; for an additional constant drift may persist.
No attractive contact force is available, so cannot be negative. Over a whole oscillation its minimum is . Thus strictly positive contact loading throughout requires , or the printed form with taken as a nonnegative vertical amplitude. If , contact cannot persist: it would require during part of the cycle. At equality, vanishes only at isolated instants and the ideal constrained motion can still remain in contact. Hence the strict inequality characterizes positive loading; mere nonnegative contact permits the marginal equality case.
For each , the product is precisely outside every , and is otherwise. It is therefore the indicator function of . Expanding the finite product gives
Multiply by and sum over the finite set . The product of indicator functions is the indicator function of the corresponding intersection, so
Here the empty intersection is , and the empty product is . Grouping the subsets by their cardinality gives the requested weighted inclusion-exclusion principle, with no contribution for .
Let be the finite set of distinct prime factors of , and work in . For put , including . Then , and an integer belongs to every for exactly when it is a multiple of . Thus the intersection has size . The complement consists precisely of the residues coprime to . Using weight gives
This proves the product formula for the Euler totient function without requiring to be squarefree.
For the weight , the sum over the multiples of any divisor in this interval is
The weighted inclusion-exclusion principle therefore gives
Since , is nonempty and the last sum is . The first factors as before, giving
This sum of reduced residues also follows by pairing the bijection ; at its sole fixed residue causes no problem because the sum of both copies still equals .
The binomial polynomial equals when . For , it has value if and value zero otherwise. These are integers. If , then
Hence each is an integer-valued polynomial on all of , including negative arguments.
For , factor the common product in the two polynomials:
For the common product is empty and equals , so this argument also covers that boundary case.
The polynomial has polynomial degree and leading coefficient . For a polynomial of polynomial degree with leading coefficient , subtract ; the remainder has smaller polynomial degree. Repeating gives the required expansion with rational numbers . For uniqueness, suppose two expansions differ and let be the largest index with different coefficients. Their difference then has a nonzero term of polynomial degree , with leading coefficient equal to that coefficient difference divided by . It cannot be the zero polynomial. Thus the expansion is unique.
Replacing by in the earlier identity gives for , while . By linearity of the forward difference operator,
An empty sum is zero when . If were nonconstant, with polynomial degree and leading coefficient , then would have polynomial degree and leading coefficient . Therefore forces to be constant.
There is a direct way to recover every coefficient. Since and for , repeated application of the forward difference operator gives
The last equality follows by expanding , where ; the commuting shifts obey the binomial theorem. If is an integer-valued polynomial, every summand on the right is an integer, proving that all are integers. Together with the first paragraph this gives both directions of the Newton series for an integer-valued polynomial sequence description.
For a prime number and an integer coprime to , multiplication by permutes the nonzero residue classes modulo . Indeed, implies , and none of the products is zero. Taking the product over the classes gives
The factorial is coprime to and can be cancelled, proving Fermat little theorem: .
Now and is coprime to , so it is coprime to . Since , the proved theorem gives
Thus the two specified integer congruences modulo are equivalent. In this particular step the additional hypothesis is not needed; it will hold for the squarefree factorization used next.
If is a squarefree integer, its distinct prime factors are pairwise coprime. Consequently divides exactly when every prime factor does. Applying the preceding equivalence with proves
Finally retain this squarefree hypothesis. If divides , write . Fermat little theorem gives for every prime factor. Their pairwise coprimality then gives . For composite this is the sufficient direction of the Korselt criterion for a Carmichael number; primality is not excluded by the requested implication.
Number the natural numbers from one. If the power set could be enumerated as , form . For each , membership of in is opposite to its membership in , so . This contradicts completeness of the enumeration. Thus the Cantor diagonal argument proves that the power set is an uncountable set.
For a finite subset , define . This is a nonnegative integer and the map is injective: if two finite subsets differ, let be their largest differing element. Its contribution exceeds the sum of all smaller possible contributions, so their codes differ. There are infinitely many singleton subsets. Hence the countability of finite subsets of a countable set here is countable infinitude.
To treat all bijections, associate to every subset the permutation that swaps and when , and fixes both when . These disjoint pair swaps define a bijection of . Different subsets give different permutations, so the map from the power set into is injective. Therefore is an uncountable set.
Every finitely supported permutation fixes all elements above some . A bijection fixing that tail must permute : it cannot send a smaller element into the fixed tail without violating injectivity. There are exactly such permutations. Thus
is a countable union of finite sets. Enumerate first by , then by one of the finitely many permutations at that ; duplicates can be omitted. Infinitely many distinct pair swaps belong to , so is countably infinite. The full family is uncountable, while the finitely supported family is countably infinite.
Let measure height above the release point, and use for the bubble volume to avoid confusing it with a speed. For constant radius, Newton's second law, the specified buoyancy and the given Stokes law give
With positive , define
The differential equation becomes . Its solution with is . Integration using yields
An arbitrary initial height is added to this expression. The effective inertia changes the relaxation time , but not the terminal velocity obtained by balancing buoyancy and drag.
For the dissolving bubble assume and use the specified instantaneous terminal velocity, rather than the constant-radius transient formula. The bubble disappears at , and
Its total rise is therefore . This second model neglects the initial acceleration and uses exactly the terminal-speed approximation stipulated for the shrinking bubble.
Choose the positive direction along the incoming car's velocity. Treat each car as a translating body, take , and neglect external impulse, rotation and energy losses during the short elastic collision. If are the final signed velocities, conservation of momentum and conservation of energy give
Factoring the second relation and using the first gives on the collision branch. The other algebraic branch, , describes no impulse and cannot describe separating bodies after contact. Solving the collision branch yields
For the first car rebounds and the second moves forwards. At the first stops and the second takes its original velocity. For both move forwards, with , so they separate. In the limits and , the first car's velocity approaches and , respectively.
For the deformable car, take at first contact. The resisting force does negative work. The work-energy theorem therefore gives
At the first stop , whence . The speed bound ensures that this right-hand side is positive, so squaring introduces no extraneous solution. The stopping compression is
For this lies strictly between and , as required before complete crushing. The coefficient in the stipulated force law is taken in its stated normalization.
For the odd-square sum, the initial case gives . Assume the formula at . Adding the next square gives
The initial case and this induction step prove for every positive integer .
For the divisibility assertion, . The change when is replaced by is
One of the consecutive integers is even, so the displayed change is divisible by . If is divisible by , its successor is too. Thus induction proves for every .

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