Difference between revisions of "2007 USAMO Problems"
m (m) |
|||
Line 29: | Line 29: | ||
A ''dinosaur'' is an animal with at least 2007 cells. It is said to be ''primitive'' it its cells cannot be partitioned into two or more dinosaurs. Find with proof the maximum number of cells in a primitive dinosaur. | A ''dinosaur'' is an animal with at least 2007 cells. It is said to be ''primitive'' it its cells cannot be partitioned into two or more dinosaurs. Find with proof the maximum number of cells in a primitive dinosaur. | ||
− | <math>{}^1</math>Animals are also called ''polyominoes''. They can be defined inductively. Two cells are ''adjacent'' if they share a complete edge. A single cell is an animal, and given an animal with <math>n</math> cells, one with <math>n+1</math> cells is obtained by adjoining a new cell by making it adjacent to one or more existing cells. | + | <small><math>{}^1</math>Animals are also called ''polyominoes''. They can be defined inductively. Two cells are ''adjacent'' if they share a complete edge. A single cell is an animal, and given an animal with <math>n</math> cells, one with <math>n+1</math> cells is obtained by adjoining a new cell by making it adjacent to one or more existing cells.</small> |
[[2007 USAMO Problems/Problem 4 | Solution]] | [[2007 USAMO Problems/Problem 4 | Solution]] | ||
Line 50: | Line 50: | ||
[[2007 USAMO Problems/Problem 6 | Solution]] | [[2007 USAMO Problems/Problem 6 | Solution]] | ||
+ | |||
+ | = See also = | ||
+ | *[[USAMO Problems and Solutions]] | ||
{{USAMO newbox|year=2007|before=[[2006 USAMO]]|after=2008 USAMO}} | {{USAMO newbox|year=2007|before=[[2006 USAMO]]|after=2008 USAMO}} |
Revision as of 16:02, 26 April 2007
Contents
Day 1
Problem 1
Let be a positive integer. Define a sequence by setting
and, for each
, letting
be the unique integer in the range
for which
is divisible by
. For instance, when
the obtained sequence is
. Prove that for any
the sequence
eventually becomes constant.
Problem 2
A square grid on the Euclidean plane consists of all points , where
and
are integers. Is it possible to cover all grid points by an infinite family of discs with non-overlapping interiors if each disc in the family has radius at least 5?
Problem 3
Let be a set containing
elements, for some positive integer
. Suppose that the
-element subsets of
are partitioned into two classes. Prove that there are at least
pairwise disjoint sets in the same class.
Day 2
Problem 4
An animal with cells is a connected figure consisting of
equal-sized cells.
The figure below shows an 8-cell animal.
(insert picture here)
A dinosaur is an animal with at least 2007 cells. It is said to be primitive it its cells cannot be partitioned into two or more dinosaurs. Find with proof the maximum number of cells in a primitive dinosaur.
Animals are also called polyominoes. They can be defined inductively. Two cells are adjacent if they share a complete edge. A single cell is an animal, and given an animal with
cells, one with
cells is obtained by adjoining a new cell by making it adjacent to one or more existing cells.
Problem 5
Prove that for every nonnegative integer , the number
is the product of at least
(not necessarily distinct) primes.
Problem 6
Let be an acute triangle with
,
, and
being its incircle, circumcircle, and circumradius, respectively. Circle
is tangent internally to
at
and tangent externally to
. Circle
is tangent internally to
at
and tangent internally to
. Let
and
denote the centers of
and
, respectively. Define points
,
,
,
analogously. Prove that
with equality if and only if triangle is equilateral.
See also
2007 USAMO (Problems • Resources) | ||
Preceded by 2006 USAMO |
Followed by 2008 USAMO | |
1 • 2 • 3 • 4 • 5 • 6 | ||
All USAMO Problems and Solutions |