Finding the Nth Term in a Series with Different Factors

StatusX
Homework Helper
Messages
2,570
Reaction score
2
I'm trying to get an expression for the nth term in this series:

c_1 = 1

c_n = \sum_{k=1}^{n-1} \frac{c_n}{(n-k)!}

For example:

c_2 = 1/1! = 1

c_3 = 1/2! +1/1! = 3/2

c_4 = 1/3! + 1/2! + 3/(2\cdot 1!) = 13/6

etc.

Since the factor in front of each term is different in each series, you can't express c_n just in terms of c_{n-1}. I have no idea how to start.
 
Physics news on Phys.org
First, that is supposed to be ck inside the sum. It's too late to edit it.

Is no one replying because this is too hard or too easy? If it helps, this was found when I was trying to derive a formula for

\sum_{n=1}^{\infty} \frac{1}{n^{2k}}

I know this involves the Bernoulli numbers, so maybe they are involved in the series from my first post.
 
Last edited:
Last edited:
I was using Fourier series to find an explicit formula. Namely, I started with a sawtooth wave with Fourier coefficients proportional to 1/n. Then I normalized it so the integral over one period was one, which meant that:

\sum_{n=1}^{\infty} |c_n|^2 = 1

From which I got the first sum (k=1). Then I integrated to get a series with 1/n2,l fixed the constant so there were only sinusoidal terms in the Fourier series, and renormalized. I correctly got the formula for k = 1, 2, and 3. Then trying to find the general form, which is made complicated by the integrating constants that depend on the constants from previous iterations, I ran into a series very similar to the one from the first post. I was just curious if there is a closed form for that expression, or if you have to resort to more complicated methods.
 
Last edited:
Maybe this will help, although I don't surely know cause I haven't tried it yet, but I recall a method I used to solve a similar problem once.

Set:

f(x) := c_1 + c_2x + c_3x^2 + c_4x^3 + c_5x^4 + ...

where c_k are the co-efficients you originally defined.


Then expand the inverse of f(x) as a power series, call this new power series g(x), say. I'm assuming the co-efficients of g(x) might be easier to recognise. If you have maple or mathematica this can be easily done.

Then the c_n co-efficients of f(x) can be calculated by knowing the n'th derivitive of 1/g(x) , evaluated at the point zero.

If you can calculate it, I'd be interested to know what the power series of g(x) is.
 
Last edited:
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top