Problem of direct calculation of n-th derivative of

x
ex 1

Marek Zazrivec

We have the real function1 f (x) =

x
and we want to find n-th derivative
ex 1

f (n) (x).
The first two derivative of f (x) are:
f (1) (x) =

2ex 2e2x + x (ex + e2x )

1 + ex xex
(2)
,
f
(x)
=
,
(ex 1)2
(ex 1)3

so we can guess by induction, that in general for n N should be:

n
P

f (n) (x) =

n
P

p(k, n)ekx + x

k=0

(ex

q(k, n)ekx

k=0
n+1

1)

(1)

for some p(k, n), q(k, n) Z. But the question is: How to find some explicit general
formulas for p(k, n), q(k, n)?
Our solution is simply based on mathematical induction principle. If we know the
formulas for p(k, n), q(k, n), than we can prove them by induction. We dont know
these formulas yet, but by induction well obtain some recurrent relations, from which
we can deduce them.

Recurrent relations for p(k, n), q(k, n)

Lets differentiate function in (1) and well obtain:
 n

n
n
P
P
P
kx
kx
kx
kp(k, n)e +
q(k, n)e + x
kq(k, n)e
(ex 1)n+1
0
k=0
k=0
(f (n) ) (x) = k=0

n+1
x
x
(e 1)
(e 1)n+1
 n

n
P
P
kx
kx
p(k, n)e + x
q(k, n)e
(n + 1) (ex 1)n ex
k=0
k=0
=
x
(e 1)n+1 (ex 1)n+1

f (x) can be continuously defined in zero f (0) = lim

x0

ex

x
= 1.
1


=

n
P

kx

kp(k, n)e

k=0

n
P

q(k, n)e

kx

+x

k=0

n
P

kq(k, n)e

kx

(ex 1)

k=0
n+2

(ex

1)

 n
n
P
P
kx
kx
(n + 1) ex
p(k, n)e + x
q(k, n)e
k=0

k=0

(ex

1)n+2

and after adjustments:

n
P

f (n+1) (x) =

ekx (kp(k, n) + (k n 2)p(k 1, n) q(k, n) + q(k 1, n))

k=1

(ex 1)n+2
x

n
P

ekx (kq(k, n) + (k n 2)q(k 1, n))

k=1

+
(ex 1)n+2
e(n+1)x (q(n, n) p(n, n)) + xe(n+1)x (q(n, n))
+

(ex 1)n+2
q(0, n)e0x + 0xe0x
+
.
(ex 1)n+2
(2)
If we put n + 1 instead of n in (1), we get:
n+1
P

f (n+1) (x) =

p(k, n + 1)ekx + x

k=0

n+1
P

q(k, n + 1)ekx

k=0
n+2

(ex 1)

and comparison with (2) gives for n N and k = 1, 2, . . . , n following recurrent

relations:
p(0, n + 1) = q(0, n)
q(0, n + 1) = 0
p(k, n + 1) = kp(k, n) + (k n 2)p(k 1, n) q(k, n) + q(k 1, n)
q(k, n + 1) = kq(k, n) + (k n 2)q(k 1, n)
p(n + 1, n + 1) = q(n, n) p(n, n)
q(n + 1, n + 1) = q(n, n)
From f (1) (x) =

(3)
(4)
(5)
(6)
(7)
(8)

1 + ex xex
we have also initial conditions:
(ex 1)2
p(0, 1) = 1, p(1, 1) = 1, q(0, 1) = 0, q(1, 1) = 1.

(9)

Formula for q(k, n)

First we put k = 1 in (6) and using trivial fact, that from (4) and (9) follows
q(0, n) = 0, n N , we get recurrent formula q(1, n + 1) = q(1, n), from which (and
from (9)) we have:
q(1, n) = (1)n , n N.
(10)
Now we put k = 2 in (6), substitute by (10) and we have:
q(2, n + 1) = 2q(2, n) n(1)n .

(11)

2ex 2e2x + x (ex + e2x )

we have q(2, 2) = 1. Now putting n =
(ex 1)3
2, 3, 4, . . . in (11) and using recurrent substitutions we get step by step:

