Ada and Byron play a game. First, Ada chooses a non-zero real number and announces it. Then Byron chooses a non-zero real number and announces it. Then Ada chooses a non-zero real number and announces it. Finally, Byron chooses a quadratic polynomial whose three coefficients are in some order. Suppose that Byron wins if the quadratic polynomial has a real root and Ada wins otherwise. Determine which player has a winning strategy.
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.
First, if Ada choose a positive/negative number for a , then Byron chooses a negative/positive number for b .
Then, no matter what Ada choose for c , Bryon can let the quadratic polynomial be a x 2 + c x + b , then the discriminant will be c 2 − 4 a b . a b negative and c 2 is positive, so c 2 − 4 a b > 0 , which states that it has real roots.
Hence, Byron has a winning strategy.