All Questions
Tagged with arithmetic-functions nt.number-theory
108 questions
13
votes
0
answers
406
views
Is this arithmetic function strictly positive and unbounded?
As requested by Mathphile, since there have been efforts but no complete solutions to some questions raised when this question was asked on MSE, and since we think that here the question is more ...
user153451
7
votes
1
answer
365
views
How to explain this property of totient?
I am running a program to search for solutions of $$\varphi(pm+1)=\varphi(pm+p+1).$$
So far, for $m=1,\ldots,327$ solutions have been found (some relatively large).
(in the body of the question, $p$ ...
user153451
0
votes
0
answers
143
views
Given $\,m=\prod_k {p_k}^{\alpha_k}\,$ and the function $\,g(m)=\sum_k \alpha_k(p_k-1)^2$, find all solutions of the equation $\,g(2n)=n$
Let's consider the unique decomposition of a natural number $\,m\,$ into its prime factors:
$$\prod_k {p_k}^{\alpha_k}$$
Then, let's define the following arithmetic function (completely additive) $\,g:...
- 1,008
7
votes
1
answer
231
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 ...
1
vote
0
answers
73
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 ...
0
votes
0
answers
219
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 [1]) ...
7
votes
1
answer
743
views
Generalization of a problem, involving radicals and the floor function, proposed by Ramanujan to the Journal of the Indian Mathematical Society
The section Solved problems from the Wikipedia Floor and ceiling functions shows several problems proposed by Ramanujan ([1]). The purpose of this post, if possible, is try to get the generalization ...
11
votes
0
answers
238
views
Strong uniqueness of Euler's totient function
Let $f:\mathbb N\to \mathbb C$ be some arithmetical function. Define $\varphi_f(n)$ by the following formula:
$$
\varphi_f(n)=\sum_{\substack{k\leq n \\ (k,n)=1}}f(k).
$$
In other words, $\varphi_f(...
- 7,193
4
votes
1
answer
558
views
A curious conjecture: $\{\varphi(m^2)/\varphi(n^2):\ m,n=1,2,3,\ldots\}=\{r>0:\ r\in\mathbb Q\}$
Let $\varphi$ denote Euler's totient function. It is easy to see that all those numbers
$$\varphi(n^2)=n\varphi(n)\ \ (n=1,2,3,\ldots)$$
are pairwise distinct.
I have the following surprising ...
- 15.6k
2
votes
0
answers
100
views
$\varphi(m+n)\mid n$ for some positive integer $n$
Let $\varphi$ be Euler's totient function.
If $p$ is a prime, then $\varphi(1+n)=n$ for $n=p-1$.
Question. Is it true that for each integer $m>1$ there is a positive integer $n\le m^2-m$ such that ...
- 15.6k
5
votes
0
answers
229
views
Can we write each positive integer as $x^2+y^2+\varphi(z^2)$?
As odd squares are congruent to $1$ modulo $8$, any integer of the form $4^k(8m+7)$ with $k,m\in\mathbb N=\{0,1,2,\ldots\}$ cannot be written as the sum of three squares.
To avoid such congruence ...
- 15.6k
15
votes
1
answer
956
views
Is the sum $\sum_{d\mid n}\frac1{d+1}$ never integral?
Recall that a positive integer $n$ is a perfect number if and only if
$$\frac{\sigma(n)}n=\sum_{d\mid n}\frac1d=2.$$
QUESTION: Is my following conjecture true?
Conjecture. (i) We have $\sum_{d\mid ...
- 15.6k
6
votes
2
answers
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. ...
- 26.9k
12
votes
0
answers
1k
views
Euler's totient function and Riemann hypothesis
I am looking for an upper-bound of the Euler's totient function $\varphi$ which would be equivalent to the Riemann hypothesis (RH). There is the following Nicolas' criterion about primorial numbers $...
3
votes
0
answers
132
views
Is there a way to reduce this problem to two variables through functions coming from arithmetic?
Consider following diophantine equation in $\mathbb Z[x,y,z]$ in three integer variables $x,y,z$
$$x^2+L(y,z)x+L_1(y)L_2(z)=0$$ where $L(y,z)$ is a non-homogeneous linear polynomial in $y,z$ and $L_1(...
- 13.9k
3
votes
4
answers
1k
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 ...
8
votes
1
answer
427
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.
- 11.3k
4
votes
1
answer
170
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 ...
- 12.3k
4
votes
1
answer
530
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 ...
- 12.3k
7
votes
1
answer
421
views
On $\varphi(m)\varphi(n)\equiv0\pmod{m+n}$
Euler's totient function $\varphi$ is multiplicative, and it plays important roles in number theory.
QUESTION: Is it true that for each integer $m>6$ we have $\varphi(m)\varphi(n)\equiv0\pmod{m+n}$...
- 15.6k
1
vote
0
answers
93
views
Existence of equation about the product of the divisor sum function
Let $\sigma_k(n)$ be the sum of the $k$-th powers of the positive divisors of $n$ and $\mu(n)$ be the Möbius function.
As Arithmetic function - Wikipedia mentioned, there is an equation that $$\...
- 123
2
votes
1
answer
532
views
The Euler's totient function and the product of distinct primes dividing $n$ versus the Heronian means
For integers $n\geq 1$ with $$\operatorname{rad}(n)=\prod_{\substack{p\mid n\\p\text{ prime}}}p$$ we denote the squarefree kernel or radical of an integer $n$ (see if you want this Wikipedia). And $\...
user75829
3
votes
0
answers
238
views
Is there a closed form for the discrete convolution of $\sigma_1$ and $\sigma_2$?
I am trying to find a closed form for the following sum:
$$\sum_{k = 1}^{n-1}\sigma_1(k) \sigma_2(n-k)$$
where $\sigma_i$ is the sum of divisors and $\sigma_2$ is the sum of squares of divisors.
...
- 211
11
votes
3
answers
703
views
Evaluating the sum of $kl^2$ over $p,q,k,l$ such that $pk +ql = n$
I have come across the following sum:
$$\sum_{\substack{p, q, k, l \in \mathbb{N} \\ k > l \\ pk + ql = n}}kl^2$$
and I am trying to simplify it, hoping to get a nice formula in terms of $n$ and ...
- 211
4
votes
1
answer
322
views
A special kind of multiplicative function $f: \mathbb N \to \mathbb N$ such that $f(p)=p+k$ for all odd prime $p$, where $k>1$ is a fixed odd integer
For which odd positive integer $k$, can we find a multiplicative function $f: \mathbb N \to \mathbb N$ satisfying the following conditions :
$f(p)=p+k$ for all large enough odd prime $p$ and the set $...
user111524
8
votes
1
answer
659
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 ...
- 164
13
votes
2
answers
1k
views
A mystery sequence
This question arose from the recent one, roots of a polynomial linked to mock theta function?. Let
$$
g(x):=\sum_{k=0}^\infty x^k\prod_{j=1}^{k-1}(1 + x^j)^2\\=1+x+x^2+3 x^3+4 x^4+6 x^5+10 x^6+15 x^7+...
- 18.4k
0
votes
0
answers
202
views
Representation of a number as a sum of co-prime numbers
Conventions
We will call the following product the canonical expansion of $a$:
$$a = \prod\limits_{p_i\in\mathbb{P}}p_i^{\alpha_i}.$$
If $a$ and $b$ are co-prime we write
$$a \perp b.$$
$\beth$-...
- 251
1
vote
0
answers
90
views
An arithmetic function involving arbitrary (but fixed) number of divisors
I need at least basic information about generating functions of the following class of arithmetic functions, grouped by levels $k$.
Fix some $k$ and some family $\varepsilon_*=(\varepsilon_\sigma)_{\...
- 18.4k
5
votes
2
answers
314
views
Congruences for the non-divisors of Euler's $\phi(n)$
If $n$ is composite, then $\phi(n) < n-1$: hence, there is at least one number $d$ which does not divide $\phi(n)$ but divides$(n-1)$. We shall call $d$ the totient divisor of $n$. The purist will ...
- 5,470
5
votes
1
answer
392
views
Does anyone recognize this exponential sum?
For $a$, $b$ two integers, let $(a,b)$ denotes their gcd. We define the following exponential sum :
$$G_q(n):=\sum_{d|q,~(d,q/d)=1}{e^{2i\pi n\frac{dd'}{q}}}$$
for $n$ a non-negative integer and $q$ ...
- 1,479
1
vote
0
answers
256
views
On even almost perfect numbers other than powers of two
(Note: This question is an improved version of and has been cross-posted from this MSE post.)
Let $\sigma(x)$ denote the sum of the divisors of $x$. If $\sigma(x) = 2x - 1$, then we call $x$ an ...
9
votes
2
answers
740
views
Asymptotics of product of Euler's totient function (A001088)?
Conjecture:
\begin{align}
\lim_{n\to \infty } \, \frac{\left(\prod _{k=1}^n \phi (k)\right){}^{1/n}}{n}\sim 0.2059\text{...}
\end{align}
The numerical result from 100000 terms is:
My questions are:
...
- 690
6
votes
1
answer
2k
views
If $N = qn^2$ is an odd perfect number with $\gcd(q,n)=1$, is it possible to have $q + 1 = \sigma(n)$?
The title says it all.
Question
If $N = qn^2$ is an odd perfect number with Euler prime $q$ and $\gcd(q,n)=1$, is it possible to have $q + 1 = \sigma(n)$?
Heuristic
From the Descartes spoof, with ...
5
votes
2
answers
556
views
Are there multiplicative functions which are not rational?
Vaidyanathaswamy calls an arithmetic function rational if it is the convolution of some finite collection of functions which are either completely multiplicative or inverse to a completely ...
- 9,114
0
votes
1
answer
475
views
Sum of digits of a power [closed]
Are there any explicit formula for a sum of digits for a power in the given base? A problem to be specific: find a sum of digits for a number $2^{100}$ in the system with a base 5. In the system with ...
- 1,560
6
votes
1
answer
331
views
A question about $(0,1]$-valued multiplicative functions
Suppose $f:\mathbb{N}\to [0,1]$ is a multiplicative function (i.e. $f(nm)=f(n)f(m)$ whenever $m$ and $n$ are coprime). Suppose $f$ has non-zero mean, which means
$$
\lim_{N\to\infty}\frac{1}{N} \sum_{...
- 63
13
votes
1
answer
934
views
Is the set of multiplicatively even numbers thick?
A positive integer is multiplicatively even (odd) if, when decomposed into primes, the sum of the exponents is even (odd).
A subset of the integers is thick if it contains arbitrarily long intervals $\...
- 1,701
3
votes
0
answers
443
views
Infinite sums with Mobius Inversion : can we have uniform convergence of inversion formula?
My question is on Mobius inversion formula convergence/properties when used with infinite sums of function.
Lets consider (on $\mathbb{R}^{+}$):
$$S(x)= \sum\limits_{n=1}^{\infty} f(nx)$$
We call $...
- 1,199
1
vote
1
answer
170
views
Existence of arithmetic function satisfying a certain property
I was interested in an arithmetic function satisfying a certain property, I am not sure at the moment if such thing even exists or not. But I was wondering maybe I could get some hint or idea or input ...
- 579
2
votes
1
answer
281
views
sum over primes involving divisor function (variation of the Titchmarsh divisor problem)
This question was also asked on MSE.
Does there exist an asymptotic estimate for the following sum over primes
$$
\sum_{p\leq x} \frac{\tau(p-1)}{p}\;,
$$
where $\tau(n)=\sum_{d|n}1$ is the divisor ...
- 215
1
vote
0
answers
80
views
All all hypo-multiplicative functions linear combinations of quasi-multiplicative functions?
A function is called quasi-multiplicative by many authors if $f(m)f(n)=f(1)f(mn)$, a slight generalization of multiplicativity. (Basically a multiplicative function times a constant is a quasi-...
- 9,114
7
votes
0
answers
332
views
$n\varphi(n)\equiv 2\pmod{\sigma(n)}$ as a primality test
It is known from Subbarao, "On two congruences for primality" that $n>22$ is a prime iff $$n\sigma(n)\equiv 2\pmod{\varphi(n)},$$ where $\varphi(n)$ is Euler's function and $\sigma(n)$ is sum of ...
- 12.3k
0
votes
1
answer
314
views
Are all known $k$-multiperfect numbers (for $k > 2$) not squarefree?
I asked the following question in MSE four ($4$) days ago, but so far nobody has posted an answer.
The gist of the question is as follows:
Are all known $k$-multiperfect numbers (for $k > 2$...
1
vote
2
answers
199
views
What proportion of the positive integers satisfy $I(n^2) < (1 + \frac{1}{n})I(n)$, where $I(x)$ is the abundancy index of $x$?
Let $\sigma(x)$ denote the classical sum-of-divisors function, and let
$$I(x) = \frac{\sigma(x)}{x}$$
be the abundancy index of the positive integer $x$.
My question is this: What proportion of ...
7
votes
1
answer
1k
views
Menon’s identity
I also put this question in stackexchange, but remained unanswered. https://math.stackexchange.com/questions/506996/menons-identity
Let $G$ be a group of order $n$. Consider an action of $U_n$, the ...
- 801
2
votes
1
answer
301
views
What proportion of the positive integers satisfy $I(n) < \frac{2n}{n + 1} \leq I(n^2) < 2$?
Let
$$I(x) = \frac{\sigma(x)}{x}$$
be the abundancy index of the positive integer $x$. Note that $\sigma(x)$ is the classical sum-of-divisors function. For example,
$$\sigma(12) = 1 + 2 + 3 + 4 + ...
4
votes
0
answers
413
views
Maximal order of Hooley's Delta function?
There is a large literature on Hooley's
$$
\Delta(n)=\max_u\sum_{d|n,\ e^u\le d< e^{u+1}}1
$$
giving its normal and average order. What is known of its maximal order?
Clearly $\Delta(n)\le d(n)$ ...
- 9,114
2
votes
1
answer
1k
views
A formula combining Euler $\phi$ and $\gcd$
Let us fix a natural number $N>1$ and $a_1, \ldots, a_n$ natural numbers satisfying $0 \leq a_i < N$, with the property that $1+ \sum a_i$ is divisible by $N$. Let $\phi$ be the Euler totient ...
- 283
1
vote
5
answers
5k
views
The Inverse of the Euler Totient Function
How can we calculate the cardinality of the inverse of Totient function of any positive integer n ?
I tried going through this paper, but I couldn't understand the procedure.
Thanks
- 201