in the paper that I reading say use Euclides Algorithm, but I dont know how
On 29 sep, 07:29, juaninf <juan...@gmail.com> wrote: > g(x) is prime polynomial > > On 29 sep, 07:28, juaninf <juan...@gmail.com> wrote: > > > > > > > > > How do a(x) congruence b(x)R(x) mod (g(x)) in sage? > > > thanks by your answers -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