From f (2) (x) =

q(2, 3) = 21 1 20 2
q(2, 4) = +22 1 + 21 2 + 20 3
p(2, 5) = 23 1 22 2 21 3 20 4
p(2, 6) = +24 1 + 23 2 + 22 3 + 21 4 + 20 5
..
.
and generally for n N :


q(2, n) = (1)n 2n2 1 + 2n3 2 + 2n4 3 + + 20 (n 1) .

(12)

Lets adjust (12):

n1  k
k  k
n1 X
X
X
1
1
n n1
q(2, n) = (1)
k2
= (1) 2
k
= (1) 2
=
2
2
k=1
k=1
k=1 i=1
!
i1  k
n1 X
n1  k
n1
n1  k
X
X
X
X
1
1
1
= (1)n 2n1
= (1)n 2n1

=
2
2
2
i=1 k=i
i=1
k=0
k=0



n1 
n1 
X
X
1
1
1
1
n n1
n n1
= (1) 2
= (1) 2
2 n1 2 i1
n1 + i1 =
2
2
2
2
i=1
i=1
n

n1
X

n1k

n n1

n1
n1
X
X
1
1
n n1
= (1) 2
+ (1) 2
= (1)n+1 (n 1)+
n1
i1
2
2
i=1

 i=1
1
+ (1)n 2n1 2 n2 = (1)n+1 (n + 1 2n ) .
2
n+1 n1

Now lets try to find analogical formula for q(3, n). This time its more complicated. So well use different method to find it. We put k = 3 in (6) and we also
substitute previous result
q(2, n) = (1)n+1 (n + 1 2n ) , n N, n 2
3

(13)

to get:


q(3, n + 1) = 3q(3, n) + (1)n n2 1 (n 1)2n , n N, n 2.

(14)

Now well try to guess formula using method of undetermined coefficients. Idea is
following: First well find functions E(n), F (n), n N which for all n N satisfies
relations:
3E(3, n) E(3, n + 1) = n2 1,
(15)
3F (3, n) F (3, n + 1) = (n 1)2n .

(16)

Then its not difficult to see, that function of 2 variables: g(c, n) = (1)n (E(n) +
F (n) + c3n ), n N, c R must satisfy (14), thus:


g(c, n + 1) = 3g(c, n) + (1)n n2 1 (n 1)2n , n N.
Using this fact well continue to find formula for q(3, n) using mathematical induction
principle. Because if g(c, n) satisfies initial condition e.g. g(c, 3) = q(3, 3) for some c
and also if g(c, n) satisfies relation (14), then by induction must be g(c, n) = q(3, n)
for all n N .
Lets find functions E(n), F (n). From (15) we can easily guess, that E(n) =
2
e2 n + e1 n + e0 for some constants e2 , e1 , e0 R. Then E(n) satisfies (15) if and only
if:
2e2 n2 + (2e1 2e2 )n + 2e0 e1 e2 = m2 1,
so we can easily calculate, that must be e2 = e1 = 21 , e0 = 0, and we must have
E(n) = 12 n2 + 21 n = n(n+1)
. Analogicaly we can guess that F (n) = (f1 n + f0 )2n for
2
some f1 , f0 R. Then F (n) satisfies (16) if and only if:
(f1 n 2f1 + f0 )2n = (n + 1)2n ,
so we must have f0 = f1 = 1, thus F (n) = (n + 1)2n . Now we know, that function


n(n + 1)
n
n
n
(n + 1)2 + c3
g(c, n) = (1)
(n N, c R)
2
satisfies (14). Lets calculate constat c for which is2 : g(c, 3) = q(3, 3) = 1. We have:


3(3 + 1)
3
3
3
1 = (1)
(3 + 1)2 + c3
c=1
2
and we obtain the following result:


n(n + 1)
n
n
n
q(3, n) = (1)
(n + 1)2 + 3 , n N, n 3.
2
2

We know q(3, 3) = 1 e.g. from (9) and (8).

(17)

Lets try to guess general formula for q(k, n). From (10), (13) and (17) we can
deduce, that for q(k, n) should be:
n

