The Full Wiki

More info on Arithmetic derivative

Arithmetic derivative: Wikis


Note: Many of our articles have direct quotes from sources you can cite, within the Wikipedia article! This article doesn't yet, but we're working on it! See more info or our list of citable articles.


From Wikipedia, the free encyclopedia

In number theory, the 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.


For natural numbers 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^{e_i-1}\cdots p_k^{e_k} = \sum_{i=1}^k \frac{e_i}{p_i} x.

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 the first to formalize this definition. He 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. Victor Ufnarovski and Bo Åhlander expanded it to certain irrationals. In these extensions, the formula above still applies, but the exponents ei are allowed to be arbitrary rational numbers.

Relevance to number theory

Ufnarovski and Å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.




Got something to say? Make a comment.
Your name
Your email address