Hi everybody,
f is a binary operation defined in as follows:
I find that is commutative and associative.
I must show that takes a neutral element; and i must find if each element of has an inverse element?
How to do it??
Thanks.
Hi everybody,
f is a binary operation defined in as follows:
I find that is commutative and associative.
I must show that takes a neutral element; and i must find if each element of has an inverse element?
How to do it??
Thanks.