The number-theoretical derivative of a natural number is defined recursively by the rule (Note the analogy to the product rule for derivatives in calculus.)
From this definition it follows, for instance, that if , then . An other concrete example is
We take number-theoretical derivatives to the next level and define the logarithmic derivative (We call this "logarithmic derivative" based on the Calculus equality, .)
For instance,
Question: What are the two smallest distinct natural numbers for which ? Give your answer as the sum .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
It is easy to check that the logarithmic derivative has the following properties: L ( p ) = p 1 ( p prime ) ; L ( a ⋅ b ) = L ( a ) + L ( b ) . Therefore if a number has prime factor decomposition n = ∏ p i , then L ( n ) = ∑ 1 / p i . Now we look for two numbers, with prime decompositions a = ∏ p i , b = ∏ q j such that ∑ p i 1 = ∑ q j 1 . If a and b have a common factor, we can simply divide it out to arrive at a smaller solution; therefore we may assume that the p i and q j are entirely different. The only way in which sums of reciprocals of coprime p i and q j can be equal is if each adds up to a who number, i.e. if the exponent of each p is a multiple of p , etc. This leads us to the solutions a = 2 2 = 4 , b = 3 3 = 2 7 , a + b = 3 1 . Indeed, L ( 4 ) = 2 2 = 1 ; L ( 2 7 ) = 3 3 = 1 .