OurBigBook About$ Donate
 Sign in Sign up

Polynomial nonvanishing below the field size

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Polynomial method in combinatorics
2026-10-03  0 By others on same topic  0 Discussions Create my own version
Let P∈Fp​[x1​,…,xn​] have total degree of a polynomial less than p. If the associated polynomial function vanishes on all of Fpn​, then P is the zero polynomial. Induct on n: write
P=∑j=0p−1​Pj​(x1​,…,xn−1​)xnj​.
(1)
For each fixed (x1​,…,xn−1​), the resulting univariate polynomial of degree less than p has all p field elements as roots, so every coefficient Pj​ vanishes everywhere. The induction hypothesis makes every Pj​ the zero polynomial.

 Ancestors (5)

  1. Polynomial method in combinatorics
  2. Combinatorics
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 147 / 1 / iii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook