---
title: "Polynomials over Finite Fields"
canonical: "https://docs.magma-maths.org/v2.30-1/BasicRings/UnivariatePolynomialRings/finitefields.html"
source: "https://docs.magma-maths.org/v2.30-1/BasicRings/UnivariatePolynomialRings/finitefields.md"
part: "Basic Rings"
chapter: "Univariate Polynomial Rings"
breadcrumbs:
  - {"title": "Magma Handbook", "source": "https://docs.magma-maths.org/v2.30-1/index.md"}
  - {"title": "Basic Rings", "source": "https://docs.magma-maths.org/v2.30-1/BasicRings/index-basic-rings.md"}
  - {"title": "Univariate Polynomial Rings", "source": "https://docs.magma-maths.org/v2.30-1/BasicRings/UnivariatePolynomialRings/index-univariate-polynomial-rings.md"}
prev: {"title": "Polynomials over the Integers", "source": "https://docs.magma-maths.org/v2.30-1/BasicRings/UnivariatePolynomialRings/integer.md"}
next: {"title": "Factorization", "source": "https://docs.magma-maths.org/v2.30-1/BasicRings/UnivariatePolynomialRings/factorization.md"}
intrinsics:
  - {"name": "PrimePolynomials", "signature": "PrimePolynomials(R, d): RngUPol, RngIntElt -> SeqEnum[ RngUPolElt ]"}
  - {"name": "PrimePolynomials", "signature": "PrimePolynomials(R, d, n): RngUPol, RngIntElt, RngIntElt -> SeqEnum[ RngUPolElt ]"}
  - {"name": "RandomPrimePolynomial", "signature": "RandomPrimePolynomial(R, d): RngUPol, RngIntElt -> RngUPolElt"}
  - {"name": "NumberOfPrimePolynomials", "signature": "NumberOfPrimePolynomials(q, d): RngIntElt, RngIntElt -> RngIntElt"}
  - {"name": "NumberOfPrimePolynomials", "signature": "NumberOfPrimePolynomials(K, d): FldFin, RngIntElt -> RngIntElt"}
  - {"name": "NumberOfPrimePolynomials", "signature": "NumberOfPrimePolynomials(R, d): RngUPol, RngIntElt -> RngIntElt"}
  - {"name": "JacobiSymbol", "signature": "JacobiSymbol(a, b): RngUPol, RngUPol -> RngIntElt"}
---

# Polynomials over Finite Fields

The functions in this section are available for univariate polynomials over finite fields only.

<a id="function-primepolynomials-rngupol-rngintelt"></a>
## `PrimePolynomials(R, d): RngUPol, RngIntElt -> SeqEnum[ RngUPolElt ]`

<a id="function-primepolynomials-rngupol-rngintelt-rngintelt"></a>
## `PrimePolynomials(R, d, n): RngUPol, RngIntElt, RngIntElt -> SeqEnum[ RngUPolElt ]`

A sequence of all monic prime polynomials of $R$ of degree $d$, resp. a sequence of $n$ monic prime polynomials of $R$ of degree $d$.

<a id="function-randomprimepolynomial-rngupol-rngintelt"></a>
## `RandomPrimePolynomial(R, d): RngUPol, RngIntElt -> RngUPolElt`

A random monic prime polynomial of $R$ of degree $d$.

<a id="function-numberofprimepolynomials-rngintelt-rngintelt"></a>
## `NumberOfPrimePolynomials(q, d): RngIntElt, RngIntElt -> RngIntElt`

<a id="function-numberofprimepolynomials-fldfin-rngintelt"></a>
## `NumberOfPrimePolynomials(K, d): FldFin, RngIntElt -> RngIntElt`

<a id="function-numberofprimepolynomials-rngupol-rngintelt"></a>
## `NumberOfPrimePolynomials(R, d): RngUPol, RngIntElt -> RngIntElt`

The number of monic prime polynomials of degree $d$ over the respective finite field.

<a id="function-jacobisymbol-rngupol-rngupol"></a>
## `JacobiSymbol(a, b): RngUPol, RngUPol -> RngIntElt`

The Jacobi symbol (a/b) of the two polynomials $a,b \in {\mathbb{F}}_q[x]$ where $q$ must be odd. If $b$ is irreducible, the symbol equals $0$ if $b$ divides $a$. It equals $1$ if $a$ is a square mod $b$ and $-1$ otherwise. The symbol then extends multiplicatively to all non-constant polynomials $b$.
