Advertisement

Primes, Arithmetic Functions, and the Zeta Function

  • Michael Rosen
Part of the Graduate Texts in Mathematics book series (GTM, volume 210)

Abstract

In this chapter we will discuss properties of primes and prime decomposition in the ring A = F[T]. Much of this discussion will be facilitated by the use of the zeta function associated to A. This zeta function is an analogue of the classical zeta function which was first introduced by L. Euler and whose study was immeasurably enriched by the contributions of B. Riemann. In the case of polynomial rings the zeta function is a much simpler object and its use rapidly leads to a sharp version of the prime number theorem for polynomials without the need for any complicated analytic investigations. Later we will see that this situation is a bit deceptive. When we investigate arithmetic in more general function fields than F(T), the corresponding zeta function will turn out to be a much more subtle invariant.

Keywords

Zeta Function Polynomial Ring Dirichlet Series Irreducible Polynomial Geometric Series 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Michael Rosen
    • 1
  1. 1.Department of MathematicsBrown UniversityProvidenceUSA

Personalised recommendations