Irreducible polynomials in Fq[x] versus 1 - qz in C[z]

Abstract

Let q be a prime power and Nn count degree-n monic irreducible polynomials in Fq[x]. We show that prodn=1∞ (1 -zn)Nn = 1 - qz for small |z|.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…