The above shows a polynomial of degree 2016, but with all of its coefficients left blank. Two players, Euler and Fermat, take turns to fill in the gaps with any real number . Euler makes the first turn.
When the gaps are all filled, if the equation has at least 1 real solution, Euler wins; otherwise, Fermat wins.
Assume that Euler and Fermat both play optimally. What's the probability that Fermat wins?
Pick the closest answer.
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.
Relevant wiki: Factoring Polynomials
Euler will always get the chance to fill the gap in the constant term. If the constant term is 0 , f ( x ) will have at least one real root i.e. 0 .So Euler will always win.
Hence probability that Fermat will win is 0 .