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

learn more… | top users | synonyms

0
votes
2answers
14 views

Offset a range of numbers

I want to find an equation to offset a range of numbers by a given amount. I'm not sure if I am using the term offset correctly. Lets say the range is from 0 - 1 and I want it to be offset by .25 : 0 ...
2
votes
1answer
76 views

Prime Factorization and Number Theory

Prime factorization of $n$ is $$n = p_1^{a_1}p_2^{a_2}p_3^{a_3}\cdots p_k^{a_k}$$ Let $f(n) = p_1^{e_1}p_2^{e_2}p_3^{e_3}\cdots p_k^{e_k}$ where $e_k=a_k$ if $p_k|a_k$, else $e_k=a_k-1$ I want to ...
1
vote
1answer
75 views

Prove $\lambda(n)=\sum_{d^2|n}\mu(n/d)^2$ and $\mu^2(n)=\sum_{d^2|n}\mu(d)$

$\lambda(n)$= $\sum_{d^2|n}$ $\mu(n/d)^2$ and $\mu^2(n)$= $\sum_{d^2|n}$ $\mu(d)$ Having a little bit of trouble here.Can I use the fact that $\sum_{d|n}\lambda(n)$ is a characteristic function for ...
1
vote
1answer
49 views

Arithmetic progressions that generate an infinite number of powers of 2?

For an arithmetic progression of the form $a_i = ki, i \in \mathbb{N}$, the question is trivial - if $k$ is a power of 2, then the progression will generate an infinite number of powers of 2, and no ...
0
votes
1answer
24 views

If an arithmetic function has a strong logarithmic mean value, then it has an ordinary mean value.

Say that an arithmetic function f has a strong logarithmic mean value A, and write L(f) = A, if f satis es an estimate of the form \begin{align} \sum\limits_{n=1}^{x}\frac{f(n)}{n} = Alog(x) + B + ...
0
votes
1answer
24 views

Multiplicative Function Property

Suppose $f$ is an arithmetic function. Does the property $f(1) = 1$ if $f$ is multiplicative? Or is it only when $f$ is completely multiplicative?
0
votes
1answer
20 views

On the sets $\{\dfrac {\phi(n+1)}{\phi(n)} : n\in \mathbb Z^+\}$ and $\{\dfrac {\phi(n)}{n} : n\in \mathbb Z^+\}$

How to show that the set $\{\dfrac {\phi(n+1)}{\phi(n)} : n\in \mathbb Z^+\}$ is dense in $\mathbb R^+$ ? Also that the set $\{\dfrac {\phi(n)}{n} : n\in \mathbb Z^+\}$ is dense in $(0,1)$ ?
9
votes
0answers
146 views

Elementary references on Robinson Arithmetic, Prim. Recursive fns etc.

I'm in the middle of revising my freely available and much-downloaded introductory notes Gödel Without (Too Many) Tears. (They are a sort of cut down version of part of my Gödel book, and I'm ...
7
votes
0answers
127 views

Is the Euler function $\phi$ constant in arbitrarily large intervals?

Is it true that for every $k \in \mathbb{N}$ there exists a natural number $x$ such that $\phi(x)=\phi(x+1)=\cdots=\phi(x+k)$, where $\phi$ is the Euler's totient function? I thought about this ...
5
votes
0answers
168 views

Summation of a function 2

Let $n$ is a positive integer. $n = p_1^{e_1}p_2^{e_2}\cdots p_k^{e_k}$ is the complete prime factorization of $n$. Let me define a function $f(n)$ $f(n) = p_1^{c_1}p_2^{c_2}\cdots p_k^{c_k}$ where ...
5
votes
0answers
135 views

Is the application of $\mu$ on $P_x(s)^k$ analogous to the differentiation $\frac{d^k f(\lambda) }{d\lambda^k}\biggr|_{\lambda=0}$?

Let me start with the following on elementary symmetric polynomials: The elementary symmetric polynomials appear when we expand a linear factorization of a monic polynomial: we have the identity ...
4
votes
0answers
329 views

Numbers $n$ such that Mertens' function is zero.

OEIS (A028442) lists the Numbers n such that Mertens' function $$ M(n)=\sum_{k=1}^n\mu(k) $$ is zero: 2, 39, 40, 58, 65, 93, 101, 145, 149, 150, 159, 160, 163, 164, 166, 214, 231, 232, 235, 236, ...
3
votes
0answers
123 views

To prove $\phi(mn)\phi(d)=\phi(m)\phi(n)d$ without explicitly computing the phi function values

If $m,n$ are positive integers with g.c.d.$(m,n)=d$ , then we can show by explicitly computing respective totients that $\phi(mn)\phi(d)=\phi(m)\phi(n)d$, I want to know, is there any more elegant way ...
3
votes
0answers
77 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 ...
3
votes
0answers
109 views

Does the Fourier matrix $F_n$ represent a (tensor) multiplicative function?

At "Complex Hadamard Matrices", I found that, two Kronecker (tensor) products of Fourier matrices $k_1$ and $k_2$ are equivalent, if and only if $k_2$ can be obtained from $k_1$ by a combination of an ...
3
votes
0answers
76 views

