3
$\begingroup$

I'm working on this problem, but I'm missing some manipulation.

Suppose $R$ is a rng without zero divisors and has elements $a$ and $b\neq 0$ such that $ab+kb=0$ for some $k\in\mathbb{N}$ (that is, $ab+\underbrace{b+b+\cdots+b}_{k\ \textrm{times}}=0$.) I'm trying to show that $ca+kc=0=ac+kc$ for all $c\in R$.

I observe that $ (ca+kc)b=cab+kcb=c(ab+kb)=c\cdot 0=0 $ so $ca+kc=0$ since $b\neq 0$ and $R$ has no zero divisors. I can't get the other equation. I note it's equivalent to showing $ac=ca$ for all $c\in R$, so I was trying to multiply $ac-ca$ by something nonzero to get $0$ to conclude but with no luck. Does anyone see what to do to get the other equality? Thanks.

  • 0
    Sorry, I must have missed the $=$ between $0$ and $ac$. My rng is not assumed to be commutative, but I figure I can extract a left factor of $c$ from $kcb$ since it is a sum of $k$ many $cb$ terms.2012-07-31

1 Answers 1

3

Since you've already shown $ca+kc=0,$ let's ignore the information about $b$ now and work directly with $c \neq 0$ (noting the result is trivial for zero.)

Try this: $c(ac+kc)=cac+kc^2=(ca+kc)c=0$ by the previous result, and since the rng's integral, $ac+kc=0.$