Dirichlet series
Dirichlet series is like counting things in a special way. Let's pretend you have a big jar of marbles and you want to count them. You could take them out one by one and count them, but that would take a long time if you have many marbles.
Instead, you can count them by colors. Let's say you have red, blue, yellow and green marbles. You can count how many of each color you have and write it down in a table:
color | count
------|------
red | 10
blue | 5
yellow| 12
green | 7
This is kind of what Dirichlet series does. Instead of counting marbles, it counts numbers. But not just any numbers, special numbers that have interesting properties.
You see, some numbers can be written as the product of two smaller numbers. These are called composite numbers. For example, 6 is composite because it's 2 times 3. But some numbers can only be divided by themselves and 1, these are called prime numbers. For example, 7 is prime because it can only be divided by 1 and 7.
So if we want to count how many prime numbers there are, we can use Dirichlet series. We write down a special function that takes a prime number as input and outputs a number we can add up. This function is called a Dirichlet series.
Here's what it looks like:
s(n)=sigma(k=1 to infinity)ƛ(k)/k^n
Don't worry about the fancy symbols, they just mean that we add up a bunch of numbers, each of which has a special property. The ƛ(k) is called the Liouville function, and it's defined as follows:
ƛ(n)={ (-1)^r if n is the product of r distinct primes, 0 otherwise}
This means that if n is composite (the product of two or more distinct primes), then ƛ(n) is either 1 or -1 depending on how many primes it has. If it has an even number of primes, ƛ(n) is 1. If it has an odd number of primes, ƛ(n) is -1. If n is a prime, then it only has one distinct prime, and ƛ(n) is -1.
So let's say we want to count how many primes there are up to a certain number, say 100. We plug in the function for s(n), which is:
s(n)=sigma(k=1 to infinity)ƛ(k)/k^n
and we add up the values of s(1), s(2), s(3), ..., s(100). This will give us a number, which tells us how many primes there are up to 100.
Of course, this is just a simplified example, and there are many more complex calculations you can make with Dirichlet series. But the basic idea is the same: you take a special function that assigns a value to each number, and you add up these values to count things in a clever way.
Instead, you can count them by colors. Let's say you have red, blue, yellow and green marbles. You can count how many of each color you have and write it down in a table:
color | count
------|------
red | 10
blue | 5
yellow| 12
green | 7
This is kind of what Dirichlet series does. Instead of counting marbles, it counts numbers. But not just any numbers, special numbers that have interesting properties.
You see, some numbers can be written as the product of two smaller numbers. These are called composite numbers. For example, 6 is composite because it's 2 times 3. But some numbers can only be divided by themselves and 1, these are called prime numbers. For example, 7 is prime because it can only be divided by 1 and 7.
So if we want to count how many prime numbers there are, we can use Dirichlet series. We write down a special function that takes a prime number as input and outputs a number we can add up. This function is called a Dirichlet series.
Here's what it looks like:
s(n)=sigma(k=1 to infinity)ƛ(k)/k^n
Don't worry about the fancy symbols, they just mean that we add up a bunch of numbers, each of which has a special property. The ƛ(k) is called the Liouville function, and it's defined as follows:
ƛ(n)={ (-1)^r if n is the product of r distinct primes, 0 otherwise}
This means that if n is composite (the product of two or more distinct primes), then ƛ(n) is either 1 or -1 depending on how many primes it has. If it has an even number of primes, ƛ(n) is 1. If it has an odd number of primes, ƛ(n) is -1. If n is a prime, then it only has one distinct prime, and ƛ(n) is -1.
So let's say we want to count how many primes there are up to a certain number, say 100. We plug in the function for s(n), which is:
s(n)=sigma(k=1 to infinity)ƛ(k)/k^n
and we add up the values of s(1), s(2), s(3), ..., s(100). This will give us a number, which tells us how many primes there are up to 100.
Of course, this is just a simplified example, and there are many more complex calculations you can make with Dirichlet series. But the basic idea is the same: you take a special function that assigns a value to each number, and you add up these values to count things in a clever way.
Related topics others have asked about: