We are asked to prove the identity in the generating functions version in the Expressing elementary symmetric polynomials in terms of power sums section of the Wikipedia page on Newton's identities
The following is what I am thinking about now:
I have not even seen generating functions before, and since $\infty$ is not a number, I do not know that if it suffices to prove that for any $n$ in N every coefficient of $T^n$ consists. If so, I think maybe it can be done using induction.
I have not familiar with the exponential generating functions so I am afraid that there are some useful properties of this function which I do not know. If so, could someone tell me what property of this function should I use?
Seeing this question:Using generating functions find the sum $1^3 + 2^3 + 3^3 +\dotsb+ n^3$ I guess maybe there is an algorithm to translate a given recurrence into generating functions.
But until now I have not found a track to prove it, Could someone please prove it or give some hints? Thanks in advance!
EDIT: The proofs in the link
are understandable and in generating functions version.
But they are not in exponential generating functions version. I do know that there is a method to translate ordinary generating functions into exponential version. But I cannot understand the principle behind the method and I am afraid that I cannot use that. So is it possible to modify the proofs above to give the desired conclusion? Any hint will be appreciate? Thanks!