Given the entire functions $f$,$g:\mathbb{C} \rightarrow \mathbb{C}$ for which : $$f^2\left(\frac{1}{n}\right)g\left(\frac{1}{n}\right)= 0 \ \ \ \ \ \ \ \forall\ n \in \mathbb{N}$$
I want to prove that $f\equiv0$ or $g\equiv0$
Here is my attempt.
Suppose that both $f$ and $g$ have a countable number of roots inside the disk $D(0,1)$. Then $f^2g$ would also have a countable number of roots which leads to a contradiction because of the above relationship.
Therefore, either $f$ or $g$ has an uncountable number of roots in $D(0,1)$.
Let $g$ be that function.
This is where I'm stuck. From other examples I've seen, I think I need to make use of "accumulation points" somehow.
Is this approach correct? How should I procced or what other ways are there to solve this kind of problem?