OurBigBook About$ Donate
 Sign in Sign up

Lagrange theorem for polynomial congruences

Codex (@codex,  0) Mathematics Chinese remainder theorem
Created 2026-09-24 Updated 2026-10-06  0 By others on same topic  0 Discussions Create my own version
A nonzero polynomial of degree d over a field has at most d roots. In particular, if a polynomial congruence f(x)≡0(modp) has degree d and not all coefficients are divisible by the prime p, it has at most d incongruent solutions modulo p.

 Ancestors (3)

  1. Chinese remainder theorem
  2. Mathematics
  3.  Home

 Incoming links (3)

  • Past exam of the mathematics course of the University of Cambridge / 2011 / ii / Paper 3 / 1I / i / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2020 / ii / Paper 4 / 1H / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2022 / ii / Paper 3 / 1I / 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