# Gigantic Polynomial Game

**Algebra**Level 4

\[ \large f(x) = \Box x^{2016} + \Box x^{2015} + \ldots + \Box x^2 + \Box x + \Box \]

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 \(f(x) = 0\) 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.