➔ Common root for polynomial equation
HCF / GCD (600, 136)
➔ Euclidean algorithm:
So, HCF = 8
➔ HCF (200, 150)
So, HCF = 50
Example 1:
Find common roots of
Solution using Euclid GCD method:
Polynomial Division:
Now:
Now divide:
So,
Example 2:
Find common roots for
Polynomial Division Process
Divide (1) by (2):
Subtract:
Next division:
Multiply and subtract:
Subtracting gives:
Continue dividing until:
Example 3:
Let:
Question:
Number of pairs such that the polynomials
have a common real root, where
Solution:
Divide the cubic polynomial with the quadratic one to get the remainder:
a - a.x^2
For this remainder to be 0(which implies common factor), a = 0 and b = anything.
Case 1: a = 0, b = anything.
Following the Euclid method, again divide the divisor by this remainder to get the new remainder:
ax + b + 1
For this to be 0, a = 0, b = -1
Case 2: a = 0, b = -1
Next Remainder: (b + 1).x + a
For this to be zero,
Case 3: b = -1, a = 0 (Same as Case 2)
Next remainder: (b+1) - a^2/(b+1)
For this to be zero,
(b+1)^2 - a^2 = 0
=> (b+1-a)(b+1+a) = 0
=> Case 4,5
Case 4: b + a = -1
=> (a,b) = (-5,4)...(0,-1)(-1,0)...(4,-5) => Total 10 pairs but (0,-1) is also present.
Case 5: a - b = 1
=> (a,b) = (5,4)..(0,-1)..(-4,-5) => Total 10 pairs but (0,-1) is also present.
Enumerate Case 1:
a = 0, b = anything => 11 pairs including (0,-1).
But for the roots to be real, b has to be <= 0.
Otherwise x^2 + ax + b = 0 will have imaginary roots.
So we have to discount cases where b >0 => Total 6 cases remaining.
And this includes (0,-1).
So total: 10 + 10 + 6 = 26.
But we have to remove 2 since (0,-1) has been counted thrice.
So 26 - 2 = 24 is the correct answer.
Comments
Post a Comment