Wyjść na stały ląd

Udało się stanąć na twardej ziemi

Synku, z Bogiem, powodzenia na egzaminach nerwowo żegnała rano Bogumiła swojego jedynego syna Czesława, gdy wychodził do akademika.

Miał jechać na egzaminy wstępne do sąsiedniego miasta. Pokrzepiła go śniadaniem, dodała otuchy i wyprawiła, by zdobywał nowe szczyty.

Dzięki, mamo, nie martw się, będzie dobrze. Na budżet pewnie się nie dostanę za Czesławem zatrzasnęły się drzwi, a mąż już dawno wyjechał do pracy.

Bogumiła z Wojciechem przeżyli razem dwadzieścia dwa lata. Wychowali syna Czesława na por# Issue 15753: Wrong result in polynomial division in GF(2)[x]

archive/issues_015516.json:
„`json
{
„assignees”: [],
„body”: „

\n\nI was trying to compute the minimal polynomial of a certain matrix mod 2 (i.e. in GF(2)), and got a wrong result. After some investigation it seems that the problem is in polynomial division in GF(2)[x]. In particular, the following code (which is the step that seems to fail in the minimal polynomial computation) gives a wrong result:\n\n„`\nsage: ring. = GF(2)[]\nsage: f = x^14 + x^13 + x^12 + x^10 + x^9 + x^7 + x^6 + x^4 + x^2 + x\nsage: g = x^8 + x^6 + x^5 + x^4 + x^2 + x + 1\nsage: q, r = f.quo_rem(g)\nsage: f == q*g + r\nFalse\n„`\n\nBut if I use the generic polynomial division code, the result is correct:\n\n„`\nsage: q1, r1 = f._quo_rem_naive(g)\nsage: f == q1*g + r1\nTrue\n„`\n\nComponent: **algebra**\n\nKeywords: **polynomial division, GF(2)**\n\nAuthor: **Peter Bruin**\n\nBranch/Commit: **[`41e5a23`](https://github.com/sagemath/sagetrac-mirror/commit/41e5a23d4d1b6a3f2f70761c0b8e8b0c9db960a5)**\n\nReviewer: **Mariah Lenox**\n\n_Issue created by migration from https://trac.sagemath.org/ticket/15753_\n\n”,
„closed_at”: „2014-03-31T21:13:11Z”,
„created_at”: „2014-01-28T13:57:03Z”,
„labels”: [
„https://github.com/sagemath/sage/labels/c%3A%20algebra”,
„https://github.com/sagemath/sage/labels/p%3A%20major%20/%203”,
„https://github.com/sagemath/sage/labels/bug”
],
„milestone”: „https://github.com/sagemath/sage/milestones/sage-6.2”,
„reactions”: [],
„repository”: „https://github.com/sagemath/sage”,
„title”: „Wrong result in polynomial division in GF(2)[x]”,
„type”: „issue”,
„updated_at”: „2014-03-31T21:13:11Z”,
„url”: „https://github.com/sagemath/sage/issues/15753”,
„user”: „https://github.com/pjbruin”
}
„`

I was trying to compute the minimal polynomial of a certain matrix mod 2 (i.e. in GF(2)), and got a wrong result. After some investigation it seems that the problem is in polynomial division in GF(2)[x]. In particular, the following code (which is the step that seems to fail in the minimal polynomial computation) gives a wrong result:

„`
sage: ring. = GF(2)[]
sage: f = x^14 + x^13 + x^12 + x^10 + x^9 + x^7 + x^6 + x^4 + x^2 + x
sage: g = x^8 + x^6 + x^5 + x^4 + x^2 + x + 1
sage: q, r = f.quo_rem(g)
sage: f == q*g + r
False
„`

But if I use the generic polynomial division code, the result is correct:

„`
sage: q1, r1 = f._quo_rem_naive(g)
sage: f == q1*g + r1
True
„`

Component: **algebra**

Keywords: **polynomial division, GF(2)**

Author: **Peter Bruin**

Branch/Commit: **[`41e5a23`](https://github.com/sagemath/sagetrac-mirror/commit/41e5a23d4d1b6a3f2f70761c0b8e8b0c9db960a5)**

Reviewer: **Mariah Lenox**

_Issue created by migration from https://trac.sagemath.org/ticket/15753_

archive/issue_events_222803.json:
„`json
{
„actor”: „https://github.com/pjbruin”,
„created_at”: „2014-01-28T13:57:03Z”,
„event”: „milestoned”,
„issue”: „https://github.com/sagemath/sage/issues/15753”,
„milestone_number”: null,
„milestone_title”: „sage-6.1”,
„type”: „issue_event”,
„url”: „https://github.com/sagemath/sage/issues/15753#event-222803”
}
„`

archive/issue_events_222804.json:
„`json
{
„actor”: „https://github.com/pjbruin”,
„created_at”: „2014-01-28T13:57:03Z”,
„event”: „labeled”,
„issue”: „https://github.com/sagemath/sage/issues/15753”,
„label”: „https://github.com/sagemath/sage/labels/c%3A%20algebra”,
„label_color”: „0000ff”,
„label_name”: „c: algebra”,
„label_text_color”: „ffffff”,
„type”: „issue_event”,
„url”: „https://github.com/sagemath/sage/issues/15753#event-222804”
}
„`

archive/issue_events_222805.json:
„`json
{
„actor”: „https://github.com/pjbruin”,
„created_at”: „2014-01-28T13:57:03Z”,
„event”: „labeled”,
„issue”: „https://github.com/sagemath/sage/issues/15753”,
„label”: „https://github.com/sagemath/sage/labels/p%3A%20major%20/%203”,
„label_color”: „ffbb00”,
„label_name”: „p: major / 3”,
„label_text_color”: „ffffff”,
„type”: „issue_event”,
„url”: „https://github.com/sagemath/sage/issues/15753#event-222805”
}
„`

archive/issue_events_222806.json:
„`json
{
„actor”: „https://github.com/pjbruin”,
„created_at”: „2014-01-28T13:57:03Z”,
„event”: „labeled”,
„issue”: „https://github.com/sagemath/sage/issues/15753”,
„label”: „https://github.com/sagemath/sage/labels/bug”,
„label_color”: „d73a4a”,
„label_name”: „bug”,
„label_text_color”: „ffffff”,
„type”: „issue_event”,
„url”: „https://github.com/sagemath/sage/issues/15753#event-222806”
}
„`

archive/issue_comments_198511.json:
„`json
{
„body”: „

\n\nThe bug is in the method `Polynomial_template.quo_rem()`, which is implemented in `src/sage/rings/polynomial/polynomial_template.pxi`. The problem is that the current code assumes that the leading term of the remainder is not zero, but this is not always the case. A patch is on the way.”,
„created_at”: „2014-01-28T14:03:58Z”,
„formatter”: „markdown”,
„issue”: „https://github.com/sagemath/sage/issues/15753”,
„type”: „issue_comment”,
„url”: „https://github.com/sagemath/sage/issues/15753#issuecomment-198511”,
„user
Oceń artykuł
Dodaj komentarze

;-) :| :x :twisted: :smile: :shock: :sad: :roll: :razz: :oops: :o :mrgreen: :lol: :idea: :grin: :evil: :cry: :cool: :arrow: :???: :?: :!:

14 − 7 =

Wyjść na stały ląd