This page is your self-test track for Case 2: repeated real roots. Every problem has a fully worked solution hidden inside a collapsible callout — try it first, then reveal. Levels climb from recognising a repeated root to building whole solution families from scratch.
Goal: initial-value problems, boundary problems, and building the ODE from its solution.
Recall Solution 3.1
r2−2r+1=(r−1)2=0⇒r=1 (double).
y=(C1+C2x)ex.
y(0)=2: at x=0, e0=1 and the x-term dies, so C1=2.
Differentiate: y′=C2ex+(C1+C2x)ex=(C1+C2+C2x)ex. At x=0: y′(0)=C1+C2=5⇒C2=5−2=3.
Answer:y=(2+3x)ex.
Recall Solution 3.2
r2+6r+9=(r+3)2=0⇒r=−3 (double).
y=(C1+C2x)e−3x.
y(0)=0⇒C1=0.
y′=C2e−3x−3(C1+C2x)e−3x=(C2−3C1−3C2x)e−3x. At x=0: y′(0)=C2−3C1=4⇒C2=4.
Answer:y=4xe−3x.
Recall Solution 3.3
The solution form tells us the root is r=5, repeated. The characteristic equation is therefore (r−5)2=0, i.e. r2−10r+25=0. Matching to ar2+br+c with a=1:
b=−10,c=25.ODE:y′′−10y′+25y=0.
Goal: combine reduction of order, the Wronskian, and long-run behaviour.
Recall Solution 4.1
Set y=v(x)e−x. Then
y′=e−x(v′−v),y′′=e−x(v′′−2v′+v).
Substitute into y′′+2y′+y=0 and drop the common e−x=0:
(v′′−2v′+v)+2(v′−v)+v=0.
Group: v′′+(−2+2)v′+(1−2+1)v=0⇒v′′=0.
Both lower terms vanish (the hallmark of a repeated root). So v=C1+C2x, and the new piece is v=x, giving y2=xe−x. ✓
Recall Solution 4.2
The Wronskian W=y1y2′−y1′y2 asks: is one solution a constant multiple of the other? If W=0 anywhere, no — they are independent.
y1=e−x, y1′=−e−x.
y2=xe−x, y2′=e−x−xe−x=e−x(1−x).
W=e−x⋅e−x(1−x)−(−e−x)⋅xe−x=e−2x[(1−x)+x]=e−2x.
Since e−2x>0 everywhere, they are independent. At x=1: W(1)=e−2≈0.135.
Recall Solution 4.3
Limit: exponential decay e−x beats the linear growth x, so xe−x→0 as x→+∞ (and generally (C1+C2x)e−x→0). See the figure below.
Maximum of y=xe−x: set y′=e−x(1−x)=0⇒x=1. Then y(1)=1⋅e−1=e−1≈0.368. This is a maximum (a hump), matching the shape in the figure.
Goal: extend the pattern to higher multiplicity and non-standard forms.
Recall Solution 5.1
Characteristic: r3−9r2+27r−27=0. Recognise the binomial expansion: (r−3)3=r3−9r2+27r−27. So r=3 with multiplicity 3.
By the pattern for repeated roots, a root of multiplicity m contributes erx,xerx,…,xm−1erx. Here m=3:
y=(C1+C2x+C3x2)e3x.
Recall Solution 5.2
Repeated root needs discriminant k2−4(1)(9)=0⇒k2=36⇒k=±6. Taking k>0: k=6.
Then r=−k/2=−3 (double), and y=(C1+C2x)e−3x.
Recall Solution 5.3
Characteristic: r4+8r2+16=0. Let u=r2: u2+8u+16=(u+4)2=0⇒u=−4 (double). So r2=−4⇒r=±2i, each repeated (multiplicity 2).
A repeated complex pair ±βi gives solutions cosβx,sinβxandxcosβx,xsinβx (the repeated-root rule applied inside Case 3 complex roots). With β=2:
y=(C1+C2x)cos2x+(C3+C4x)sin2x.
Recall One-line summary of the whole ladder
Spot the double root r=−b/2a ::: then the general solution is (C1+C2x)erx; for multiplicity m climb to xm−1erx.