This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 8

1991 IMO, 3
Tags: algebra , Sequence , bounded , construction , IMO , imo 1991 , Harm Derksen
An infinite sequence $ \,x_{0},x_{1},x_{2},\ldots \,$ of real numbers is said to be [b]bounded[/b] if there is a constant $ \,C\,$ such that $ \, \vert x_{i} \vert \leq C\,$ for every $ \,i\geq 0$. Given any real number $ \,a > 1,\,$ construct a bounded infinite sequence $ x_{0},x_{1},x_{2},\ldots \,$ such that \[ \vert x_{i} \minus{} x_{j} \vert \vert i \minus{} j \vert^{a}\geq 1 \] for every pair of distinct nonnegative integers $ i, j$.

1989 IMO Longlists, 66
Tags: combinatorics , geometric inequality , combinatorial inequality , point set , IMO , IMO 1989 , Harm Derksen
Let $ n$ and $ k$ be positive integers and let $ S$ be a set of $ n$ points in the plane such that [b]i.)[/b] no three points of $ S$ are collinear, and [b]ii.)[/b] for every point $ P$ of $ S$ there are at least $ k$ points of $ S$ equidistant from $ P.$ Prove that: \[ k < \frac {1}{2} \plus{} \sqrt {2 \cdot n} \]

1990 IMO, 3
Tags: complex numbers , algebra , convex polygon , Perfect Squares , IMO , IMO 1990 , Harm Derksen
Prove that there exists a convex 1990-gon with the following two properties : [b]a.)[/b] All angles are equal. [b]b.)[/b] The lengths of the 1990 sides are the numbers $ 1^2$, $ 2^2$, $ 3^2$, $ \cdots$, $ 1990^2$ in some order.

1990 IMO Shortlist, 16
Tags: complex numbers , algebra , convex polygon , Perfect Squares , IMO , IMO 1990 , Harm Derksen
Prove that there exists a convex 1990-gon with the following two properties : [b]a.)[/b] All angles are equal. [b]b.)[/b] The lengths of the 1990 sides are the numbers $ 1^2$, $ 2^2$, $ 3^2$, $ \cdots$, $ 1990^2$ in some order.

1989 IMO, 3
Tags: combinatorics , geometric inequality , combinatorial inequality , point set , IMO , IMO 1989 , Harm Derksen
Let $ n$ and $ k$ be positive integers and let $ S$ be a set of $ n$ points in the plane such that [b]i.)[/b] no three points of $ S$ are collinear, and [b]ii.)[/b] for every point $ P$ of $ S$ there are at least $ k$ points of $ S$ equidistant from $ P.$ Prove that: \[ k < \frac {1}{2} \plus{} \sqrt {2 \cdot n} \]

1990 IMO Longlists, 58
Tags: complex numbers , algebra , convex polygon , Perfect Squares , IMO , IMO 1990 , Harm Derksen
Prove that there exists a convex 1990-gon with the following two properties : [b]a.)[/b] All angles are equal. [b]b.)[/b] The lengths of the 1990 sides are the numbers $ 1^2$, $ 2^2$, $ 3^2$, $ \cdots$, $ 1990^2$ in some order.

1989 IMO Shortlist, 20
Tags: combinatorics , geometric inequality , combinatorial inequality , point set , IMO , IMO 1989 , Harm Derksen
Let $ n$ and $ k$ be positive integers and let $ S$ be a set of $ n$ points in the plane such that [b]i.)[/b] no three points of $ S$ are collinear, and [b]ii.)[/b] for every point $ P$ of $ S$ there are at least $ k$ points of $ S$ equidistant from $ P.$ Prove that: \[ k < \frac {1}{2} \plus{} \sqrt {2 \cdot n} \]

1991 IMO Shortlist, 28
Tags: algebra , Sequence , bounded , construction , IMO , imo 1991 , Harm Derksen
An infinite sequence $ \,x_{0},x_{1},x_{2},\ldots \,$ of real numbers is said to be [b]bounded[/b] if there is a constant $ \,C\,$ such that $ \, \vert x_{i} \vert \leq C\,$ for every $ \,i\geq 0$. Given any real number $ \,a > 1,\,$ construct a bounded infinite sequence $ x_{0},x_{1},x_{2},\ldots \,$ such that \[ \vert x_{i} \minus{} x_{j} \vert \vert i \minus{} j \vert^{a}\geq 1 \] for every pair of distinct nonnegative integers $ i, j$.