q(k, n) = (1)

k
X

(1)

i=0


n+1
(k i)n
i

(k N0 , n N, k n).

(18)

Formula is correct and proof can be simply based on the fact, that from (4), (6),
(8), (9) are values of q(k, n) fully determined, so well only show, that coefficients
defined by (18) satisfies relations (4), (6), (8), (9).
From (18) directly follows (4) and q(0, 1) = 0, q(1, 1) = 1. Lets show (6). We
want to show, that:



k
X
n+2
i n+1
n+1
n
(k i)n +
(1)
(k i)
= k(1)
(1)
(1)
i
i
i=0
i=0
(19)


k1
X
n
+
1
(1)i
(k 1 i)n .
+ (k n 2)(1)n
i
i=0
n+1

k
X

Lets make substitution i + 1 i in the last sum of (19), multiple both sides by
1/(1)n+1 and substract k n+1 from both sides (to remove index i = 0 from first two
sums):




k
k
X
X
i n+2
n+1
i n+1
(1)
(k i)
=
(1)
(k i)n k+
i
i
i=1
i=1


k
X
n+1
+
(1)i
(k i)n (k n 2).
i

1
i=1



n+2



n+2i
n+2
Because i = n+1
and n+1
= n+1
we get:
i1
i
i
i1
i




k
k
X
X
(n + 2 i)k
i n+1
i n+1
n (n + 2)(k i)
=
(1)
+
(1)
(k i)n
(k i)
i
i

1
i
i

1
i=1
i=1


k
X
n+1
+
(1)i
(k i)n (k n 2).
i

1
i=1
(20)
Now, its easy to see, that
(n + 2)(k i)
(n + 2 i)k
=
+ (k n 2),
i
i
and therefore identity (20) is correct and also (19).
Lets show (8). Well only show identity:
n
X



n+1
(1)
(n i)n = (1)n ,
q(n, n) = (1)
i
i=0
n

(n N )

(21)

from which follows (8). Identity is equivalent to



n
X
i n+1
(n i)n = 1,
(1)
i
i=0
or after substitution n i i
n
X
i=0

(1)


n+1 n
i = (1)n .
i+1

(22)

Now we can write in from (22) in shape:

in = An (i + 1) i (i 1) . . . (i + 2 n) + An1 (i + 1) i . . . (i + 2 (n 1)) + . . .
. . . + A2 (i + 1) i + A1 (i + 1) + A0 ,
(23)
for some real constants An , An1 , . . . , A1 , A0 , so we have:


n
X
i n+1
(1)
in =
i
+
1
i=0

 X


n
n
n
X
X
i n+1
i n+1
= A0
(1)
+
Ak
(1)
(i + 1) i . . . (i + 2 k).
i+1
i+1
i=0
i=0
k=1
If we also use formulas:




n+1
n+1k
(i + 1) i . . . (i + 2 k) =
(n + 1) n . . . (n + 2 k)
i+1
i+1k

 X


n
n
X
i n+1k
n+1k
i n+1k
(1)
0 = (1 1)
=
=
(1)
,
i
+
1

k
i
+
1

k
i=0
i=k1

(24)

we get:
n
X


n+1 n
(1)
i =
i+1
i=0



 X
n
n
n
X
X
i n+1
i n+1k
= A0
(1)
+
Ak
(1)
(n + 1) n . . . (n + 2 k) =
i+1
i+1k
i=0
i=0
k=1

 X


n
n
n
X
X
i n+1
i n+1k
= A0
(1)
+
Ak (n + 1) n . . . (n + 2 k)
(1)
=
i
+
1
i
+
1

k
i=0
k=1
! i=0




n
n
X
X
n+1
n+1
= A0
(1)i
= A0 1 +
(1)i
= A0 .
i
+
1
i
+
1
i=0
i=1
i

If we put i = 1 in (23), we must have A0 = (1)n , so we obtain (22) and also

equivalent identity (21). From (21) follows, that q(n, n) defined by (18) satisfies
relation (8) and proof of formula (18) is now finished.
6

Formula for p(k, n)

