# Tagged Questions

For questions on arithmetic functions, a real or complex valued function $f(n)$ defined on the set of natural numbers.

28 views

### Standard name or notation for the “even part” of an integer?

\begin{align} 0 & \mapsto 0 \\ 1 & \mapsto 0 \\[6pt] 2 & \mapsto 2 \\ 3 & \mapsto 2 \\[6pt] 4 & \mapsto 4 \\ 5 & \mapsto 4 \\[6pt] 6 & \mapsto 6 \\ 7 & \mapsto 6 \\ ...
248 views

### Can an odd perfect number be divisible by 101?

Preamble - This question is an offshoot from the following earlier questions here at MSE: Can an odd perfect number be divisible by 825? Can an odd perfect number be divisible by 165? Odd perfect ...
16 views

16 views

### Can you analyze this identity involving the sum of divisors function and $rad(n)=\prod_{p\mid n}p$?

Let $\sigma(n)$ the sum of divisors function, then by Mobius inversion formula $$\sigma(n)=n-\sum_{\substack{d\mid n,d<n}}\sigma(d)\mu\left(\frac{n}{d}\right),$$ and since this function is ...
9 views

### Lagarias and Robin theorems versus multiplicative property

If I use for example Robin's theorem, see here in the section Growth of arithmetic functions, or Lagarias equivalence, see (5) here has sense ask us what is the more sharp inequality for ...
149 views

### On the indivisibility of odd perfect numbers by small numbers

A good day to everyone! This question is an offshoot of the following MSE posts: Odd perfect number divisors Can an odd perfect number be divisible by $101$? My question is as follows: Is ...
785 views

36 views

73 views

### Derivatives, discrete and continuous, of $(1/\sqrt{n})\cos (t\log n)$ and $(1/\sqrt{n})\sin (t\log n)$ and Cauchy-Riemann equations

For any arithmetical function $f(n)$, we define its derivative to be $f'(n)=f(n)\cdot \log n$ for $n\geq 1$ (see for example [1], page 45 or Wikipedia). Fact. The functions ...
71 views

### Sums of the form $\sum_{d|n} x^d$

Let $$S(x,n) = \sum_{d|n} x^d, n \in \Bbb N$$ Do these sums appear in the literature? What are they called if they do and what is known about them?
### On $\sum_{d|n}(\mu(n/d)\sigma_0(d)/2)\log d$, where $\sigma_0(n)$ and $\mu(n)$ are, respectively, the number of divisors and Möbius functions
Let $f(n)=\sum_{d\mid n}\log d$. Then using Möbius inversion formula (see Wikipedia) and $\prod_{d\mid n}d=n^{\sigma_{0}/2}$ (see [1], page 47) where $\sigma_{0}(n)$ is the number of positive divisors ...