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

Does there exist a set of $100$ triangles in which not one of the triangles can be covered by the other $99$?
Is it possible to cover a plane with circles in such a way that exactly $1988$ circles pass through each point? ( N . Vasiliev)
Α disk of radius $1$ is covered by seven identical disks. Prove that their radii are not less than $\frac12$ .
Is there a square with side lenght $\ell < 1$ that can completely cover any rectangle of diagonal $1$?
The convex set $F$ does not cover a semi-circle of radius $R$. Is it possible that two sets, congruent to $F$, cover the circle of radius $R$ ? What if $F$ is not convex? ( N . B . Vasiliev , A. G . Samosvat)