polynomial calculations over Z/Zp (for prime p)?
|
12-24-2013, 07:04 AM
Post: #3
|
|||
|
|||
RE: polynomial calculations over Z/Zp (for prime p)?
Hi,
What are the CAS settings for this to work? For example, quo() is documented in the xcas manual (2.25.3), but I cannot get it to work in the HP prime: quo( (x^3+3x)%5,(2x^2+6x-5)%5) should output -2x+1 but I get an error. Same if % is replaced by MOD (or mod). In fact, the HP prime example in the Help for MOD is 9 mod 5 results in an error. Maybe my CAS settings are wrong. |
|||
« Next Oldest | Next Newest »
|
Messages In This Thread |
polynomial calculations over Z/Zp (for prime p)? - Jeff Nye - 12-24-2013, 04:00 AM
RE: polynomial calculations over Z/Zp (for prime p)? - Han - 12-24-2013, 04:09 AM
RE: polynomial calculations over Z/Zp (for prime p)? - Jeff Nye - 12-24-2013, 11:56 AM
RE: polynomial calculations over Z/Zp (for prime p)? - Han - 12-24-2013, 03:49 PM
RE: polynomial calculations over Z/Zp (for prime p)? - Alberto Candel - 12-24-2013 07:04 AM
RE: polynomial calculations over Z/Zp (for prime p)? - Alberto Candel - 12-24-2013, 03:39 PM
RE: polynomial calculations over Z/Zp (for prime p)? - Alberto Candel - 12-24-2013, 04:10 PM
RE: polynomial calculations over Z/Zp (for prime p)? - parisse - 12-25-2013, 07:55 AM
|
User(s) browsing this thread: 1 Guest(s)