Show that: and

Printable View

- December 19th 2008, 01:03 AMSeaDivisibility (gcd) 8
Show that: and

- December 19th 2008, 01:40 AMIsomorphism
Let and

Thus . -----------------(1)

By Bezout's identity we know that there exists non negative integers x and y such that .

But

Thus -------------(2)

(1) and (2) imply - December 19th 2008, 02:17 AMSea
I don't know...

(Why?)

(Why?) - December 19th 2008, 02:29 AMMoo
- December 19th 2008, 03:53 AMPaulRS
A slightly different way.

We have (as Moo points out) thus (1)

Now let be a common divisor of and i.e.

From the first congruence we get and from the second thus it must be that hence

So every common divisor divides and by (1) we are done (because it's the greatest possible)