This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: GCD(3537 , 87392 * 3537) = GCD(3537 , 87397074) = GCD(3537 , 1665) = GCD(1665 , 35372 * 1665) = GCD(1665 , 35373330) = GCD(1665 , 207) = GCD(202 , 16658 * 207) = GCD(202 , 16651656) = GCD(207 , 9) = GCD(9 , 20723 * 9) = GCD(9 , 0) = 9 So the GCD of 29753 and 8739 is 9. Example 2: Find the greatest common divisor of2 x 2 + 5 x12 x + 2 x + 1 and x 23 x + 5 GCD(2 x 2 + 5 x12 x + 2 x + 1 , x 23 x + 5) 352 512 2 1 ↓6315 ↓ 10 5 252158 26 GCD( x 23 x + 5 ,8 x + 26) GCD( x 23 x + 5 , x13 / 4) 13 / 4 13 5 ↓ 13 / 4 13 / 16 1 1 / 4 93 / 16 GCD( x13 / 4 , 93 / 16) Since 93/16 is a constant, we say that the GCD is 1. So the two polynomials are relatively prime....
View
Full
Document
This note was uploaded on 03/22/2010 for the course MATH 1104 taught by Professor Unknown during the Fall '10 term at Carleton.
 Fall '10
 Unknown
 Linear Algebra, Algebra, Remainder

Click to edit the document details