How would Bezout have proved Bezout's theorem bounding the number of points in the intersection of two plane (polynomial) curves in $\mathbb{R}^2$?

I have looked at a couple of modern algebraic treatments of Bezout's theorem. For instance, I am familiar with Fulton's *Algebraic Curves* and his treatment of Bezout's theorem therein. While a purely algebraic approach is nice and has its uses, I feel like that proof and related modern proofs must be very different from Bezout's. I expect that Bezout's proof could not have used much beyond rudimentary calculus; in particular, I doubt he would have used the projective plane, exact sequences or local rings. Given that he was an 18th century mathematician, it is also unclear to me if he could even have used the Fundamental Theorem of Algebra which makes me uncertain that he would have proved it using resultants e.g., some version of a proof outlined on the wikipedia page: https://en.wikipedia.org/wiki/B%C3%A9zout%27s_theorem .

Alternatively, my question is what is the most classically analytic or down-to-earth proof of Bezout's theorem? Regarding analytic approaches to Bezout's theorem, I think that Griffiths--Harris proof (around page 171 therein) is analytic, but not classical.

Bonus points: If such a proof is substantially different from that in Fulton's *Algebraic Curves*, then can you describe how the proofs relate (assuming that they do) or how the classical proof inspires the modern proof?

7more comments