Suppose I have two arithmetic functions $g(n)$ and $f(n)$, where $$g(n) = 1 + \sum_{d|n}f(d). $$ Is it possible to perform a Mobius Inversion and obtain a formula for $f(n)$? If so, how might one proceed? I do not see how to manipulate the above expression to allow a proper inversion to take place.
2026-03-25 13:04:53.1774443893
Möbius Inversion with Additional Term
110 Views Asked by user141854 https://math.techqa.club/user/user141854/detail At
1
There are 1 best solutions below
Related Questions in ELEMENTARY-NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- How do I show that if $\boldsymbol{a_1 a_2 a_3\cdots a_n \mid k}$ then each variable divides $\boldsymbol k $?
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- Algebra Proof including relative primes.
- How do I show that any natural number of this expression is a natural linear combination?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
- algebraic integers of $x^4 -10x^2 +1$
- What exactly is the definition of Carmichael numbers?
- Number of divisors 888,888.
Related Questions in ARITHMETIC-FUNCTIONS
- Prove the asymptotic probability of numbers being relative prime equals $\frac{6}{\pi^2}$
- Prove $ \left\vert \sum_{n=1}^N \frac{\mu(n)}{n} \right\vert \leqslant 1,$ where $\mu(n)$ is the Mobius function.
- $Var[w]=O(\log\log(N))$ where $w(n)$ is the no of prime divisors of $n$
- Multiplicative arithmetic function on the unit disk
- Is feasible a simple inequality as a combination of the Firoozbakht's conjecture and the properties of the Ramanujan tau function?
- Is it true that $\underbrace{x^{x^{x^{.^{.^{.^x}}}}}}_{k\,\text{times}}\pmod9$ has period $18$ and can never take the values $3$ and $6$?
- Is the average order of a product of arithmetic functions the product of the average orders?
- If $f$ is an arithmetic function with $f(1)=1$ then $f$ is multiplicative
- Inverse of a Multiplicative Arithmetic Function w/0 Mobius function
- Inverting arithmetic functions
Related Questions in MOBIUS-INVERSION
- How do I prove the following equality using Möbius inversion.
- Circle inversion and the Pappus chain paradox
- Prove $ \left\vert \sum_{n=1}^N \frac{\mu(n)}{n} \right\vert \leqslant 1,$ where $\mu(n)$ is the Mobius function.
- How many number of bracelets of length $n$ with black-white beads?
- On the Lambert series for the Möbius function
- moebius and powers. how do they behave?
- Möbius Inversion for any Arithmetic Function
- Using Mobius inversion to determine coefficients.
- Identity involving the Möbius function and the first derivative of the Riemann zeta function
- How to invert an arithmetic function where Möbius inversion may not apply?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
We can apply Möbius inversion if we rewrite the relation
$$g(n) = 1 + \sum_{d \mid n} f(d) \tag{1}$$
by modifying $f$ or $g$. We can look at $\tilde{g} \colon n \mapsto g(n) - 1$, so that $(1)$ becomes
$$\tilde{g}(n) = \sum_{d\mid n} f(d), \tag{$1'$}$$
and apply Möbius inversion. In the resulting sum, we can separate the part arising from $g$ and the part arising from the constant $1$ (which simplifies greatly). The same result is obtained - in a very slightly easier manner - if we modify $f$ rather than $g$ and write $(1)$ as
$$g(n) = \sum_{d \mid n} \tilde{f}(d), \tag{$1''$}$$
where $\tilde{f}(n) = f(n) + e(n)$ with
$$e(n) = \begin{cases} 1 &, n = 1 \\ 0 &, n \neq 1\end{cases}.$$
Möbius inversion gives
$$\tilde{f}(n) = \sum_{d\mid n} \mu(d) g\biggl(\frac{n}{d}\biggr),$$
which becomes
$$f(n) = \Biggl(\sum_{d\mid n} \mu(d) g\biggl(\frac{n}{d}\biggr)\Biggr) - e(n).$$
Naturally, since $(1)$ involves a term not coming from $f$, the formula for $f(n)$ in terms of $\mu \ast g$ involves a term not coming from $g$. In this case, the extra terms are very simple.
In the comments, the question of multiplicativity was raised. Since $(1)$ in particular yields $g(1) = 1 + f(1)$, and for a nonzero [whether the zero function is considered multiplicative depends on the author] multiplicative function $h$ one has $h(1) = 1$, not both of $f$ and $g$ can be nonzero multiplicative functions: if $f$ is a nonzero multiplicative function, then $g(1) = 2$, so $g$ cannot be multiplicative, and if $g$ is a nonzero multiplicative function, then $f(1) = 0$, so $f$ cannot be a nonzero multiplicative function.