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.
Contents |
For natural numbers defined as follows:
To coincide with the Leibniz rule is defined to be , as is . Explicitly, assume that
where are distinct primes and are positive integers. Then
The arithmetic derivative also preserves the power rule (for primes):
where is prime and is a positive integer. For example,
The sequence of number derivatives for k = 0, 1, 2, ... begins (sequence A003415 in OEIS):
E. J. Barbeau was the first to formalize this definition. He extended it to all integers by proving that 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 are allowed to be arbitrary rational numbers.
E. J. Barbeau examined bounds of the arithmetic derivative. He found that the arithmetic derivative of natural numbers is bounded by
where k is the least prime in n and
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 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.
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.