MathDB
Problems
Contests
National and Regional Contests
Iran Contests
Iran MO (3rd Round)
2005 Iran MO (3rd Round)
3
n-mino
n-mino
Source: Iran 2005
September 1, 2005
geometry
rectangle
logarithms
combinatorics proposed
combinatorics
Problem Statement
f
(
n
)
f(n)
f
(
n
)
is the least number that there exist a
f
(
n
)
−
f(n)-
f
(
n
)
−
mino that contains every
n
−
n-
n
−
mino. Prove that
10000
≤
f
(
1384
)
≤
960000
10000\leq f(1384)\leq960000
10000
≤
f
(
1384
)
≤
960000
. Find some bound for
f
(
n
)
f(n)
f
(
n
)
Back to Problems
View on AoPS