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: 6

1976 Bundeswettbewerb Mathematik, 2

Two congruent squares $Q$ and $Q'$ are given in the plane. Show that they can be divided into parts $T_1, T_2, \ldots , T_n$ and $T'_1 , T'_2 , \ldots , T'_n$, respectively, such that $T'_i$ is the image of $T_i$ under a translation for $i=1,2, \ldots, n.$

2024 Brazil Cono Sur TST, 4

In the cartesian plane, consider the subset of all the points with both integer coordinates. Prove that it is possible to choose a finite non-empty subset $S$ of these points in such a way that any line $l$ that forms an angle of $90^{\circ},0^{\circ},135^{\circ}$ or $45^{\circ}$ with the positive horizontal semi-axis intersects $S$ at exactly $2024$ points or at no points.

2000 Czech And Slovak Olympiad IIIA, 3

In the plane are given $2000$ congruent triangles of area $1$, which are all images of one triangle under translations. Each of these triangles contains the centroid of every other triangle. Prove that the union of these triangles has area less than $22/9$.

1975 IMO Shortlist, 9

Let $f(x)$ be a continuous function defined on the closed interval $0 \leq x \leq 1$. Let $G(f)$ denote the graph of $f(x): G(f) = \{(x, y) \in \mathbb R^2 | 0 \leq$$ x \leq 1, y = f(x) \}$. Let $G_a(f)$ denote the graph of the translated function $f(x - a)$ (translated over a distance $a$), defined by $G_a(f) = \{(x, y) \in \mathbb R^2 | a \leq x \leq a + 1, y = f(x - a) \}$. Is it possible to find for every $a, \ 0 < a < 1$, a continuous function $f(x)$, defined on $0 \leq x \leq 1$, such that $f(0) = f(1) = 0$ and $G(f)$ and $G_a(f)$ are disjoint point sets ?

1991 IMO Shortlist, 29

We call a set $ S$ on the real line $ \mathbb{R}$ [i]superinvariant[/i] if for any stretching $ A$ of the set by the transformation taking $ x$ to $ A(x) \equal{} x_0 \plus{} a(x \minus{} x_0), a > 0$ there exists a translation $ B,$ $ B(x) \equal{} x\plus{}b,$ such that the images of $ S$ under $ A$ and $ B$ agree; i.e., for any $ x \in S$ there is a $ y \in S$ such that $ A(x) \equal{} B(y)$ and for any $ t \in S$ there is a $ u \in S$ such that $ B(t) \equal{} A(u).$ Determine all [i]superinvariant[/i] sets.

1990 IMO Longlists, 14

We call a set $S$ on the real line $R$ "superinvariant", if for any stretching $A$ of the set $S$ by the transformation taking $x$ to $A(x) = x_0 + a(x - x_0)$, where $a > 0$, there exists a transformation $B, B(x) = x + b$, such that the images of $S$ under $A$ and $B$ agree; i.e., for any $x \in S$, there is $y \in S$ such that $A(x) = B(y)$, and for any $t \in S$, there is a $u \in S$ such that $B(t) = A(u).$ Determine all superinvariant sets.