The characteristic equation factors as , giving . The superposition principle lets us find particular solutions for the two forcing terms separately. A trial gives and , so it is . A trial gives , so . Therefore
The characteristic equation has the repeated root . Its homogeneous solution is therefore . For a particular solution, try . Substitution gives , so and . Thus the general solution is
The extra factor in the second homogeneous term is required by the repeated root.
The characteristic equation is , giving . The initial conditions give and . Solving yields , , hence
The two distinct characteristic roots supply all solutions of this second-order linear ordinary differential equation.
Subtract the integrands first, using . Then set :
The further integration by substitution makes , so
This also holds at .
Apply the power-complement integral recurrence three times, starting from :
Each factor corresponds to reducing by one; the final unreduced integral is just .
Set , so , and write . The integration by substitution gives . For , integration by parts yields
Both endpoint terms vanish. Use inside the remaining integral:
Consequently
This is the instance of the power-complement integral recurrence, with initial value .
Apply the fundamental theorem of calculus separately to the upper and lower limits. No evaluation of the integral is needed:
The first result has no dependence and the second no dependence, so the mixed partial derivative is
The eigenvector equations give . Multiplying on the left by therefore gives
This is an orthogonal diagonalization: the linear map acts independently by multiplication by its eigenvalues in the new orthonormal basis. The repeated eigenvalue explains the freedom to rotate the last two basis directions.
The entry of is . Hence is an orthogonal matrix, whose matrix inverse equals its transpose:
This obtains the inverse without unnecessary cofactor calculations.
Using the ordered orthonormal basis chosen in (c), the column matrix is
Other signs or another orthonormal choice within the repeated eigenspace are equally valid, provided the same choice is retained in the remaining parts.
The trace is the sum of the eigenvalues, counting multiplicity, while the determinant is their product:
A direct expansion along the middle row checks the latter: .
A vector perpendicular to has the form . Direct matrix multiplication gives
Thus every nonzero such vector is an eigenvector with . The zero vector must be excluded from the literal claim about “any” perpendicular vector, since an eigenvector is nonzero. The eigenspace is two-dimensional. Equivalently, exhibits the spectrum of a scalar matrix plus a rank-one projector.
Solving gives and . A convenient normalized eigenvector is
The displayed nonzero vector proves that four is an eigenvalue. Every nonzero multiple represents the same eigendirection.
The absolute value in the original PDF reflects every negative sine arch upward. The graph is nonnegative, with zeros at for , and it lies below the decaying envelope . On the th arch, differentiation gives a factor proportional to . Thus its unique local maximum is
Successive maximum heights have ratio . At each interior zero the one-sided slopes have opposite signs, producing a corner. The smaller panels below magnify the later arches so that all four remain visible.
Figure 1.
Four positive exponentially damped sine arches, with separate linear-scale enlargements of the later arches
. Details.
The domain of a function is , because the denominator vanishes at zero. Near zero, , so is a vertical asymptote, approached with value from the left and from the right. The horizontal asymptotes are as and as .
Moreover,
Both branches define a strictly decreasing monotone function: the left branch lies below , and the right branch is positive. There are no zeros or vertical-axis intercept.
Figure 1.
The decreasing reciprocal-exponential branches with their three asymptotes
. Details.

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