From (3) there is p(0, n + 1) = 0, n N , so putting k = 1 in (5) and from (9),
(10) we obtain:
p(1, 2) = 2
p(1, n + 1) = p(1, n) + (1)n+1 ,

n 2, n N.

(25)

Now if we put n = 2, 3, 4, . . . into (25), we get step by step:

p(1, 3) = 3, p(1, 4) = 4, p(1, 5) = 5, p(1, 6) = 6, . . .
and generally3 by induction:
p(1, n) = (1)n n,

n 2, n N.

(26)

For k = 2 in (5), using previous results we have:

p(2, n + 1) + 2p(2, n) = (1)n n2 + n + 2 2n ,

n 2, n N

(27)

Now well use method of undetermined coefficients to determine formula for

p(2, n). Key idea is following: First well find functions F (n), G(n), n N which
will satisfy recurrence relations (for all n N ):
F (n + 1) + 2F (n) = n2 + n + 2,
G(n + 1) + 2G(n) = 2n .

(28)
(29)

Then function (1)n (F (n) + G(n)) evidently satisfies relation(27), thus:

(1)n+1 (F (n + 1) + G(n + 1)) + (1)n (2F (n) + 2G(n)) = (1)n n2 + n + 2 2n .
If function (1)n (F (n) + G(n)) satisfies (27) together with: (1)2 (F (2) + G(2)) =
p(2, 2), then by induction must be p(2, n) = (1)n (F (n) + G(n)), for n 2, n N .
Lets find functions F (n), G(n). We can guess, that F (n) = a2 n2 + a1 n + a0 , for
some real coefficients a2 , a1 , a0 and F (n) satisfies (28) if and only if:
a2 n2 + (a1 2a2 )n a2 a1 + a0 = n2 + n + 2,
so we can calculate from comparison of coefficients, that: a2 = a1 = 1, a0 = 0 and
we have F (n) = n2 n = n(n + 1). Analogically we can guess, that G(n) =
(c1 n + c0 )2n , for some real c1 , c0 and G(n) satisfies relation (29) if and only if:
G(n + 1) + 2G(n) = 2c1 2n = 2n ,
3

Formula (26) is incorrect for n = 1.

so we must have c1 = 12 and c0 R is undetermined yet, thus G(n) = ( 12 n + c0 )2n .

Now we know, that function


 
1
n
n
(1) (F (n) + G(n)) = (1) n(n + 1) +
n + c0 2n
2
satisfies (27) and we search coefficient c0 R, for which is: (1)2 (F (2) + G(2)) =
p(2, 2) = 2. We have


 
1
2
(1) 2(2 + 1) +
2 + c0 22 = 2 c0 = 0,
2
so we obtain following formula:


p(2, n) = (1)n n(n + 1) + n2n1 ,

n 2, n N.

Analogically we can find formula:



n(n + 1)
n
n1
n1
p(3, n) = (1) n
(n + 1)2
+3
,
2

n 3, n N,

so we can deduce, that in general should be4 :

n

p(k, n) = (1) n

k
X
i=0

(1)


n+1
(k i)n1
i

(k N0 , n N, k n).

(30)

Formula is correct and proof can be based on the fact, that from (3)-(9) are
values of p(k, n) fully determined. We have also formula (18), so we only need to
prove, that coefficients p(k, n), defined by (30) satisfies relations (3), (5), (7), (9),
where we substitute by (18).
From (18), (30) directly follows (3), (9). Lets show (5) using (18), (30). We want
to show, that




k
k
X
X
i n+2
n
n+1
i n+1
(1) (n + 1)
(1)
(k i) = (1) nk
(1)
(k i)n1 +
i
i
i=0
i=0


k1
X
n+1
+ (1)n n(k n 2)
(1)i
(k 1 i)n1
i
i=0




k1
k
X
X
i n+1
n+1
i n+1
n
n
(k 1 i)n .
+ (1)
(1)
(k i) + (1)
(1)
i
i
i=0
i=0
(31)
n+1

Its interesting, that formula is also valid for incorrect casek = n = 1 (see (26) and footnote
3), if we define 00 = 1. From (30) we have actually correct result: p(1, 1) = (1 2) = 1.

