I found this method in polynomial_element.pyx file
thanks
2011/9/30 Juan Grados
> Hi David,
>
> Yes already, but I want build other new, because I need make modification
> in EEA (add other stop parade), but I first that my "EEA Algorithm" work
> fine ...
>
> thanks
>
>
> 2011/9/30 David Joyn
Hi David,
Yes already, but I want build other new, because I need make modification
in EEA (add other stop parade), but I first that my "EEA Algorithm" work
fine ...
thanks
2011/9/30 David Joyner
> On Fri, Sep 30, 2011 at 5:11 AM, juaninf wrote:
> > Hi everybody,
> >
> > I want implement a
On Fri, Sep 30, 2011 at 5:11 AM, juaninf wrote:
> Hi everybody,
>
> I want implement a extend Euclidean Algorithm ( to solve a(x)
It's already in Sage. Type
xgcd?
for further details.
> congruence b(x)R(x) mod (g(x))), (egcd
> function), but this give wrong results, below my egcd, please hel
Hi everybody,
I want implement a extend Euclidean Algorithm ( to solve a(x)
congruence b(x)R(x) mod (g(x))), (egcd
function), but this give wrong results, below my egcd, please help me
to fix ...
I am testing with inverse multiplicative from output of xgcd
def egcd(p1,p2):
if p2 == PR(0):
in the paper that I reading say use Euclides Algorithm, but I dont
know how
On 29 sep, 07:29, juaninf wrote:
> g(x) is prime polynomial
>
> On 29 sep, 07:28, juaninf wrote:
>
>
>
>
>
>
>
> > How do a(x) congruence b(x)R(x) mod (g(x)) in sage?
>
> > thanks by your answers
--
To post to this gro
g(x) is prime polynomial
On 29 sep, 07:28, juaninf 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.c
