# The Arithmetic Derivative (Part 4)

Updated: Oct 19, 2021

__What do the differential equations mean?__

Usually, we are motivated to study differential equations by situations in everyday life, nature, physics, and math. What motivates studying this arithmetic derivative?

The first answer is that it's a small adjustment to something much more commonly studied called a **derivation** in differential geometry. But focusing on the fact that we're defining

**on the natural numbers, the real motivation is what it tells us about primes and numbers in general. In a sense, by setting it up so that**

*D***for any prime**

*D(p) = 1***, we've DESIGNED the arithmetic derivative to tell us something about primes. So...what does it say?**

*p*### Infinitude of primes

We showed in the __second part__ of this series that if we assume we only have finitely many primes, then the derivative of their product is not divisible by any of those primes, so we must have more primes. Any finite list won't do, so we must have infinitely many primes.

### Asymptotic number of primes

Once we started investigating the size of ** S(m) = {n** |

**, we found that for**

*D(n) = m}***, the size of the solution set is finite and bounded by**

*m > 1***. If**

*(m/2)^2***, then**

*m = 1***is the set of primes numbers, is infinite. So it's useful to think of**

*S(m)**asymptotic size,*meaning we give a growth rate for the size of

**. The**

*S(1)*__Prime Number Theorem__tells us that this growth rate is

**.**

*N/log(N)*### Twin Primes

A long-standing question in math is whether there exist infinitely many prime numbers ** p** with

**also prime. Though unsolved, a big breakthrough by Yitang Zhang in 2013 showed that there are infinitely many primes**

*p - 2***with**

*p***also prime! My favorite fact is that the sum of the reciprocals of twin primes**

*p - 70000000***, despite the sum of reciprocals of all primes**

__CONVERGES__**DIVERGING**. To formulate twin primes with the arithmetic derivative, consider

If such an ** n** exists, then

**, so**

*D(D(n)) = 1***for some prime**

*D(n) = p***. Notice that if**

*p***,**

*n = 2(p-2)*### D(2(p-2)) = 2D(p-2) + (p-2)D(2)

If ** p** is a twin prime, then

**is prime, and**

*p - 2***, so**

*D(p - 2) = 1*### D(2(p-2)) = 2 + (p-2) = p

Great! So if ** p** is a twin prime, then

**satisfies our second-order differential equation.**

*n = 2(p-2)*If there are infinitely many twin primes, then the solution set is infinite, and we can again give asymptotics for its size, proportional to *N/log(N)^2.*

### Irrationality of sqrt(2)

A number is called a ** rational number** if it can be written as the ratio of two whole numbers. If it can't, then it's called irrational. A nice proof that appears in every discrete math course is proving that the square root of 2,

**, is irrational. We can prove this with the arithmetic derivative as well! It starts similarly as the usual method and is by**

*sqrt(2)*__contradiction__:

Suppose that we had whole numbers ** a,b** so that

**in reduced form, meaning**

*sqrt(2) = a/b,***and**

*a***share no factors. Another way to say it is that**

*b***and**

*a***are coprime**

*b*

*.*Rearranging gives

*2b^2 = a^2*

*2b^2 = a^2*

Now let's apply ** D**,

### D(2b^2) = D(a^2)

### 2D(b^2) + b^2 = 2aD(a)

Remember that ** a** and

**are coprime, meaning that at least one must be odd. The righthand-side**

*b***is clearly even, so since**

*2aD(a)***is even, this implies**

*2D(b^2)***must be even as well.**

*b^2*This means ** b** is even, so we can assume that

**is the one that is odd. But the very first equation**

*a***implies that**

*2b^2 = a^2***is even, which means**

*a^2***is even. A contradiction!**

*a***Thank you for reading!**

**Jonathan Gerhard**

**J****Math****G**

**J**

**Math**

**G**