Is entire function a polynomial? Let $f:\mathbb{C}\to \mathbb{C}$ be an entire function, and suppose that for every $z\in \mathbb{C}$ there exists $n_z\in \mathbb{N}$ such that $f^{(n_z)}(z)=0$.
Is $f$ necessarily a polynomial?
 A: Suppose $f^{(n)}$ does not vanish for all $n\in\mathbb{N}$. Then $\mathbb{C}=\bigcup_{n=1}^\infty (f^{(n)})^{-1}(0)$. But the zeros of $f^{(n)}$ are isolated, hence countable. So the RHS is a countable union of countable sets, which is still countable, while $\mathbb{C}$ is uncountable, contradiction.
A: If an entire function $f$ satisfies such property, then $\mathbb{C}$ can be covered by countable union of closed sets. To see this, for each natural number $n$, define $B_n:=\{z\in \mathbb{C}:f^{(n)}(z)=0\}$. By the hypothesis, $B_n$ is non-empty. $f$ being entire implies that each $f^{(n)}$ is continuous, so one can easily see that each $B_n$ is a closed subset of $\mathbb{C}$. Now note that by construction, $\mathbb{C}=\cup B_n$. So by Baire Category Theorem, there exists an $n$ such that $B_n$ has a non-empty interior. This means $f^{(n)}$ vanishes on a set that has limit points. Then $f^{(n)}$ being also entire, by the Isolated Zeroes Principles, vanishes on all $\mathbb{C}$. So we can see now that $f$ is a polynomial of degree at most $n$.
