# Discrete Mathematics/Analytic Number Theory

## Introduction[edit | edit source]

Analytic Number Theory is the application of Analysis to Number Theoretic Problems. A quick overview of some portions of Analytic Number theory follow.

## Zeta function[edit | edit source]

The zeta function defined by

for real values of s > 1, plays a central role in the theory. It is straightfoward to show it converges absolutely when s > 1. It satisfies the Euler product formula,

where the product is over all prime numbers. To see this note that multiplying the series definition by 1-2^{-s} and rearranging terms(which is justified since the series converges absolutely) eliminates the even terms, i.e.

Likewise after multiplying by 1-3^{-s} all remaining terms with n divisible by 3 are eliminated. After repeating this process for all primes it follows that

since 1 is the only number not divisible by a prime and thus only the n=1 term is left. Solving for ζ(s) immediately gives the Euler product formula.

## Dirichlet series[edit | edit source]

The series for the zeta function is a special case of a Dirichlet series, that is a series of the form

Many important arithmetic functions, a(n), have the properties that a(1)=1 and a(m)a(n)=a(mn) when m & n are relatively prime. Such functions are called multiplicative and their associated Dirichlet series may be expressed as an Euler product by

,

as can be shown in a manner similar to the proof for the zeta function. A completely multiplicative function is one where a(m)a(n)=a(mn) even if m & n are not relatively prime. For a completely multiplicative function, the Euler product simplifies to

.

The product of two Dirichlet series is given by the formula

where (a * b)(n) represents the Dirichlet convolution of a & b, which is defined by

Some important Dirichlet series include:

and

## Big-Oh notation[edit | edit source]

Many problems involve functions that are incredibly difficult to work with exactly, but where the rate of growth of the function, rather than its exact values, is of primary concern. Because of this a notation (often called "Big-Oh notation") was invented.

"f(x)=O(g(x))" is used to denote that for a sufficiently large number x_{0} there exists a number C such that for all x>x_{0}

"f(x) = g(x) + O(h(x))" is used to denote that f(x)-g(x)=O(h(x))

## Dirichlet's Theorem[edit | edit source]

One of the first results proven with analytic number theory was Dirichlet's Theorem which states that for any 2 relatively prime integers a & b, there are infinitely many values of k for which ak+b is a prime number. The proof involves complex-valued functions of the set of integers called Dirichlet characters defined by the properties that χ(n) depends only on its residue class modulo a, χ(n) is completely multiplicative, and χ(n) = 0 iff a and n are not relatively prime. The principal character χ_{0} is defined to be 1 when a & n are relatively prime and 0 otherwise. It is easy to show that χ_{0} is a character. It can be shown that the number of characters is equal to φ(a). It can also be shown that the sum of the values of χ(n) over all characters χ is equal to φ(a) if and 0 otherwise. The Dirichlet series corresponding to a character is called a Dirichlet L-series and is traditionally denoted by L(s,χ). It is simple to show that L(1,χ_{0}) diverges. Through a complicated argument it is shown that L(1,χ) converges and is nonzero if χ is nonprincipal. The function

must diverge since L(1,χ_{0})/χ(b) diverges and the other terms all converge. Since all terms of the sum on the left are finite its divergence implies there are an infinite number of terms of this sum and thus infinitely many primes of the form ak+b.

## Riemann zeta function & xi function[edit | edit source]

The zeta function introduced above(the Euler zeta function) converges for all values of s such that Re(s)>1. The Riemann zeta function is defined as the analytic continuation of the Euler zeta function, and is defined for all complex values of s except s=1. Where both functions exist, the Euler and Riemann zeta functions are equal by definition. It can be shown that if the xi function is defined by

then ξ(s)=ξ(1-s). This is the symmetric form of the famous functional equation for the Riemann zeta function, and provides a convenient way of computing the Riemann zeta function when Re(s)<1.

The series definition of Euler's zeta function shows that ζ(s) has no zeroes for Re(s)>1. It can also be shown that the zeta function has no zeroes with Re(s)=1. The functional equation shows that for integer values of n, ζ(-2n)=0, and any other zeroes lie in the so-called critical strip, 0<Re(s)<1. The well-known Riemann Hypothesis states that all nontrivial zeros(i.e. those not of the form s=-2n), have Re(s)=1/2. It is easy to show that the zeroes of the xi function are exactly the nontrivial zeroes of the zeta function.

## Hadamard product formula[edit | edit source]

The Hadamard product formula states that functions with certain properties(in particular the xi function) are close enough to a polynomial that they may be represented in terms of a product over the zeroes. For the xi function the Hadamard product formula states that

for certain values of A and B, where the product is over the zeroes of ξ(s). This formula is one of the main reasons the zeroes of the xi function, and thus the zeta function, are of considerable importance.

## Distribution of squarefree numbers[edit | edit source]

Let S(x) denote the number of squarefree numbers less than or equal to x. To evaluate this function we begin by counting all integers less than or equal to x. Then we subtract those that are divisible by 4, those divisible by 9, those divisible by 25, and so on. We then have removed numbers with 2 repeated prime factors twice those with 3 repeated prime factors 3 times and so on. To remedy the repetition of the numbers with 2 repeated prime factors we add on the number of integers less than or equal to x divisible by 36, those divisble by 100, those divisible by 225 and so on. We have now reincluded those with 3 repeated prime factors so we uncount them. Continuing this process gives

In addition to information about how common squarefree numbers are this estimate gives information on how they are distributed.
For example to show that there are infinitely many pairs of consecutive squarefree numbers(i.e. that differ by 1) assume there are only finitely many such pairs. Then there is some x_{0} such that all such pairs lie below x_{0}. Then for n > x_{0} n and n+1 cannot be squarefree, and thus at most half the integers above x_{0} are squarefree, or more precisely,

but since this contradicts the estimate obtained earlier, thus there are infinitely many pairs of consecutive squarefree numbers.

The estimate also shows that for large enough x, there is at least one squarefree number between x^3 and (x+1)^3. To see this, note that the number of squarefree numbers in that range is

which is at least one for sufficiently large x.

To do: Add mention of prime number theorem and sieve methods, as well as Dirichlet inversion