# Questions tagged [arithmetic-functions]

The tag has no usage guidance.

76 questions
Filter by
Sorted by
Tagged with
57 views

### Write large $n$ as $n_1+\ldots+n_k\ (n_1<\ldots<n_k)$ with $\varphi(n_1),\ldots,\varphi(n_k)\in\{x^k:\ x\in\mathbb Z\}$

Let $\varphi$ denote Euler's totient function. QUESTION. Is it true that for each positive integer $k$ large integers $n$ can be written as $n_1+\ldots+n_k$ with $n_1,\ldots,n_k$ distinct positive ...
66 views

### On the equation that involves the Dedekind psi function $\psi(x)=n$ with unique solution $x$, for a fixed integer $n\geq 1$

The Dedekind psi function is defined for a positive integer $m>1$ as $$\psi(m)=m\prod_{\substack{p\mid m\\p\text{ prime}}}\left(1+\frac{1}{p}\right)\tag{1}$$ with the definition $\psi(1)=1$. See ...
110 views

219 views

148 views

### The asymptotic of $|\{1\leq n\leq x|\gcd(n,S(n))=1\}|$, with $S(n)$ the sum of remainders, and get idea for other miscellany problem

Let $n\geq 1$ be an integer. In this post we denote the sum of remainders function as $$S(n)=\sum_{k=1}^n n \bmod k,$$ for example $S(1)=S(2)=0+0$ and $S(5)=0+1+2+1+0=4$. In the literature there are ...
41 views

### On a type of equations that involve certain multiplicative functions and polynomials, in relation to their number of solutions

Past weekend I was interested in the sequence A058891 from the On-Line Encyclopedia of Integer Sequences, from this, inspired by the equation due to Benoit Cloitre (2002) that shows the comments, I ...
183 views

### On an inequality involving the Lambert $W$ function and the sum of divisors function

Let $W(n)$ be the principal/main branch of the Lambert $W$ function (this is the Wikipedia related to this special function). I was inspired in Robin equivalence to the Riemann hypothesis (see ) ...
67 views

### Alternating series of arithmetic function values

Some time ago I asked about alternating sums like $\sum_{n\leq x}(-1)^n \phi(n)$ where $\phi(n)$ is Euler's totient and the similar sum involving $\sigma(n)$ where $\sigma(n)=\sum_{d|n}d.$ Certain ...
60 views

### Prove that the Mertens function is invariant under matrix inversion for $n>3$

Consider the lower triangular matrix $T$ with the definition: $n \leq3 :$ $$T(n, 1)=1$$ $n>3:$ $$T(n,1)=x_n$$ $n \geq k:$ $n \leq 3:$ $$T(n,k)=1$$ $n \geq k:$ $n>3:$ $k=2 \text{ or } k=3:$ ...
155 views

61 views

### Uniformity in Wirsing's Mean Value Theorems

In two important papers of Wirsing, namely "Das asymptotische Verhalten von Summen über multiplikative Funktionen" (1961) and its follow up (1967), several results on mean values of multiplicative ...
2k views

### Does this multiplicative function have a name? If so, what is known about it?

It is well-known that the Euler $\phi$-function is multiplicative: that is, for co-prime positive integers $m,n$ we have $\phi(mn) = \phi(m)\phi(n)$. Thus it is defined by its values on prime powers. ...
933 views

380 views

### A conjecture regarding odd perfect numbers

(Note: I asked this question in MSE this June 2018 but did not receive any responses there. I have therefore cross-posted it here, hoping that it gets answered.) Let $\sigma(z)$ denote the sum of ...
358 views

### Goldbach's conjecture for the Liouville function

Is it true that for every even integer $N > 2$, there exist positive integers $a,b$ such that $a + b = N$ and $\lambda(a) = \lambda(b) = -1$ ? Here $\lambda$ is the Liouville function.
151 views

### The number of solutions of the equation $ax_1x_2+by_1y_2=n$

The equation $x_1x_2+y_1y_2=n$ is well-studied (Ingham, Heath-Brown, Deshouillers & Iwaniec, Ismoilov) because it arises in an additive divisor problem. The number of solutions in positive ...
435 views

### Reference for inequality for $\sum\limits_{d \mid n}\frac{\log d}{d}.$

Let $f(n)=\sum\limits_{d \mid n}\frac{\log d}{d}.$ It is not hard to see that $f(n)\ll(\log\log n)^2$. Is there any reference for this inequality? EDT 1: A possible answer is Analysis of the ...
145 views

250 views

84 views

### Name and theory of multi-valued functions $F:\mathbb{N}^k \rightarrow \mathbb{N}^l$

In computability theory there are considered mostly single-valued functions $f:\mathbb{N}^k \rightarrow \mathbb{N}$. (Let $\mathbb{N}$ be a placeholder for $\mathbb{N}$ or any initial segment $[0,n]$ ...
136 views

### Tighter upper bound for $\sum_{i=1}^kA_i\log(\frac{A_i}{e})$

What is the tightest upper bound one can obtain for the following expression $$\sum_{i=1}^kA_i\log(\frac{A_i}{e})$$ subject to $\sum_{i = 1}^k A_i = C$ in terms of $C$ and $k$? A very loose upper ...
347 views

### The importance of relations between automorphic forms and arithmetic functions

As I understand things, one of the classical reasons to care about modular forms was their relation to interesting arithmetic functions/counting questions, i.e. on sums of squares and partitions. When ...
961 views