Newbetuts

Some convincing reasoning to show that to prove that Ramanujan tau function is multiplicative is very difficult

Euler's totient and divisors count function relationship when $[(\frac{\varphi(n)}{2}+1)\cdot(\frac{\tau(n)}{2}+1)] = n$

For any positive integer $n$, show that $\sum_{d|n}\sigma(d) = \sum_{d|n}(n/d)\tau(d)$

Series of the totient function

Let $f:\Bbb{N}\to\Bbb{C}$ denotes the indicator function of squares. Express it in terms of Mobious function $\mu$.

The sigma function (sum of divisors) multiplicative proof

Let $(a_n)$ be a strictly increasing sequence of positive integers such that: $a_2 = 2$, $a_{mn} = a_m a_n$ for $m, n$ relatively prime.

How to find the nearest multiple of 16 to my given number n

If $(a,k)=(b,m)=1$, prove that $(ab,km)=(a,m)(b,k)$.

Mean Value of a Multiplicative Function close to $n$ in Terms of the Zeta Function

Very elementary proof of that Euler's totient function is multiplicative

new addition and new multiplication x ⊕ y = x + y − 1, x ⊗ y = x + y − xy on set Z, prove the set Z equipped with these 2 new operation

Euler's Totient function $\forall n\ge3$, if $(\frac{\varphi(n)}{2}+1)\ \mid\ n\ $ then $\frac{\varphi(n)}{2}+1$ is prime

Prove that if $d \mid n \in \mathbb{N}$, then $\varphi(d) \mid \varphi(n)$.

Necessary and sufficient condition to be completely multiplicative

New posts in multiplicative-function

Why do we require the $p$-adic norm to satisfy multiplicativity?

What is known about these arithmetical functions?

Why doesn't $255 \times 255 \times 255 = 16777215$

Is there a recursive formula for Euler's Totient function

How to prove that a function on a quotient set $\mathbb{Z}/n\mathbb{Z}$ is well defined?

Some convincing reasoning to show that to prove that Ramanujan tau function is multiplicative is very difficult

Euler's totient and divisors count function relationship when $[(\frac{\varphi(n)}{2}+1)\cdot(\frac{\tau(n)}{2}+1)] = n$

For any positive integer $n$, show that $\sum_{d|n}\sigma(d) = \sum_{d|n}(n/d)\tau(d)$

Series of the totient function

Let $f:\Bbb{N}\to\Bbb{C}$ denotes the indicator function of squares. Express it in terms of Mobious function $\mu$.

The sigma function (sum of divisors) multiplicative proof

Let $(a_n)$ be a strictly increasing sequence of positive integers such that: $a_2 = 2$, $a_{mn} = a_m a_n$ for $m, n$ relatively prime.

How to find the nearest multiple of 16 to my given number n

If $(a,k)=(b,m)=1$, prove that $(ab,km)=(a,m)(b,k)$.

Mean Value of a Multiplicative Function close to $n$ in Terms of the Zeta Function

Very elementary proof of that Euler's totient function is multiplicative

new addition and new multiplication x ⊕ y = x + y − 1, x ⊗ y = x + y − xy on set Z, prove the set Z equipped with these 2 new operation

Euler's Totient function $\forall n\ge3$, if $(\frac{\varphi(n)}{2}+1)\ \mid\ n\ $ then $\frac{\varphi(n)}{2}+1$ is prime

Prove that if $d \mid n \in \mathbb{N}$, then $\varphi(d) \mid \varphi(n)$.

Necessary and sufficient condition to be completely multiplicative