Möbius inversion across all natural numbers (no divisors)

by Richard Burke-Ward   Last Updated November 10, 2018 11:20 AM

I'm trying (self-taught) to understand more about Möbius inversion. Take two arithmetic functions $f$ and $g$ defined by


(Presumably $d$ refers to divisors $>0$ and $\le n$). As I understand it, the inverse via Möbius inversion is then


My question is this: is it possible to modify this to invert sums that run across all natural numbers? In other words, can I invert the following function?

$$g(n)=\sum_{n=1}^\infty f(n)$$

Presumably I need to find a bijective relationship between $d$ and $\mathbb{N}$. If so, how? Or is there a better approach?

Related Questions

Sum of a multiplicative arithmetic function

Updated October 21, 2018 09:20 AM

moebius and powers. how do they behave?

Updated March 29, 2018 11:20 AM