Questions - ASKSAGE: Sage Q&A Forum

11

views

no

answers

1

vote

2023-09-28 09:59:24 +0200 Martin-Br

xgcd for several arguments

36

views

no

answers

no

votes

2023-03-18 11:08:52 +0200 jay

Which algorithm is used for computing the gcd of sparse polynomial

gcd

127

views

1

answer

1

vote

2022-07-08 19:23:21 +0200 dan_fulea

Attribute Error gcd

55

views

no

answers

no

votes

2021-12-02 05:11:55 +0200 vnb

segmentation fault when find gcd of fraction and sqrt

129

views

no

answers

no

votes

2021-12-02 05:03:51 +0200 vnb

gcd sometimes works, sometimes throws an error

gcd
error

883

views

1

answer

1

vote

2021-11-17 17:21:08 +0200 rburing

How can you define a function that finds the Greatest Common Divisor (Gcd) two polynomials for every field?

179

views

no

answers

2

votes

2021-10-29 23:47:50 +0200 Max Alekseyev

gcd on polynomials over ZZ [closed]

1k

views

2

answers

no

votes

2020-05-28 18:30:59 +0200 John Cremona

Efficient n-th division polynomial of elliptic curve

210

views

no

answers

1

vote

2020-03-28 22:26:19 +0200 vdelecroix

What are the specific steps to find XGCD on the polynomial ring $Z_8[x]$

188

views

1

answer

1

vote

2018-12-30 18:23:23 +0200 rburing

Unexpected result in the evaluation of a function

271

views

1

answer

no

votes

2018-11-26 10:39:12 +0200 logomath

Finding coprime integers near a lattice point

2k

views

1

answer

1

vote

2018-11-22 14:26:40 +0200 rburing

Extended Euclidean Algorithm for Univariate Polynomials with Coefficients in a Finite Field

875

views

2

answers

1

vote

2018-05-12 10:18:58 +0200 tmonteil

polynomials with roots of unity as coefficients

246

views

1

answer

1

vote

2017-11-01 21:42:11 +0200 tmonteil

Definite Integral Fails due to Runtime Error

134

views

no

answers

no

votes

2017-06-12 01:52:04 +0200 krishna

Recasting Laurent polynomials

930

views

1

answer

no

votes

2017-06-01 15:39:32 +0200 B r u n o

Subresultant algorithm taking a lot of time for higher degree univariate polynomials with coefficients from fraction fields

643

views

1

answer

2

votes

2016-05-02 15:32:42 +0200 B r u n o

GCD of multivariable polynomials and conversion of Laurent polynomials to ordinary polynomials

1k

views

no

answers

no

votes

2015-05-27 19:09:56 +0200 hashirama

Bezout coefficients for Polynomials [closed]

2k

views

1

answer

no

votes

2015-05-27 19:06:55 +0200 hashirama

bezout coefficients ?

665

views

2

answers

1

vote

2014-02-16 04:38:03 +0200 Jeroen Demeyer

resultant and gcd over real ?

1k

views

2

answers

no

votes

2013-01-14 00:06:48 +0200 Rolandb

definition of gcd for(x,y)

gcd
function

21 questions

xgcd for several arguments

Which algorithm is used for computing the gcd of sparse polynomial

Attribute Error gcd

segmentation fault when find gcd of fraction and sqrt

gcd sometimes works, sometimes throws an error

How can you define a function that finds the Greatest Common Divisor (Gcd) two polynomials for every field?

gcd on polynomials over ZZ [closed]

Efficient n-th division polynomial of elliptic curve

What are the specific steps to find XGCD on the polynomial ring $Z_8[x]$

Unexpected result in the evaluation of a function

Finding coprime integers near a lattice point

Extended Euclidean Algorithm for Univariate Polynomials with Coefficients in a Finite Field

polynomials with roots of unity as coefficients

Definite Integral Fails due to Runtime Error

Recasting Laurent polynomials

Subresultant algorithm taking a lot of time for higher degree univariate polynomials with coefficients from fraction fields

GCD of multivariable polynomials and conversion of Laurent polynomials to ordinary polynomials

Bezout coefficients for Polynomials [closed]

bezout coefficients ?

resultant and gcd over real ?

definition of gcd for(x,y)

Contributors

Tags