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 versions of "Arithmetic Derivatives", there are the ones as in this article (Lagarias Arithmetic Derivative), Ihara's Arithmetic Derivative, and Buium's Arithmetic Derivatives.

For natural numbers the arithmetic derivative is defined as follows:

p
′
=
1
for any prime
p
.
(
a
b
)
′
=
a
′
b
+
a
b
′
for any
a
,
b
∈
N
(Leibniz rule).
The Leibniz rule (for
a
=
0
,
b
=
2
and
a
=
b
=
1
) implies that
0
′
and
1
′
are zero. Explicitly, assume that

x
=
p
1
e
1
⋯
p
k
e
k
,
where
p
1
,
…
,
p
k
are distinct primes and
e
1
,
…
,
e
k
are positive integers. Then

x
′
=
∑
i
=
1
k
e
i
p
1
e
1
⋯
p
i
−
1
e
i
−
1
p
i
e
i
−
1
p
i
+
1
e
i
+
1
⋯
p
k
e
k
=
∑
i
=
1
k
e
i
x
p
i
=
x
∑
i
=
1
k
e
i
p
i
The arithmetic derivative also preserves the power rule (for primes):

(
p
a
)
′
=
a
p
a
−
1
,

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

81
′
=
(
3
4
)
′
=
(
9
⋅
9
)
′
=
9
′
⋅
9
+
9
⋅
9
′
=
2
[
9
(
3
⋅
3
)
′
]
=
2
[
9
(
3
′
⋅
3
+
3
⋅
3
′
)
]
=
2
[
9
⋅
6
]
=
108
=
4
⋅
3
3
.
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, ....

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**:

(
a
b
)
′
=
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*
x
′
x
is a totally additive function.

We have

∑
n
≤
x
n
′
n
=
T
0
x
+
O
(
log
x
log
log
x
)
and

∑
n
≤
x
n
′
=
(
1
/
2
)
T
0
x
2
+
O
(
x
1
+
δ
)

for any δ>0, where

T
0
=
∑
p
1
p
(
p
−
1
)
.
E. J. Barbeau examined bounds of the arithmetic derivative. He found that the arithmetic derivative of natural numbers is bounded by

n
′
≤
n
log
k
n
k
where *k* is the least prime in *n* and

n
′
≥
s
n
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.

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*' = 2*k*. The twin prime conjecture would imply that there are infinitely many *k* for which *k*'' = 1.