> Integer multiplication also forms a semigroup (and in fact a monoid, due to identity), but not a full group due to zero not having an inverse.
Wait, what? Very few integers have multiplicative inverses (in the integers). If you meant to speak of modular inverses, then even that is false for composite moduli like 2^n (with n > 1), which may be why im4w1 (https://news.ycombinator.com/item?id=12113934) asked if you meant to work modulo a prime.
Re:Algebraic patterns – Semigroup
by groovy2shoes on Monday July 18, 2016 @10:05PM
(#12119086)
Ah, you're right. I don't know what I was thinking. Thanks for the correction!
You mean integer multiplication in Z_p?
Re:Algebraic patterns – Semigroup
by groovy2shoes on Monday July 18, 2016 @06:39AM
(#12114240)
Well, Z_n in this case, but yes.
Note that both the full integers as well as the integers modulo n are groups under addition. As groups are more restrictive than semigroups, all groups are also semigroups (groups are semigroups that also have an identity element and where every element is invertible).
Integer multiplication also forms a semigroup (and in fact a monoid, due to identity), but not a full group due to zero not having an inverse. So, it's usually said that "the non-zero integers" form a group.