Intereting Posts

How was the determinant of matrices generalized for matrices bigger than $2 \times 2$?
A proof about polynomial division
The relationship between tan(x) and square roots
Maximum value of the modulus of a holomorphic function
Finite etale maps to the line minus the origin
Way to show $x^n + y^n = z^n$ factorises as $(x + y)(x + \zeta y) \cdots (x + \zeta^{n-1}y) = z^n$
Books that follow axiomatic approach?
Standard graded algebra
Give an intuitive explanation for polynomial quotient ring, or polynomial ring mod kernel
What kind of matrices are non-diagonalizable?
Question about definition of Semi algebra
About Collatz 3n+3?
How often are Galois groups equal to $S_n$?
Weakly convex functions are convex
Number of elements in a finite $\sigma$-algebra

This question is related to my other question ( Entropy of a natural number ).

Let $f \ge 0$ be a multiplicative arithmetic function and $F(n) = \sum_{d|n}f(d)$.

Define the entropy of $n$ with respect to $f$ to be

$H_f(n) = -\sum_{d|n} \frac{f(d)}{F(n)}\log(\frac{f(d)}{F(n)}) = \log(F(n)) – \frac{1}{F(n)}\sum_{d|n} f(d)\log(f(d))$

For instance in the last question we had $f=id$.

Then I can prove that $H_f(mn) = H_f(m)+H_f(n)$ if $\gcd(m,n)=1$, hence $H_f$ is an additive function.

- Entropy of a natural number
- Do the pth powers of $p$-norms define the same partial ordering on the set of all probability distributions for all $p>1$?
- Approximation of Shannon entropy by trigonometric functions
- Entropy of a binomial distribution
- Is there a statistical measure of bitwise entropy?
- toplogical entropy of general tent map

Is it true that $\lim_{\alpha \rightarrow \infty} H_f(p^\alpha)$ always exists, where $p$ is a prime?

In the last question we had $\lim_{\alpha \rightarrow \infty} H_{id}(p^\alpha) = \frac{p \log(p)}{p-1}-\log(p-1)$

If $f=\phi$ is the Euler totient function, then I can prove, that

$\lim_{\alpha \rightarrow \infty} H_{\phi}(p^\alpha) = \frac{ \log(p)}{p-1}+\log(\frac{p}{p-1})$

**Edit:**

I found a counterexample: $f\equiv 1$,$F(n) = \tau(n)$, where $\tau$ counts the divisors of $n$, then $H_f(n)=\log(\tau(n))$ and $H_f(p^\alpha)=\log(\alpha+1)$ is unbounded.

Hence the question might be phrased like this:

What properties must $f$ have such that the above limit exists?

**Edit** Why is $H_f$ additive?:

First $H_f(n) = \log(F(n)) – \frac{1}{F(n)} \sum_{d|n} f(d) \log(f(d))$

Denote by $E_f(n) = \sum_{d|n} f(d) \log(f(d))$

Then using the multiplicativity of $f$ one can show that $E_f(mn) = F(m)E_f(n)+F(n)E_f(m)$ when $\gcd(m,n)=1$.

Using this one can show that $H_f$ is additive.

If you have a counterexample $f$ and $m,n$ where this is not true, please post it.

- Continued fraction for $\frac{1}{e-2}$
- a formula involving order of Dirichlet characters, $\mu(n)$ and $\varphi(n)$
- Question about quadratic twists of elliptic curves
- sum of floor (“weighted” divisor summary function)
- Asymptotic expressions of $\pi_{2}(n), \pi_{4}(n)$ and $\pi_{6}(n)$
- Palindromic Numbers - Pattern “inside” Prime Numbers?
- Is it possible to represent every huge number in abbreviated form?
- Is there any famous number theory conjecture proven impossible to be find out the truth or false?
- How often is $1+\prod_{k=1}^n p_k$ not prime?
- $k$-tuple conjecture.

If $f(n)$ is multiplicative and non-zero then let $F(n) = \sum_{d | n} f(d)$ and

$$ h(n) = \frac{\sum_{d | n} f(d) \log f(d)}{F(n)}$$

If $gcd(n,m)=1$ then

$h(n)+h(m)$ $ = \frac{F(m)\sum_{d | n} f(d) \log f(d)+F(n)\sum_{d | m} f(d) \log f(d)}{F(n)F(m)}$ $=\frac{\sum_{d ‘ | m,d | n} f(dd’) \log f(dd’)}{F(nm)}=h(nm)$

Thus $$h(n) = \sum_{p^k \| n} h(p^k)=\sum_{p^k \| n}\frac{\sum_{m=0}^k f(p^m)\log f(p^m)}{\sum_{l=0}^k f(p^l)}$$

Now $\log F(n)$ is additive too, as well as

$$H_f(n) = \log F(n)-h(n) = \sum_{p^k \| n} =\sum_{p^k \| n}\sum_{m=0}^k \log f(p^m) \left(1-\frac{(f(p^m) }{\sum_{l=0}^k f(p^l)}\right)$$

If $f(n) \ge 1$ then $H_f(n)$ small implies that

$$\sum_{m=0}^k \left(1-\frac{(f(p^m) }{\sum_{l=0}^k f(p^l)}\right)=\frac{k}{\sum_{l=0}^k f(p^l)}-1$$

is small. It happens for example when $f(n) = \phi(n)$.

- If $F:M\to N$ is a smooth embedding, then so is $dF:TM\to TN$.
- Example where $x^2 = e$ has more than two solutions in a group
- How to prove $ \sin x=…(1+\frac{x}{3\pi})(1+\frac{x}{2\pi})(1+\frac{x}{\pi})x(1-\frac{x}{3\pi})(1-\frac{x}{2\pi})(1-\frac{x}{\pi})…$?
- General term of Taylor Series of $\sin x$ centered at $\pi/4$
- $H,K$ be subgroups of a group $G$ such that $G$ is isomorphic with $H \times K$ ; then is $H$ normal in $G$ ?
- Find the eigenvalues of a projection operator
- Can one construct an algebraic closure of fields like $\mathbb{F}_p(T)$ without Zorn's lemma?
- Let $G$ be a group of order $36$ and $H$ be a subgroup of $G$ with order 4. Then which is/are true?
- Examples of metric vector spaces but not normed ? Normed but not prehilbertian?
- Compilation of proofs for the summation of natural squares and cubes
- Two ambient isotopic curve segments, one has the length and the other does not
- $\epsilon$-$\delta$ limits of functions question
- Why is it that a linear transformation can only preserve or reduce a vector space's dimension?
- Powers of $x$ which are always positive
- A place to learn about math etymology?