Given $\sum |a_n|^2$ converges and $a_n \neq -1$, show that $\prod (1+a_n)$ converges to a non-zero limit implies $\sum a_n$ converges. I have been working on this problem for a while and cannot seem to make any progress without coming up with something wrong or hitting a dead end. 
Here is what I have so far:
$ \prod (1+a_n) &lt \infty \implies   \sum a_n &lt \infty $: Similarly we ignore finitely many terms until $|a_n| \leq 1/2$ and we use the taylor series for the product. We have that 
$\prod 1+ a_n$ converging im plying that 
$\sum \log (1+a_n)$ converges to a nonzero limit since none of the factors are 0 as $a_n \neq -1$. We have that 
\begin{eqnarray}
|\sum \log(1+a_n) |  =| \sum (a_n-a_n^2/2 +\ldots) | \\ \geq | \sum (a_n-|a_n^2/2 +\ldots|) |  \geq \left| \sum a_n-|a_n|^2-|a_n|^3-\ldots \right| \\ = \left|\sum a_n-|a_n|^2(1+|a_n|+|a_n|^2+|a_n|^3+\ldots \right|
\end{eqnarray}
by the triangle inequality. Thus $\infty > |\sum \log(1+a_n) |  \geq \left|\sum a_n-2|a_n|^2 \right|$ from the previous part. Thus $\left|\sum a_n-2|a_n|^2 \right|$ is  convergent, and since $\sum|a_n|^2$ is absolutely convergent we can split the series (I don't really know if this is even true) and we have that partial sums $|\sum a_n|$ is bounded.
Any help would be appreciated! Also any good references for getting better at this kind of stuff would be great!!

The statement is not true.  Consider e.g. $a_n = -1/(n+1)$, where $\prod_{n=1}^N (1+a_n) = 1/(N+1) \to 0$ as $N \to \infty$.  
Note that $\prod_n (1+a_n)$ converges to a nonzero limit iff $\sum_n \log (1 + a_n)$ converges, but you didn't say the limit had to be nonzero.
EDIT: @Didier points out the convention that part of the definition of "convergence" for an  infinite product is that the limit is nonzero.  This is not universal, however: see e.g. Rudin, "Real and Complex Analysis", sec. 15.1, or Conway, "Functions of One Complex Variable", sec. VII.5. 