Now we divide (31) by (1)n+1 and substitute i + 1 i in third and fifth sum.
Subsequently we separate out all summands for i = 0 and after simple adjustments
we get following equivalent formula:




k
k
X
X
n
i n+2
i n+1
(k i) (n + 1) =
(k i)n1 nk
(1)
(1)
i
i
i=1
i=1


k
X
n+1

(k i)n1 n(n + 2 k)
(1)i
i1
i=1




k
k
X
X
i n+1
n
i n+1
+
(1)
(k i) +
(1)
(k i)n .
i
i

1
i=1
i=1
And because

n+2
i

n+1 n+2
i
i1

and

n+1
i

n+1 n+2i
,
i1
i

we have:



k
X
(n + 2)(n + 1)(k i)
i n+1
(1)
(k i)n1
=
i
i1
i=1


k
X
(n + 2 i) n k
i n+1
=
(1)
(k i)n1

1
i
i=1


k
X
i n+1

(1)
(k i)n1 n(n + 2 k)+
i

1
i=1


k
X
(n + 2 i)(k i)
i n+1
+
+
(1)
(k i)n1
i
i1
i=1


k
X
i n+1
+
(1)
(k i)n1 (k i).
i1
i=1

(32)

Now its not difficult to prove identity:

(n + 2)(n + 1)(k i)
(n + 2 i) n k
(n + 2 i)(k i)
=
n(n + 2 k) +
+ (k i),
i
i
i
from which follows identities (32), (31) and weve just verified relation (5).
Lets show (7). We only need to prove identity
n
X



n+1
p(n, n) = (1) n
(1)
(n i)n1 = (1)n+1 n,
i
i=0
n

(n N )

(33)

which, together with (21), trivially implies

relation
(7). Lets divide (33) by (1)n n,




substitute n i i and because n+1
= n+1
, we obtain equivalent formula:
ni
i+1


n
X
i n+1
(1)
in1 = (1)n+1 .
i
+
1
i=0
9

(34)

Now we express in1 in (34) using formula (23). First we substitute n n 1 in

(23) and we get:
in1 = An1 (i + 1) i . . . (i + 2 (n 1)) + An2 (i + 1) i . . . (i + 2 (n 2)) + . . .
. . . + A2 (i + 1) i + A1 (i + 1) + A0 ,
(35)
Using (35) in (34) we have:


n
X
i n+1
in1 =
(1)
i+1
i=0



 X
n
n1
n
X
X
i n+1
i n+1
(i + 1) i . . . (i + 2 k)
= A0
(1)
+
(1)
Ak
i+1
i+1
i=0
i=0
k=1
and if we also use formulas (24), we obtain:
n
X



n+1 n
(1)
i =
i+1
i=0

 X


n
n
n1
X
X
i n+1
i n+1k
= A0
(1)
Ak
(1)
+
(n + 1) n . . . (n + 2 k) =
i+1
i
+
1

k
i=0
i=0
k=1

 X


n
n
n1
X
X
i n+1
i n+1k
= A0
(1)
Ak (n + 1) n . . . (n + 2 k)
(1)
+
=
i
+
1
i
+
1

k
i=0
i=0
k=1



!
n
n
X
X
n+1
n+1
= A0
(1)i
= A0 1 +
(1)i
= A0 .
i
+
1
i
+
1
i=0
i=1
i

If we put i = 1 in (35), we must have A0 = (1)n1 = (1)n+1 , so we obtain (34)

and also (33). Formulas (33), (21) trivially implies (7).
We have shown, that p(k, n) defined by (30) satisfies relations (3), (5), (7), (9),
so proof of formula (30) is now finished.

Summary result
x
:
ex 1

From (18), (30) and (1) we have following formula for n-th derivative of


ex

x
1

n
k
P
P
(n)
n
ekx (1)i
i=0
= (1)n k=0

n
k


P
P
(k i)n1 + x
ekx (1)i

n+1
i

(ex

10

k=0
n+1

1)

i=0

n+1
i

(k i)n
.