Chinese remainder theorem for polynomials
GPTKB entity
Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
polynomial rings
|
| gptkbp:generalizes |
Chinese remainder theorem for integers
|
| gptkbp:hasApplication |
polynomial interpolation
|
| gptkbp:relatedTo |
gptkb:Chinese_remainder_theorem
|
| gptkbp:requires |
pairwise coprime polynomials
|
| gptkbp:state |
If f(x) is a polynomial and m1(x),...,mn(x) are pairwise coprime polynomials, then there exists a unique solution modulo the product of the mi(x) to a system of congruences.
|
| gptkbp:usedIn |
gptkb:algebra
coding theory cryptography |
| gptkbp:bfsParent |
gptkb:Chinese_remainder_theorem_for_rings
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Chinese remainder theorem for polynomials
|