olymmath

Putnam 1964 B6

  • Session B

This is rather simple, but I liked it :).

Show that a disk cannot be partitioned into two congruent subsets.

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/1964/b6 · Tag T1G0YTGFKV · Edit this page on GitHub · Keys: j next, k previous