Putnam 1989 B2
- Session B
Let be a non-empty set with an associative operation that is left and right cancellative ( implies , and implies ). Assume that for every in the set is finite. Must be a group?
Curated text Kedlaya Putnam archive. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.