Find 2 0 1 6 ! f ( 2 0 1 6 ) ( 0 ) for f ( x ) = ( 1 − x ) 3 ( 1 + x + x 2 ) x 3 .
Clarifications :
f ( k ) ( x ) denotes the k th derivative of f ( x ) .
! denotes the factorial notation. For example, 8 ! = 1 × 2 × 3 × ⋯ × 8 .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Yes, this is what I had in mind, although I would write it up in a less formal way ;) I will post my "sloppy" solution tonight if I get to it.
I've used another approche:
Let ω and ω ˉ be the complex roots of 1 + x + x 2 = 0 1 8 f ( x ) = = ( 1 − x ) 3 ( 1 + x + x 2 ) 1 8 x 3 − 2 ( ω − x ) − 1 − 2 ( ω ˉ − x ) − 1 + 4 ( 1 − x ) − 1 − 1 2 ( 1 − x ) − 2 + 6 ( 1 − x ) − 3
By recurrence we can see that: ( − 2 ( ω − x ) − 1 ) ( n ) ( − 2 ( ω ˉ − x ) − 1 ) ( n ) ( 4 ( 1 − x ) − 1 ) ( n ) ( − 1 2 ( 1 − x ) − 2 ) ( n ) ( 6 ( 1 − x ) − 3 ) ( n ) = = = = = n ! ( − 2 ( ω − x ) − ( n + 1 ) ) n ! ( − 2 ( ω ˉ − x ) − ( n + 1 ) ) n ! ( 4 ( 1 − x ) − ( n + 1 ) ) n ! ( − 1 2 ( n + 1 ) ( 1 − x ) − ( n + 2 ) ) n ! ( 3 ( n + 1 ) ( n + 2 ) ( 1 − x ) − ( n + 3 ) )
So that:
1 8 n ! f ( n ) ( 0 ) = = = − 2 ( ω − ( n + 1 ) + ω ˉ − ( n + 1 ) ) + 4 − 1 2 ( n + 1 ) + 3 ( n + 1 ) ( n + 2 ) − 2 ( ω − ( n + 1 ) + ω ˉ − ( n + 1 ) + 1 ) + 6 − 1 2 ( n + 1 ) + 3 ( n + 1 ) ( n + 2 ) − 2 ( ω − ( n + 1 ) + ω ˉ − ( n + 1 ) + 1 ) + 3 n ( n − 1 )
knowing : ω − ( n + 1 ) + ω ˉ − ( n + 1 ) + 1 = = 3 f o r n ≡ 2 ( m o d 3 ) 0 o t h e r w i s e
And finally: n ! f ( n ) ( 0 ) = = 6 ( n + 1 ) ( n − 2 ) f o r n ≡ 2 ( m o d 3 ) 6 n ( n − 1 ) o t h e r w i s e
Yes, that's another sensible approach! Quite a bit of work, though... ;)
Log in to reply
I agree a lot of work, but if offers a more systematic way to reach the result.
By the way, English is my third language and French is my second.
So sometimes my approach can be "plus proche" to French.
Log in to reply
I'm in the same boat: English is my third language and French is my second. I assume that our first languages are different, though ;)
I must confess that I do not have the patience to write a solution like yours. I'm always looking for short-cuts and for an "easy way out." When things get too technical and messy, I lose interest. The "systematic" solution is not always the most beautiful.
It's good that people take different approaches... it keeps things interesting.
Log in to reply
@Otto Bretscher – I did it just for the seek of varieties.
I must confess that decomposing a rational is very tedious, so I was forced to use some software to achieve it. Things become easier from that point.
I love the way you write your solution, always focusing on the essence of proof and avoiding the formalism that could hide the beauty of the concept.
The solution I had in mind is similar to Mark's. For the sake of variety, let me write up a more informal version. Let's start with the geometric series 1 − x 3 x 3 = x 3 + x 6 + x 9 + . . . .
If A ( x ) = ∑ n = 0 ∞ a n x n then 1 − x A ( x ) = ∑ n = 0 ∞ ( ∑ k = 0 n a k ) x n : the coefficients of the power series of 1 − x A ( x ) are the partial sums of the coefficients of the power series of A ( x ) . We will use this principle twice to get what we need: ( 1 − x ) ( 1 − x 3 ) x 3 = x 3 + x 4 + x 5 + 2 x 6 + 2 x 7 + 2 x 8 + 3 x 9 + . . . + 6 7 1 x 2 0 1 5 + 6 7 2 x 2 0 1 6 + . . .
(As Mark states, the coefficient of x n turns out to be the integer part of 3 n .)
Now the coefficient of x 2 0 1 6 in f ( x ) = ( 1 − x ) 2 ( 1 − x 3 ) x 3 = ( 1 − x ) 3 ( 1 + x + x 2 ) x 3 is 3 ∑ k = 1 6 7 1 k + 6 7 2 = 6 7 7 0 4 0
Let
g
(
x
)
=
f
(
x
)
.
(
1
+
x
+
x
2
)
=
(
1
−
x
x
)
3
then
g
(
x
)
=
(
1
−
x
1
−
1
)
3
=
−
(
x
−
1
)
3
1
−
1
−
(
x
−
1
)
2
3
−
x
−
1
3
Now differentiate
g
(
x
)
n times wrt
x
and put
x
=
0
,
g
n
(
0
)
=
2
(
n
+
2
)
!
−
3
.
(
n
+
1
)
!
+
3
.
n
!
=
2
(
n
−
1
)
(
n
−
2
)
.
n
!
and also,
g
n
(
x
)
=
f
n
(
x
)
(
1
+
x
+
x
2
)
+
n
(
1
+
2
x
)
f
n
−
1
(
x
)
+
n
(
n
−
1
)
f
n
−
2
(
x
)
(see for yourselves!)
g
n
(
0
)
=
f
n
(
0
)
+
n
f
n
−
1
(
0
)
+
n
(
n
−
1
)
f
n
−
2
(
0
)
Further observe,
g
n
(
0
)
−
n
g
n
−
1
(
0
)
=
f
n
(
0
)
−
n
(
n
−
1
)
(
n
−
2
)
f
n
−
3
(
0
)
=
(
n
−
2
)
.
n
!
Divide both sides by
n
!
to get,
n
!
f
n
(
0
)
−
(
n
−
3
)
!
f
n
−
3
(
0
)
=
n
−
2
Sum up the above equation from
n
=
3
to
n
=
2
0
1
6
to get
2
0
1
6
!
f
2
0
1
6
(
0
)
−
0
!
f
(
0
)
=
1
+
4
+
7
+
.
.
.
+
2
0
1
4
2
0
1
6
!
f
2
0
1
6
(
0
)
=
6
7
7
0
4
0
Problem Loading...
Note Loading...
Set Loading...
We want the coefficient C N of x N in the series expansion (for ∣ x ∣ < 1 ) of f ( x ) = = ( 1 − x ) 3 ( 1 + x + x 2 ) x 3 = ( 1 − x ) 2 ( 1 − x 3 ) x 3 ( n = 0 ∑ ∞ ( n + 1 ) x n ) ( m = 1 ∑ ∞ x 3 m ) = n = 0 ∑ ∞ m = 1 ∑ ∞ ( n + 1 ) x n + 3 m and hence C N = = = = m = 1 ∑ ⌊ 3 1 N ⌋ ( N − 3 m + 1 ) ⌊ 3 1 N ⌋ ( N + 1 ) − 2 3 ⌊ 3 1 N ⌋ ( ⌊ 3 1 N ⌋ + 1 ) 2 1 ⌊ 3 1 N ⌋ ( 2 ( N + 1 ) − 3 ( ⌊ 3 1 N ⌋ + 1 ) ) 2 1 ⌊ 3 1 N ⌋ ( 2 N − 1 − 3 ⌊ 3 1 N ⌋ ) Since 2 0 1 6 = 3 × 6 7 2 , the answer is C 2 0 1 6 = 6 7 7 0 4 0 .