# Arithmetic derivative

In number theory, the Lagarias arithmetic derivative, or number derivative, is a function defined for integers, based on prime factorization, by analogy with the product rule for the derivative of a function that is used in mathematical analysis.

There are many versions of "arithmetic derivatives", including the one discussed in this article (the Lagarias arithmetic derivative), such as Ihara's arithmetic derivative and Buium's arithmetic derivatives.

## Definition

For natural numbers the arithmetic derivative is defined as follows:

• $p'\;=\;1$  for any prime $p$ .
• $(pq)'\;=\;p'q\,+\,pq'$  for any $p{\textrm {,}}\,q\;\in \;\mathbb {N}$  (Leibniz rule).

E. J. Barbeau was most likely the first person to formalize this definition. He also extended it to all integers by proving that $(-x)'\;=\;-(x')$  uniquely defines the derivative over the integers. Barbeau also further extended it to rational numbers, showing that the familiar quotient rule gives a well-defined derivative on Q:

$\left({\frac {p}{q}}\right)'={\frac {p'q-pq'}{q^{2}}}\ .$

Victor Ufnarovski and Bo Åhlander expanded it to certain irrationals. In these extensions, the formula above still applies, but the exponents $e_{i}$  are allowed to be arbitrary rational numbers.

## Elementary properties

The Leibniz rule implies that $0'=0$  (take $p=q=0$ ) and $1'=0$  (take $p=q=1$ ).

The power rule is also valid for the arithmetic derivative. For any integers p and n ≥ 0:

$(p^{n})'=np^{n-1}p'.$

This allows one to compute the derivative from the prime factorisation of an integer, $x=p_{1}^{n_{1}}\cdots p_{k}^{n_{k}}$ :

$x'=\sum _{i=1}^{k}n_{i}p_{1}^{n_{1}}\cdots p_{i-1}^{n_{i-1}}p_{i}^{n_{i}-1}p_{i+1}^{n_{i+1}}\cdots p_{k}^{n_{k}}=\sum _{i=1}^{k}{\frac {n_{i}}{p_{i}}}x.$

For example:

$60'=(2^{2}\cdot 3\cdot 5)'=\left({\frac {2}{2}}+{\frac {1}{3}}+{\frac {1}{5}}\right)\cdot 60=92,$

or

$81'=(3^{4})'=4\cdot 3^{3}\cdot 3'=4\cdot 27\cdot 1=108.$

The sequence of number derivatives for k = 0, 1, 2, ... begins (sequence A003415 in the OEIS):

$0,0,1,1,4,1,5,1,12,6,7,1,16,1,9,\ldots$

## Related function

The logarithmic derivative $\operatorname {ld} (x)={\frac {x'}{x}}$  is a totally additive function: $\operatorname {ld} (x\cdot y)=\operatorname {ld} (x)+\operatorname {ld} (y).$

## Inequalities and bounds

E. J. Barbeau examined bounds of the arithmetic derivative. He found that the arithmetic derivative of natural numbers is bounded by

$n'\leq {\frac {n\log _{p}n}{k}}$

where p is the least prime in n and

$n'\geq sn^{\frac {s-1}{s}}$

where s is the number of prime factors in n. In both bounds above, equality always occurs when n is a perfect power of 2, that is $n=2^{m}$  for some m.

Alexander Loiko, Jonas Olsson and Niklas Dahl found that it is impossible to find similar bounds for the arithmetic derivative extended to rational numbers by proving that between any two rational numbers there are other rationals with arbitrary large or small derivatives.

## Order of the average

We have

$\sum _{n\leq x}{\frac {n'}{n}}=T_{0}x+O(\log x\log \log x)$

and

$\sum _{n\leq x}n'=(1/2)T_{0}x^{2}+O(x^{1+\delta })$

for any δ>0, where

$T_{0}=\sum _{p}{\frac {1}{p(p-1)}}.$

## Relevance to number theory

Victor Ufnarovski and Bo Åhlander have detailed the function's connection to famous number-theoretic conjectures like the twin prime conjecture, the prime triples conjecture, and Goldbach's conjecture. For example, Goldbach's conjecture would imply, for each k > 1 the existence of an n so that n' = 2k. The twin prime conjecture would imply that there are infinitely many k for which k'' = 1.