※ 引述《Leon (Achilles)》之铭言： : 某日在上课时, 老师灵光一闪, 补充了这个题目. : Problem : : f is a polynomial in GF(2), which f = X^N + X^a + 1. : Try to prove that f can not be devided by X^4 + X^3 + X^2 + X + 1. 这真是篇很久的文 现在才看到发现很有趣 f can be written as following: x^N + x^a + 1 = (x^5 + 1)*p(x) + r(x) = (x^4 + x^3 + x^2 + x + 1)*q(x) + r(x), --- (1) where q(x) = (x + 1)*p(x) as long as we show the remainder r(x) can't be divided by (x^4 + x^3 + x^2 + x + 1) in (1), we then prove the polynomial f can't be divided by (x^4 + x^3 + x^2 + x + 1). since r(x) is the remainder of x^N + x^a + 1 when the divisor is (x^5 + 1) , therefore, it's evident that the reaminder r(x) should be as the form: r(x) = x^M + x^b + 1, where M,b < 5. now, it's clear that r(x) in (1) can't be the multiple of (x^4 + x^3 + x^2 + x + 1), thus we finish the proof. 还请Leon兄指教 -- --

※ 发信站: 批踢踢实业坊(ptt.cc) ◆ From: 218.160.91.71