Re: Polynomial Reduction with Mod
- To: mathgroup at smc.vnet.net
- Subject: [mg30441] Re: Polynomial Reduction with Mod
- From: "Souvik Banerjee" <s-banerjee at nwu.edu>
- Date: Sun, 19 Aug 2001 02:01:35 -0400 (EDT)
- Organization: Northwestern University, Evanston, IL, US
- References: <9ll7ve$m4c$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
PolynomialMod[1 + x^3 + x^4 + x^5 + x^6 + x^8 + x^11 + x^13, 1 + x + x^3 + x^4 + x^8] Out = 1 + x + x^2 + x^4 + x^5 - x^6 - x^7 Also: PolynomialMod[1 + x^3 + x^4 + x^5 + x^6 + x^8 + x^11 + x^13, 1 + x + x^3 + x^4 + x^8, x] Out = 1 + x + x^2 + x^4 + x^5 -x^6 - x^7 and PolynomialQuotient[1 + x^3 + x^4 + x^5 + x^6 + x^8 + x^11 + x^13, 1 + x + x^3 + x^4 + x^8, x] Out = -x + x^3 + x^5 I checked the solution, they don't seem to match yours. Maybe I am misunderstanding your problem. -Souvik <Flip at safebunch.com> wrote in message news:9ll7ve$m4c$1 at smc.vnet.net... > Hello, > > Is Mathematica capable of calculating this type of problem? > > > Mod[1 + x^3 + x^4 + x^5 + x^6 + x^8 + x^11 + x^13, > 1 + x + x^3 + x^4 + x^8] > > The second polynomial is irreducible? > > By the way, the soultion is: x^7 + x^6 + 1. > > Thank you for any inputs ... > >