Lemma: For each integer $N\geq 1$, we have
$$\sum_{(k,N)=1}\frac{t^k}{k}=-\sum_{d|N}\frac{\mu(d)}{d}log(1-t^d)$$
Proof. Let $c_{k}=1$ if $(k,N)=1$ and $c_{k}=0$ otherwise. By basic propierties of the Möbius function we have $c_{k}=\sum_{d|(k,N)}\mu(d)$. Hence
$$\sum_{(k,N)=1}\frac{t^k}{k}=\sum_{k=1}^{\infty}\frac{t^k}{k}$$
$$=\sum_{k=1}^{\infty}\left(\sum_{d|(k,N)}\mu(d)\right)\frac{t^k}{k}$$ $$=\sum_{d|N}\mu(d)\sum_{k\geq 1,\ d|k} \frac{t^k}{k} \ (\text{How can I do this?})$$ $$=\sum_{d|N}\mu(d)\sum_{k'=1}^{\infty}\frac{t^{dk'}}{dk'}$$ $$=\sum_{d|N}\frac{\mu(d)}{d}\sum_{k'=1}^{\infty}\frac{(t^{d})^k}{k}$$ $$=-\sum_{d|N}\frac{\mu(d)}{d}log(1-t^d)$$ This complete the proof of Lemma.
My question is How can I write
$$\sum_{k=1}^{\infty}\left(\sum_{d|(k,N)}\mu(d)\right)\frac{t^k}{k}$$
in the form $$=\sum_{d|N}\mu(d)\sum_{k\geq 1,\ d|k} \frac{t^k}{k}$$?
$d$ devides $k$ and $d$ divides $n$. Furthermore $\mu(d)$ does not depend on $k$, so we can just sum over $d \vert N$. For $t^k /k$ we have to sum from $k=1$ to $k = \infty$ but only for those $k$ that are divisible by $d$.