Approximate how the Numbers $n$ such that Mertens' function is zero grow.

Is it possible to approximate how the "Numbers $n$ such that Mertens' function is zero" grow?
2
votes
0answers
52 views

how to show $\lim \sup_{n \to \infty} \frac{\phi(n+1)}{\phi(n)}= \infty$ and $\lim \inf_{n \to \infty} \frac{\phi(n+1)}{\phi(n)}= 0$?

Let $\phi (n)$ be the Euler's totient function . Thenhow to prove that the set $\{\dfrac{\phi(n+1)}{\phi(n)}: n \in \mathbb Z^+\}$ is unbounded above that is how to show $\lim \sup_{n \to \infty} ...
2
votes
0answers
84 views

Smallest prime p with N a quadratic residue mod p

Let $N$ be a square-free number equal to 2 or 3 $(\mod 4)$. Let $P(N)$ be the first odd prime, not a factor of $N$, for which $N$ is a quadratic residue. On average, $N$ would be a non-residue for ...
1
vote
0answers
65 views

What's is the name of this function?

A function, $f:\mathbb{N}\to\mathbb{N}$, is defined in the following way, \begin{equation} f(n)=\#\{m\mid m\leq n\text{ and there does not exists any integer }m'>m\text{ such that }m\text{ divides ...
1
vote
0answers
36 views

Bezout Coefficient for polynomials in sage?

I want to find the bezout coefficient for those 2 polynomials : $f = 1+x-x^2-x^4+x^5$ and $g = -1+x^2+x^3-x^6$ when I use the gcd function in sage the output is : ...
1
vote
0answers
61 views

Summing the reciprocal of $\phi(n)^2$

I am currently reading Vaughan's book 'The Hardy-Littlewood method' and am working on exercise 3.3 (page 37). I have tried working through a special case but that didn't help either. More concretely, ...
1
vote
0answers
31 views

Number of triples $(a, b, c)$ with $1 \leq a,b,c \leq n$ which are coprime ($gcd(a,b,c)=1$)

Number of ordered triples $(a, b, c)$ with $gcd(a, b, c) = 1$ and $1 \leq a, b, c \leq n$ can be computed using the following formula: $$ C(n) = \sum_{k=1}^n\mu(k) \left \lfloor \frac{n}{k} \right ...
1
vote
0answers
26 views

gcd of product of exponents of prime factors and product of prime factors

Let $n = \prod\limits_i p_i^{k_i}$. I want to express $$ \gcd(\prod\limits_i k_i, \prod\limits_i p_i) $$ as an arithmetic function (i.e get rid of gcd). Is that possible? Thanks!
1
vote
0answers
66 views

A challenge question in elementary number theory!

Find an expression for the following sum: $$\sum_{i:(i,n)=1}(i-1,n)$$ I guess that this sum equals to $\phi(n)d(n).$
1
vote
0answers
84 views

sum over primes involving divisor function (variation of the Titchmarsh divisor problem)

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 function?
1
vote
0answers
40 views

All all hypo-multiplicative functions linear combinations of quasi-multiplicative functions?

A function $f(n)$ is multiplicative if, for all coprime $m$ and $n$, $f(m)f(n)=f(mn).$ It is called quasi-multiplicative by many authors if $f(m)f(n)=f(1)f(mn)$, and the two coincide when $f(1)=1.$ ...
1
vote
0answers
96 views

Multiple Dirichlet convolutions

I have been playing around with Dirichlet convolutions. As a reminder, take two arithmetic functions $f,g$, then their Dirichlet convolution is defined as the arithmetic function with: $(f\star g)(n) ...
1
vote
0answers
66 views

Summation of no. of divisors

Let $d(n)$ = no. of divisors of $n$ and $(d(n))^2$ = square of no. of divisors of n. Let $$S(N) = \sum_{n=1}^{N} d(n)$$ and $$S_2(N) = \sum_{n=1}^{N}(d(n))^2$$ $$S(N) = ...
1
vote
0answers
59 views

Relation between Dirichlet convolution and Bell series and convolution of functions and the Fourier transform?

We define the Dirichlet convolution of two arithmetic functions $a,b:\mathbb{N}\to\mathbb{C}$ to be $$ (a*b)(n)=\sum_{d\mid n}a(d)b\left(\frac{n}{d}\right). $$ Given a prime $p$, we define the Bell ...
1
vote
0answers
171 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 ...
1
vote
0answers
120 views

Generalizing a result on sums involving Euler's function

Motivation: It's known that there is a constant $0<K$ such that for any natural number $N$, $KN\leq \frac{\varphi(1)}{1}+\frac{\varphi(2)}{2}+\cdots+\frac{\varphi(N)}{N}$ (with $\varphi$ being ...
0
votes
0answers
37 views

Order of operations for log transformation

I am working with a large dataset of positive values with a positive skew. I will be using a Ln transformation in SPSS to normalize my dataset. However, I am not sure of the order of operations. For ...
0
votes
0answers
48 views

What is the inverse of $f(x)=x^{x^x}$?

I'm curious to find the inverse of $ f(x)=x^{x^x} $ As an added extra, I'm already familiar with the Lambert Product Log function.