() =

()
()

() = 3 1

() = 3 2

2
1
() = + 2
3
3

() =
() =

2 2 1

3 3 3

()
()
()2

() = 0

() = () + ( ) () +

() = () + ( )

( )2
( )3
() +
() +
2!
3!

( )2 d2
( )3 d3
( )4 d4
d
()
()
()
+

+
()
+
2!
d 2
3!
d 3
4!
d 4
d
=
=
=
=

()
=
() = ( 1 ) ( 2 ) () () = () = 0
d

1
) = ( 1 ) ( 1 ) = () ()1
(

d2
()
= () ()1 (1 + () + + ()1 )
d 2
=

 () = + ( ) () +
() = +
blah

( )2
() 1
( () ()1 )
+
2!
() 1

( )2
() 1
( () ()1 )
+
2!
() 1

(3) Expand fn(x) around the fixed point a as a Taylor series.

(4) Expand out:

(5) Substitute in for fn(a) = a:

(6) Make use of geometric progression to simplify terms.

(6b) There is a special case when f'(a)=1:

(7) When n is not an integer we make use of the power formula yn = exp(nln(y))
This can be carried on indefinitely although the latter terms become increasingly complicated.
Blah
Calibriii

The formula for the th derivative of the th iterate of is:

( )() () = (|1 |) 1 () ( 1 )(|1 |) ()

where

1 1

1 1

( 1 )(|1 |) () = (|2 |) 2 () ( 2 )(|2 |) ()

2 2

Blahblahblahblahbalbhalbha

2 2

Suppose further that is a fixed point of . Then

( )() () = (|1 |) () ( 1 )(|1 |) ()

where

1 1

1 1

( 1 )(|1 |) () = (|2 |) () ( 2 )(|2 |) ()

where

2 2

2 2

runs through the set of all partitions of the set {1, , }

means the variable runs through the list of all the blocks of the partition , and

|| denotes the cardinality of the set (so that || is the number of blocks in the partition of and || is the size of the block

First derivative:
= {1}

( )(1) () = () ( 1 ) ()

( 1 ) () = () ( 2 ) ()

( )(1) () = () = 0

Second derivative: CONFIRM THIS WORKS

= {1}, {2}, {1,2}

( )(2) () = () ()2(1) + () ( 1 )(2) () = 0

EVENTUALLY

( )(2) () = ( () ()1 )

() 1
() 1

Third derivative:
= {1}, {2}, {3}, {1,2}, {3}, {1}, {2,3}, {1,3}, {2}, {1,2,3}

( )(3) () = (3) () ( 1 )(1) () ( 1 )(1) () ( 1 )(1) () + (2) () ( 1 )(2) () ( 1 )(1) () + (2) () ( 1 )(1) () ( 1 )(2) ()
+ (2) () ( 1 )(2) () ( 1 )(1) () + (1) () ( 1 )(3) ()
( )(3) () = (3) () ( 1 )(1) ()3 + 3 (2) () ( 1 )(2) () ( 1 )(1) () + (1) () ( 1 )(3) () = 0
Fourth derivative:
In order for the mth derivative to be non-zero, we must find a partition of the first m positive integers which is partitioned into more than 1 subsets, none
of which have a cardinality of 1. For the list of the first four numbers out of the 15 total partitions those which satisfy these requirements are:
= {2,3}, {1,4}, {1,3}, {2,4}, {1,2}, {3,4}

( )(4) () = 3 () ( 1 ) ()2

( 1 ) () = (2) () ( 1 )(1) ()2 + (1) () ( 1 )(2) ()

( )(4) () = 3 ()+2
() = +

( )4 d4
()
+
4! d 4
=

() +
Nooppee

( )4 +2
()
8

6th derivative is probably the way to go

d2 1
()
= ()
d 2
=

d3 1
()
= ()
d 3
=

d4 1
()
= (4) ()
d 4
=

d4 2
()
= 3 ()3
d 4
=

d5 2
()
= 10 ()2 ()
d 5
=

d6 2
()
= 10 () (3) ()2 + 15 ()3 (3) () + 15 ()2 (4) ()
d 6
=

d8 3
()
= 315 ()7
d 8
=

d9 3
()
= 3780 ()6 ()
d 9
=

d16 4
()
= 638512875 ()15
d16
=

d17 4
()
= 28945917000 ()14 ()
d17
=

(2 )! 2 1
d2
()

=
()

d 2
22 1
=

()

( )2 2 1
( )2 d2
()

+
()
+

(2 )! d 2
22 1
=

= (0 )

()

= (0 )

2 1

()

2 1

2 12

()

= (0 )2 12

= (0 )2 12
2 = 2

2 ln

+1

(2 + 2 )12

2
2
= (1 2 ) ln( + )
2

2 ln 2 2 ln = (1 2 ) ln(2 + 2 )

2
ln 2
2
= log 2 +2

ln 2
+ 2
2
+ 2
2 =
2
ln 2
+ 2
ln

2
+ 2
=
2
ln 2
+ 2
ln

2 ln
2 ln

2
2

2
=
ln
2 + 2
2 + 2

2
2
=
ln
2 + 2
2 + 2

2
2
2
= +2

ln 2
+ 2
ln

2
ln 2
2
ln +2

ln 2
+ 2
=
ln 2