Results 1 to 5 of 5

- November 17th 2013, 06:01 AM #1

- Joined
- Feb 2013
- From
- US
- Posts
- 37
- Thanks
- 1

- November 17th 2013, 07:03 AM #2

- November 18th 2013, 06:00 AM #3

- Joined
- Jun 2013
- From
- Lebanon
- Posts
- 461
- Thanks
- 205

- November 21st 2013, 04:44 AM #4

- Joined
- Feb 2013
- From
- US
- Posts
- 37
- Thanks
- 1

- November 22nd 2013, 07:27 AM #5

- Joined
- Jun 2013
- From
- Lebanon
- Posts
- 461
- Thanks
- 205

## Re: Another GCD problem

I would like to see a solution of this problem using Bezout's theorem.

Here is a reference to Bezout's theorem as seen in Wikipedia

Bézout's theorem - Wikipedia, the free encyclopedia

.....X and Y are two algebraic curves in the Euclidean plane whose implicit equations are polynomials of degrees m and n without any non-constant common factor, then the number of intersection points does not exceed mn.

Thanks