Let R be a ring of characteristic m > 0, and let n be any(adsbygoogle = window.adsbygoogle || []).push({});

integer. Show that:

if 1 < gcd(n,m) < m, then n · 1R is a zero divisor

heres what i got out of this:

Let gcd(n,m) = b

1< d < m so m/d = b < m

and d | n

Also, m * 1_R = 0

can someone please offer some insight?

thanks,

nick

**Physics Forums | Science Articles, Homework Help, Discussion**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Im soooooo close to solving this problem (Rings)

**Physics Forums | Science Articles, Homework Help, Discussion**