Suppose $R$ is a Boolean ring. Prove that $a+a=0$ for all $a\in R$. Also prove that $R$ is commutative. Give an example (with explanation) of a Boolean ring.
From what I know, a Boolean ring is a ring for which $a^2=a$ for all $a\in R$.
Under addition a ring is a commutative group.
$a + b = b + a$ (commutative)
$(a + b) + c = a + (b + c)$ (associative)
$a + (-a) = 0$ (inverse exists for every element)
$a + 0 = a$ (identity exists)
Where $a,b,c \in R$
But I'm not really sure how to proceed with the proof from here. Any idea?
Hint. Compute $(a+1)^2$ in two ways -- once by the Boolean ring property, another time by using the distributive law that works in all rings to multiply out $(a+1)(a+1)$. Then apply $a^2=a$ once more and cancel terms that appear in both results.