olymmath

Putnam 1971 B1

  • Session B

B-1. Let SS be a set and let ∘\circ be a binary operation on SS 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.\begin{array}{l} x \circ x=x \text { for all } x \text { in } S \text {, and } \\ (x \circ y) \circ z=(y \circ z) \circ x \text { for all } x, y, z \text { in } S . \end{array}

Show that ∘\circ 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