On Apr 4, 2015, at 17:25 , absinthe wrote: > Dear all, > > I'm trying to work with polynomials modulo x^N-1 whose coefficients belong > to Z_p (If it helps p is a power of a prime). I know that I'm doing > something wrong, but I cannot figure out what so any help is welcome.
I'm not sure how familiar you are with this stuff, so forgive me if this is already clear to you. 1. When "p" is a prime power, Z/pZ is not a field (it's a ring, but not a domain). If you want to deal with coefficients in a field, then you will want to use "GF(p)", not "Integers(p)". And a minor syntactic wrinkle to beware of is that when "p" (as above) is a prime power, and not a prime, you need a second argument, to be used as the name of the "generator" of F_p (as an extension of F_q, q being the prime in p). 2. Also, in computer algebra systems, you have to be careful about parentheses, to get what you want. In particular, "X^N-1" and X^(N-1)" are not the same. If this isn't helpful, we can look at this some more. HTH Justin -- Justin C. Walker Curmudgeon at Large Director Institute for the Enhancement of the Director's Income -- Build a man a fire and he'll be warm for a night. Set a man on fire and he'll be warm for the rest of his life. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
