A contestant play a game on a game show. The contestant must place any three integers in the place of in the following equation:
then the host will rearrange the coefficients, while wearing a blindfold. Now if the coefficients after jumbling are arranged in such a way that the quadratic cannot have any real roots, the host wins, and the contestant loses. If the host does not do it, the contestant wins. Considering the contestant has the best strategy, what is the probability that the contestant will win is given by , find . The host can jumble it as many times as he wants to.
This problem was inspired by a problem I had seen a long time ago on Brilliant. I do not remember its name, but I am not trying to plagiarise it. If someone knows the original problem, please post the link in the solution.
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.
Stupid solution 1:
Choose a = b = c = 0 . The "quadratic" has (infinitely many) real solutions, no matter how the host "rearranges" the three zeroes. Thus the probability is 1 , giving x = 1 0 0 .
Stupid solution 2:
Note that the probability of winning is always an integer divided by 3 . To see this, note that there are 6 equally likely possibilities, so the denominator must be 6 . Also, since a x 2 + b x + c and c x 2 + b x + a always both have real roots or both have complex roots (the roots are reciprocals of each other), the numerator must be even; whenever we have a successful case, we have another (the one paired, swapping a and c ). Thus the probability is an integer divided by 3 . So 1 0 0 x must be an integer divided by 3 , and also a probability, so it can only be 0 or 1 . Finally, x = 0 , since we can at least choose 1 , 2 , 3 , which when put properly as x 2 + 3 x + 2 , gives real solutions. So the probability is 1 , giving x = 1 0 0 .
Actual solution, assuming a , b , c are nonzero:
Consider the selections 1 , 1 , − 2 . There are three cases:
Thus in all cases, the contestant wins, giving x = 1 0 0 for a certain win.
To see how to obtain that triple:
A quadratic a x 2 + b x + c has real roots iff b 2 ≥ 4 a c . But with real coefficients, the left hand side is non-negative. Thus if we pick two positive numbers and one negative number, whenever the negative number falls to a or c , we win. Thus the only possibility we can lose is if b is negative. But if so, just make b really large and a , c really small to ensure b 2 ≥ 4 a c still applies.