If you have a new account but are having problems posting or verifying your account, please email us on hello@boards.ie for help. Thanks :)

Hello all! Please ensure that you are posting a new thread or question in the appropriate forum. The Feedback forum is overwhelmed with questions that are having to be moved elsewhere. If you need help to verify your account contact hello@boards.ie

Hi there,
There is an issue with role permissions that is being worked on at the moment.
If you are having trouble with access or permissions on regional forums please post here to get access: https://www.boards.ie/discussion/2058365403/you-do-not-have-permission-for-that#latest

modulo operation for polynomials?

smslca · 2011-04-17 12:43:43

I know , how to calculate " x mod p " for a given very large "x" value and some p value. Here , x and p are integers But how can we calculate f(x) mod g(x) , for which f(x) has higher degree(or order) than g(x). And that degree turns out to be a very large number. Ex:[ (x+1)^1729 mod ((x^5)-1) ] or [ (x+1)^1729 mod…

17-04-2011 12:43pm

#1

smslca

Registered Users, Registered Users 2 Posts: 28 ✭

Join Date: December 2007

Posts: 13

I know , how to calculate " x mod p " for a given very large "x" value and some p value. Here , x and p are integers

But how can we calculate f(x) mod g(x) , for which f(x) has higher degree(or order) than g(x).
And that degree turns out to be a very large number.

Ex:[ (x+1)^1729 mod ((x^5)-1) ] or [ (x+1)^1729 mod (1729,((x^5)-1)) ]

Is there any method or algorithm to calculate it at faster speeds

0