Arithmetic derivative

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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.

Remark: There are many verions of "Arithmetic Derivatives", there are the ones as in this article (Lagarias Arithmetic Derivative), Ihara's Arithmetic Derivative, and Buium's Arithmetic Derivatives.

Definition[edit]

For natural numbers the arithmetic derivative is defined as follows:

To coincide with the Leibniz rule 1' is defined to be 0, as is 0'. Explicitly, assume that

x = p_1^{e_1}\cdots p_k^{e_k}\textrm{,}

where p_1,\, \dots,\, p_k are distinct primes and e_1,\, \dots,\, e_k are positive integers. Then

x' = \sum_{i=1}^k e_ip_1^{e_1}\cdots p_{i-1}^{e_{i-1}}p_i^{e_i-1}p_{i+1}^{e_{i+1}}\cdots p_k^{e_k} = \sum_{i=1}^k e_i\frac{x}{p_i}.

The arithmetic derivative also preserves the power rule (for primes):

(p^a)' = ap^{a-1}\textrm{,}\!

where p is prime and a is a positive integer. For example,


\begin{align}
81' = (3^4)' & = (9\cdot 9)' = 9'\cdot 9 + 9\cdot 9' = 2[9(3\cdot 3)'] \\
& = 2[9(3'\cdot 3 + 3\cdot 3')] = 2[9\cdot 6] = 108 = 4\cdot 3^3.
\end{align}

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

0, 0, 1, 1, 4, 1, 5, 1, 12, 6, 7, 1, 16, 1, 9, ....

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{a}{b}\right)' = \frac{a'b-b'a}{b^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.

The logarithmic derivative \frac{n'}{n} is a totally additive function.

Average order[edit]

We have

 \sum_{n \le x} \frac{n'}{n} = T_0 x + O(\log x \log\log x)

and

 \sum_{n \le 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)}.

Inequalities and bounds[edit]

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_k n}{k}

where k 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 occurs only if 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.

Relevance to number theory[edit]

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.

References[edit]