Here is a problem from Algebra, Artin:
Suppose $f, g\in\mathbb {C}[x, y]$ are quadratic. Prove that $f$ and $g$ have at most four common zeroes, unless they have a non-constant factor in common.
The book gives the general fact that the number of comnon zeros of such $\mathit f, \mathit g$ (no need to be quadratic) is bounded by the Bezout bound and also gives the proof of the finiteness of the number of common zeroes. So with this fact the above problem is obviously solved.
I am trying solving the problem without Bezout's Theorem. Are there some special properties of quadratic polynomials help to solve the problem?
First, the question is about intersection of two conics in the affine plane $\mathbb{A}^2$. Clearly, it reduces to the question about intersection of two conics in the projective plane $\mathbb{P}^2$. So, I will think of $f$ and $g$ as of homogeneous quadratic polynomials in three variables.
If $f$ is irreducible, then the conic $C_f = \{f = 0\}$ is isomorphic to $\mathbb{P}^1$. Any isomorphism $\phi \colon \mathbb{P}^1 \to C_f$ is given by quadratic polynomials (it is equivalent to the Veronese embedding). The points of intersection $C_f \cap C_g$ correspond to zeroes of the polynomial $g \circ \phi$, which is a homogeneous polynomial of degree 4 in two variables, hence has 4 zeroes on $\mathbb{P}^1$.
If $f$ is reducible, then $C_f = L_1 \cup L_2$, and you can check that $L_i \cap C_g$ consists of at most 2 points each by the same argument.
So, a short form of this answer is that rationality of a conic helps.