B-1. Let S be a set and let ∘ be a binary operation on S satisfying the two laws
x∘x=x for all x in S, and (x∘y)∘z=(y∘z)∘x for all x,y,z in S.
Show that ∘ is associative and commutative.
Dataset text PutnamGAP. 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.
Add a solution
Similar problems
These problems have the most words in common with this statement.
Locator putnam/1971/b1 · Tag EDS7J67GKD · Edit this page on GitHub · Keys: j next, k previous