Polynomial greatest common divisor
This page lists the items of the Wikipedia article Polynomial greatest common divisor in their order, and the nodes of Math 2.0 that have them. The text of the article is not on this site. The items come from revision 1364061219, with the assessment C/Mid.
| Outcome | Items |
|---|---|
| deferred | 9 |
| attached | 1 |
The gap signals of the article are S1,S4,S5,S6,S8,S9.
| Item | Kind | Name | Outcome | Nodes | Reason |
|---|---|---|---|---|---|
| subject | definition | Polynomial greatest common divisor | deferred until 2027-05-01 | the item has the flag informal (WP9.2) | |
| #DIWZ | definition | General definition | deferred until 2027-05-01 | the cue heading names a section and not one item | |
| #GR39 | unknown | Pseudo-remainder sequence | deferred until 2027-05-01 | the kind of the item is unknown | |
| #GYH9 | statement | Bézout's identity and extended GCD algorithm | deferred until 2027-05-01 | the heading names more than one item | |
| #H1X2 | unknown | Euclid's algorithm for polynomials | deferred until 2027-05-01 | the kind of the item is unknown | |
| #KQGB | statement | Properties | deferred until 2027-05-01 | the cue heading names a section and not one item | |
| #L9Z1 | unknown | Euclidean division of polynomials | deferred until 2027-05-01 | the kind of the item is unknown | |
| #PFVF | example | Example | deferred until 2027-05-01 | the item has no name of its own, and the write role names it | |
| #QT16 | proof | Proof that GCD exists for multivariate polynomials | attached | ||
| #SOCV | unknown | Subresultant | deferred until 2027-05-01 | the kind of the item is unknown |
Refer to Wikipedia articles and their nodes for the other articles.