Here is a conjecture that I came up with yesterday.
Conjecture: Suppose that $f:\mathbb{C} \to \mathbb{C}$ is entire. Then $f(z) = w$ has $n$ solutions $\forall w \in \mathbb{C} \iff f $ is a polynomial of degree $n$.
The converse follows immediately from the Fundamental Theorem of Algebra, but the forward implication is a lot more difficult. And after thinking about it more, it seems to me that the forward implication is probably not true. Unfortunately, I can't immediately think of a counterexample.
I thought a little about the approach I might take to prove this. Suppose $f$ is as above. Then $f(z)=0$ has $n$ solutions, so we can write $f(z)=p(z)g(z)$ where $p$ is a polynomial of degree $n$ and $g$ is entire with $g\neq 0$. If $g$ is a constant, then we are done. Otherwise, by Liouville and Casaroti-Weierstrass, $g$ is unbounded and gets arbitrarily close to any value in $\mathbb{C}$. We can also write $g=e^h$ for some $h$ entire. (There is also Picard's theorem, but I am reluctant to use this as I don't know the proof.)
The above gets somewhere, but I am not sure it leads to a proof without another insight. If the conjecture is false, then it definitely doesn't lead to a proof.
So, is the conjecture true or false? And if it is true, am I on the right track to prove it? (I would appreciate small hints much more than a full answer.)