How many ordered pairs of integers ( a , b ) are there such that − 6 1 ≤ a ≤ 6 1 and − 6 1 ≤ b ≤ 6 1 and they satisfy the condition that x 2 + a x + b and b x 2 + a x + 1 have a common (possibly complex) root?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Good solution, I arrived at the caseworking by subtracting the two equations.
I was off by one... :(
Let α be the common root
As it is a common root..it must satisfy both equations
⇒ α 2 + a α + b = 0 . . . . . . . . . . . . ( 1 )
and
b α 2 + a α + 1 = 0 . . . . . . . . . . . ( 2 )
on subtracting eqn 1 from eqn 2
we get
( α 2 − 1 ) ( b − 1 ) = 0
⇒ Either α = 1 , − 1
or b = 1
Now consider the following cases
CASE 1 ( b = 1 )
if b = 1 ...for each integer value of a we will have an ordered pair
⇒ Number of Ordered Pairs from CASE 1 =123
CASE 2 ( α = 1 )
Substituting the value of α in either of the equations.. we get
a + b = − 1 . . . . . . . . . . . . . . ( 3 )
Note here that b can't be 6 1
Also see that we have already counted the pair ( − 2 , 1 ) in CASE 1
Hence we have 121 Ordered Pairs from CASE 2
Similarly... CASE 3 ( α = − 1 )
a − b = 1 . . . . . . . . . . . . . . . ( 4 )
Here too... b can't be 6 1 ....and we have already counted the pair ( 2 , 1 )
Hence we again have 121 Ordered Pairs from CASE 3
BUT WAIT!......what if equations 3 and 4 are satisfied simultaneously
This means we have counted ( 0 , − 1 ) TWICE
Hence Total number of Ordered Pairs = 1 2 3 + ( 2 × 1 2 1 ) − 1 = 3 6 4
Problem Loading...
Note Loading...
Set Loading...
Define f ( x ) = x 2 + a x + b . Note that x 2 f ( x 1 ) = b x 2 + a x + 1 . We want f ( x ) = 0 and x 2 f ( x 1 ) = 0 for some number x . Note that x = 0 because 0 is not a root of b x 2 + a x + 1 , so we can safely divide both sides of the second equation by x 2 . We now have the following two equations: { f ( x ) = 0 f ( x 1 ) = 0
There are now two cases.
Case 1: the roots of * f ( x ) are * x , x 1
Since the roots of f ( x ) are x , x 1 , the product of the roots is 1 , so b = 1 by Vieta's. We can see that f ( x ) = f ( x 1 ) = x 2 + a x + 1 , so we can choose any a from a = − 6 1 → 6 1 .
*Case 2: * x = x 1
In this case, solving gives x = 1 , − 1 .
*Case 2a: * x = 1
Because x = 1 , f ( x ) = x 2 + a x + b = ( x − 1 ) ( x − b ) = x 2 + ( − b − 1 ) x + b so a = − b − 1 .
*Case 2b: * x = − 1
Because x = − 1 , f ( x ) = x 2 + a x + b = ( x + 1 ) ( x + b ) = x 2 + ( b + 1 ) x + b so a = b + 1
Combining these two cases gives b + 1 = ± a .
Therefore in case 2, there are two solutions for all b where b = − 6 1 → 6 0 ( b = 6 1 doesn't work because then ∣ a ∣ = 6 2 which doesn't meet the problem requirements)
Putting it all together
In case 1, we have 1 2 3 solutions. In case 2, we have 2 × 1 2 2 = 2 4 4 solutions. However, we have counted the solutions ( a , b ) = ( 2 , 1 ) , ( − 2 , 1 ) twice: one time in case 1, and one time in case 2. In addition, we have counted the solution ( a , b ) = ( 0 , − 1 ) twice: one time in case 2a, one time in case 2b. Therefore we subtract 3 from our total number of solutions, so our final answer is 1 2 3 + 2 4 4 − 3 = 3 6 4 solutions.