How to Find a Second Linearly Independent Solution for a Repeated Root in a Cauchy-Euler Equation

Have you ever come across a second-order differential equation that looks like this?

x²y″ − 3xy′ + 4y = 0

This is what's called a Cauchy-Euler equation (also known as an equidimensional equation). These are special because they match the pattern:

x²y″ + axy′ + by = 0

and we can solve them with a neat trick—try solutions of the form y = xʳ. But what happens when that method gives us a repeated root? Let's walk through it together!

Step 1: Assume a Power Function

Suppose we guess a solution:

y = xʳ

Then its derivatives are:

  • y′ = r·xr−1
  • y″ = r(r−1)·xr−2

Plug these into the equation:

x²y″ − 3xy′ + 4y = x²·r(r−1)xr−2 − 3x·r xr−1 + 4 xr

Simplify:

xʳ [r(r−1) − 3r + 4] = 0

This gives the characteristic equation:

r² − 4r + 4 = 0 → (r − 2)² = 0

We have a repeated root! r = 2

Wait... Isn't That Only One Solution?

Yes! The solution we get is:

y₁(x) = x²

But second-order differential equations need two linearly independent solutions to form the general solution.

When there's a repeated root, the second solution includes a logarithmic term:

y₂(x) = x² ln(x)

Where did that come from? Let’s find out.

Step 2: Use Reduction of Order

Suppose the second solution looks like:

y₂(x) = v(x) · x²

Differentiate:

  • y₂′ = v′·x² + 2v·x
  • y₂″ = v″·x² + 4v′·x + 2v

Now plug into the original differential equation:

x²y₂″ − 3x y₂′ + 4y₂

After substitution and simplification, the equation becomes:

v″·x⁴ + v′·x³ = 0

Divide by x³ (assuming x ≠ 0):

v″·x + v′ = 0

Step 3: Solve the Simpler Equation

This is now a first-order linear ODE in v′:

Let u = v′ ⇒ x du/dx + u = 0

Separate variables and integrate:

∫du/u = −∫dx/x ⇒ ln|u| = −ln|x| + C ⇒ u = C/x

Then:

v′ = C/x ⇒ v = C ln x + D

Step 4: Get the Final Answer

Now plug back:

y₂(x) = v(x) · x² = (C ln x + D) x²

So the two solutions are:

  • y₁(x) = x²
  • y₂(x) = x² ln x

The general solution is:

y(x) = C₁ x² + C₂ x² ln x

Final Thoughts

The Cauchy-Euler equation is one of those beautiful intersections of algebra and calculus. It teaches us that sometimes, when two solutions look the same, we need to dig deeper—literally into a logarithm—to find a new direction.

Now you’re ready to handle repeated roots like a pro.

Review Summary

  • Try y = xʳ — works when roots are real and distinct.
  • If you get a repeated root, the second solution involves a logarithmic term.
  • Use reduction of order to find it: set y₂ = v(x) xʳ and solve.
  • Final form: y₂ = xʳ ln x

Happy mathing!

Comments

Post a Comment

Popular posts from this blog

What is Mathematical Fluency?

What does it really mean for students to be mathematically fluent? If you’ve been in any math PD over the past few years, you’ve likely heard the phrase everywhere. We talk about fluency as something students should develop, strengthen, and demonstrate, but it can still feel abstract when we try to describe it in observable, classroom-ready terms. This post breaks down mathematical fluency into the two simplest frames we can use as teachers: what it looks like and what it sounds like . These descriptions can guide instruction, assessment, student goal-setting, and even walkthrough conversations with colleagues or administrators. What Mathematical Fluency Looks Like In a classroom where students are developing mathematical fluency, you see students making choices about strategies rather than following steps robotically. They use representations—number lines, diagrams, tables, graphs, manipulatives, symbolic expressions—and switch between them to make sense of a problem. They move ...
Read more

Unlocking the Group: Cosets, Cayley’s Theorem, and Lagrange’s Theorem

Mathematics is full of elegant ideas that take simple definitions and build deep, powerful structures. In group theory, three such concepts—cosets, Cayley's Theorem, and Lagrange’s Theorem—form a foundational trio that unveils the internal symmetry of algebraic systems. Let’s explore what they mean and why they matter. What’s a Coset, Really? Imagine you have a group and a smaller subgroup inside it. Now, pick any element from the big group and use it to shift every element in the subgroup by multiplying on the left. The resulting set is called a left coset . You can also do this multiplication on the right, forming a right coset . These cosets aren’t usually groups themselves—but they do break the original group into equal-sized, non-overlapping pieces. Intuitively , cosets act like “shifts” of the subgroup across the whole group. Think of tiling a floor: each tile is a copy of the same shape (the subgroup) placed in different locations (cosets). Lagrange’s Theorem: Size Matt...
Read more

Verifying the Binomial Formula with Mathematical Induction

The binomial formula states: ( z 1 + z 2 ) n = ∑ k = 0 n ( n k ) z 1 n − k z 2 k (z_1 + z_2)^n = \sum_{k=0}^n \binom{n}{k} z_1^{n-k} z_2^k where ( n k ) = n ! k ! ( n − k ) ! \binom{n}{k} = \frac{n!}{k!(n-k)!} and n = 1 , 2 , … n = 1, 2, \ldots . This is a powerful formula in algebra, expressing the expansion of ( z 1 + z 2 ) n (z_1 + z_2)^n as a sum of terms involving powers of z 1 z_1 and z 2 z_2 . We’ll verify this formula using mathematical induction . Mathematical induction is a logical method to prove that a statement holds for all positive integers n n . The process involves two steps: Base Case : Verify the formula for the smallest value of n n , typically n = 1 n = 1 . Inductive Step : Assume the formula holds for some n = k n = k , and then prove it holds for n = k + 1 n = k+1 . Step 1: Base Case ( n = 1 n = 1 ) For n = 1 n = 1 , the formula becomes: ( z 1 + z 2 ) 1 = ∑ k = 0 1 ( 1 k ) z 1 1 − k z 2 k (z_1 + z_2)^1 = \sum_{k=0}^1 \binom{1}{k} z_1^{1-k} z_2^k L...
Read more