Greatest common divisor
February 8th, 2005
View as: 
Integer and polynomial GCD calculations: useful properties, Euclidean techniques,Resultants and the Sylvester matrix, non-Euclidean modular GCD by large/many small primes.
Modulo Errors
for when the margin is too small
Author
Graeme Taylor
PhD Student,
Number Theory
About this blogCategories
- AI (3)
- Algebra (24)
- Algebraic Geometry (28)
- Algorithms (8)
- Analysis (10)
- Carnival (2)
- CM10020 (1)
- CM20019 (4)
- CM30070 (4)
- CM30071 (1)
- Complexity (5)
- Conferences (4)
- Cryptology (13)
- cyclotomic (4)
- Finance (2)
- Galois Theory (1)
- Game Theory (7)
- Graph Theory (6)
- Group Theory (10)
- Logic (11)
- MA10001 (1)
- MA20010 (1)
- MA20012 (4)
- MA20013 (1)
- MA20014 (2)
- MA30047 (2)
- MA30059 (1)
- MA30087 (1)
- MA30172 (1)
- MA40037 (1)
- MA40043 (2)
- MA40045 (1)
- MA40062 (1)
- MA40188 (3)
- Maple (11)
- MAT-1-GTh (2)
- Mathematical Biology (2)
- Matlab (1)
- Number Theory (32)
- Operational Research (1)
- Personal (1)
- PhD (38)
- Physics (3)
- Plane Geometry (2)
- Pop.Maths (6)
- Probability (2)
- Prolog (2)
- Ring Theory (2)
- SAGE (9)
- Talks (7)
Recent Comments
- Graeme: They have had no proof
- Jordi Gutiérrez Hermoso: Do you still want these
- Graeme: The stylesheet is fixed-width rather
- vlorbik: well, okay, then. it's
- John Cremona: Hello Graeme. You'll find
Archives
- September 2008
- July 2008
- June 2008
- April 2008
- March 2008
- January 2008
- December 2007
- November 2007
- October 2007
- September 2007
- August 2007
- June 2007
- May 2007
- April 2007
- March 2007
- February 2007
- January 2007
- December 2006
- November 2006
- October 2006
- September 2006
- August 2006
- June 2006
- May 2006
- April 2006
- March 2006
- January 2006
- December 2005
- September 2005
- July 2005
- May 2005
- February 2005
- January 2005
- December 2004
- November 2004
- October 2004
- August 2004
- July 2004
- June 2004
- May 2004
- April 2004
- March 2004
- February 2004
- January 2004
- March 2003
- October 2002
Edinburgers
Mod Errors Feeds