MathDB
n-mino

Source: Iran 2005

September 1, 2005
geometryrectanglelogarithmscombinatorics proposedcombinatorics

Problem Statement

f(n)f(n) is the least number that there exist a f(n)f(n)-mino that contains every nn-mino. Prove that 10000f(1384)96000010000\leq f(1384)\leq960000. Find some bound for f(n)f(n)