(1989 Putnam Competition) Let S be a nonempty set with an
Chapter 4, Problem 31SE(choose chapter or problem)
(1989 Putnam Competition) Let S be a nonempty set with an associative operation that is left and right cancellative (xy = xz implies y = z, and yx = zx implies y = z). Assume that for every a in S the set \(\{a^n | n = 1, 2, 3, . . .\}\) is finite. Must S be a group?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer