×

# Infinite(simal) Sum

Have fun!

Find a formula for $$\sum_{i=0}^\infty i^{2014}x^{i}$$. In other words, find $$0^{2014}x^{0}+1^{2014}x^{1}+2^{2014}x^{2}+3^{2014}x^{3}+4^{2014}x^{4}+...$$.

Hint: Try a form of recursion(not with numbers, but with a formula).

Note by Tristan Shin
3 years, 9 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

We can get a recurrence relation in the following manner:

For positive integers k we define $$T_{k}(x)=\sum_{i=0}^{\infty }i^kx^i$$ $$\forall x \in (0,1)$$

We know $$T_{1}(x)=\frac{x}{(1-x)^2}$$

Also $$T_{k+1}(x)=x\frac{dT_{k}(x)}{dx}$$

- 3 years, 9 months ago

To be precise, is there a way of expanding your recursion formula?

- 3 years, 9 months ago

Sorry, I didnt get you. What do you exactly mean by expanding the recursion formula? Did you mean this-

$$T_{k+1}(x)=T_{k}(x)+x^2T_{k-1}''(x)$$

- 3 years, 9 months ago

I found a simpler recursion formula that only reaches back one term.

For a start, I labeled $$T_{k}=\frac {f(x)}{(1-x)^{k+1}}$$. Then, try working around with that.

- 3 years, 9 months ago

Just a note, I know how to do it, but it would take a very long time(probably over a month straight) of working out some functions. I'm not really looking for an exact solution(don't actually take the time to do it), but if anyone can discover the method I'm using, that would be wonderful.

- 3 years, 9 months ago