While reviewing, I've come across a problem that seems to outline my lack of knowledge with regards to (specifically exponential) generating functions. For some reason, I understand "ordinary" generating functions fine in most contexts, but I cannot grasp exponential generating functions nearly as well.
The problem is as simply stated in the title:
Find the exponential generating function for the count of permutations with no Fixed Points.
The book states the answer (might be?), $\huge{\frac{e^{-x}}{1-x}}$, but doesn't give an explanation. Of course, knowing what the solution looks like and substituting the infinite series for $\frac{1}{1-x}$, I can see that the answer is $(1+x+x^2+x^3+...)(1-x+\frac{x^2}{2} -...)$. I can't even justify this generating function, let alone derive it on my own.
I've tried splitting the problem into smaller sub-problems (first take an element in a random permutation with no fixed points of length $n$, it has chance $\frac{1}{n-1}$ of being in a cycle of a length $\{2,3,...,n\}$...) but this clearly goes nowhere as it's much more of a probabilistic argument, and not really a "combinatoric" argument that I'm trying to understand.