MATH 115: Higher-Order Derivatives Bonus Example

Dylan C. Beck
February 19, 2018

Example Bonus. Compute the nth derivative of y = x1/2 . Prove your formula inductively.

Solution. Consider the first five derivatives of y = x1/2 given by

1
y 0 = x−1/2 ,
2

1 1 2(2)−1
y 00 = − x−3/2 = (−1)1 · 2 x− 2 ,
4 2

3 3 2(3)−1
y 000 = x−5/2 = (−1)2 · 3 x− 2 ,
8 2

15 −7/2 3 · 5 2(4)−1
y (4) = − x = (−1)3 · 4 x− 2 , and
16 2

105 −9/2 3 · 5 · 7 − 2(5)−1

y (5) = x = (−1)4 · x 2 .
32 25
We claim that the nth derivative of y (n ≥ 2) is given by
n
(−1)n−1 Y 2n−1
y (n)
= n
· (2k − 3) · x− 2 ,
2 k=2

where nk=2 (2k − 3) = 3 · 5 · 7 · · · (2n − 3). We prove this using the Principle of Mathematical
Q
Induction. First, we establish that y 00 obeys our formula by plugging in n = 2 above. We then as-
sume inductively that y (n) is of the above form, and we establish that y (n+1) is of the above form
with n + 1 written everywhere there is an n. We find that when n = 2, we have
2
00 (−1)1 Y 2(2)−1 1 1
y =y (2)
= 2
· (2k − 3) · x− 2 = − · [2(2) − 3] · x−(4−1)/2 = − x−3/2 ,
2 k=2
4 4

1
as desired. We will assume that y (n) is of the above form. Observe that we have
n
(n+1) (−1)n−1 Y 2n − 1 − 2n−1 −1
y = n
· (2k − 3) · − ·x 2
2 k=2
2

n
(−1)n Y 2n−1+2
= n+1 · (2k − 3) · [2(n + 1) − 3] · x− 2
2 k=2

n+1
(−1)(n+1)−1 Y 2(n+1)−1
= n+1
· (2k − 3) · x− 2 ,
2 k=2

hence y (n+1) obeys the conjectured formula. By the Principle of Mathematical Induction, we con-
clude that the nth derivative of y = x1/2 is given by
n
(−1)n−1 Y 2n−1
y (n)
= n
· (2k − 3) · x− 2 . 
2 k=2