olymmath

HMMT 2020 T2

  • Team

Let nn be a fixed positive integer. An nn-staircase is a polyomino with n(n+1)2\frac{n(n+1)}{2} cells arranged in the shape of a staircase, with arbitrary size. Here are two examples of 5 -staircases:

Prove that an nn-staircase can be dissected into strictly smaller nn-staircases.

Dataset text NuminaMath olympiads. 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 hmmt/2020/t2 · Tag 3SG5QF65RV · Edit this page on GitHub · Keys: j next, k previous