olymmath

Putnam 1984 B3

  • Session B

Prove or disprove the following statement: If FF is a finite set with two or more elements, then there exists a binary operation ∗* on FF such that for all x,y,zx,y,z in FF , (i)(\text i) x∗z=y∗zx*z=y*z implies x=yx=y (ii)(\text{ii}) x∗(y∗z)≠(x∗y)∗zx*(y*z)\ne(x*y)*z

Dataset text AI-MO AoPS. 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/1984/b3 · Tag 1CXAYJKV2R · Edit this page on GitHub · Keys: j next, k previous