First time here? Check out the FAQ!
Hi there! Please sign in
help
tags
users
badges
ALL
UNANSWERED
Ask Your Question
Escolopendra's profile - overview
overview
network
karma
followed questions
activity
33
karma
follow
Registered User
member since
2021-11-17 00:58:05 +0100
last seen
2021-11-28 14:10:42 +0100
todays unused votes
30
votes left
2
Questions
119
views
no
answers
1
vote
2021-11-17 16:59:50 +0100
Escolopendra
Finding an irreducible polynomial in Z [x] but reducible in F2 [x]
1k
views
1
answer
1
vote
2021-11-17 17:21:08 +0100
rburing
How can you define a function that finds the Greatest Common Divisor (Gcd) two polynomials for every field?
gcd
xgcd
euclidean
0
Answers
1
Vote
1
0
3
Tags
gcd
× 2
xgcd
× 2
euclidean
× 2
8
Badges
●
Teacher
×
1
Finding an irreducible polynomial in Z [x] but reducible in F2 [x]
●
Student
×
1
How can you define a function that finds the Greatest Common Divisor (Gcd) two polynomials for every field?
●
Self-Learner
×
1
Finding an irreducible polynomial in Z [x] but reducible in F2 [x]
●
Editor
×
1
Finding an irreducible polynomial in Z [x] but reducible in F2 [x]
●
Scholar
×
1
How can you define a function that finds the Greatest Common Divisor (Gcd) two polynomials for every field?
●
Famous Question
×
1
How can you define a function that finds the Greatest Common Divisor (Gcd) two polynomials for every field?
●
Popular Question
×
1
How can you define a function that finds the Greatest Common Divisor (Gcd) two polynomials for every field?
●
Notable Question
×
1
How can you define a function that finds the Greatest Common Divisor (Gcd) two polynomials for every field?
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a
Creative Commons Attribution Share Alike 3.0
license.
Powered by Askbot version 0.7.59
Please note: Askbot requires javascript to work properly, please enable javascript in your browser,
here is how