Olympiad problems

1995 Tournament Of Towns, (450) 6

Can it happen that $6$ parallelepipeds, no two of which have common points, are placed in space so that there is a point outside of them from which no vertex of a parallelepiped is visible? (The parallelepipeds are not transparent.) (V Proizvolov)

1986 All Soviet Union Mathematical Olympiad, 429

Tags: combinatorics , combinatorial geometry , cube , unit cube , sum

A cube with edge of length $n$ ($n\ge 3$) consists of $n^3$ unit cubes. Prove that it is possible to write different $n^3$ integers on all the unit cubes to provide the zero sum of all integers in the every row parallel to some edge.

1983 Bundeswettbewerb Mathematik, 4

Tags: distance , combinatorics , combinatorial geometry

Let $g$ be a straight line and $n$ a given positive integer. Prove that there are always n different points on g to choose as well as a point not lying on g in such a way that the distance between each two of these $n + 1$ points is an integer.

2014 Chile National Olympiad, 5

Tags: geometry , combinatorics , combinatorial geometry , parallelogram

Prove that if a quadrilateral $ABCD$ can be cut into a finite number of parallelograms, then $ABCD$ is a parallelogram.

1978 All Soviet Union Mathematical Olympiad, 265

Tags: combinatorics , combinatorial geometry , lattice points

Given a simple number $p>3$. Consider the set $M$ of the pairs $(x,y)$ with the integer coordinates in the plane such that $0 \le x < p, 0 \le y < p$. Prove that it is possible to mark $p$ points of $M$ such that not a triple of marked points will belong to one line and there will be no parallelogram with the vertices in the marked points.

1972 All Soviet Union Mathematical Olympiad, 166

Tags: combinatorial geometry , geometry , square

Each of the $9$ straight lines divides the given square onto two quadrangles with the areas ratio as $2:3$. Prove that there exist three of them intersecting in one point

2018 MMATHS, 3

Tags: combinatorics , geometry , combinatorial geometry

Suppose $n$ points are uniformly chosen at random on the circumference of the unit circle and that they are then connected with line segments to form an $n$-gon. What is the probability that the origin is contained in the interior of this $n$-gon? Give your answer in terms of $n$, and consider only $n \ge 3$.

2013 JBMO Shortlist, 2

Tags: rectangle , combinatorics , combinatorial geometry

In a billiard with shape of a rectangle $ABCD$ with $AB=2013$ and $AD=1000$, a ball is launched along the line of the bisector of $\angle BAD$. Supposing that the ball is reflected on the sides with the same angle at the impact point as the angle shot , examine if it shall ever reach at vertex B.

2016 Saint Petersburg Mathematical Olympiad, 6

Tags: combinatorics , combinatorial geometry , odd , polygon , clo

The circle contains a closed $100$-part broken line, such that no three segments pass through one point. All its corners are obtuse, and their sum in degrees is divided by $720$. Prove that this broken line has an odd number of self-intersection points.

2011 QEDMO 8th, 8

Tags: combinatorics , lattice , combinatorial geometry , coloring

Albatross and Frankinfueter are playing again: each of them takes turns choosing one point in the plane with integer coordinates and paint it in his favorite color. Albatross plays first. Someone wins as soon as there is a square with all four corners in the are colored in their own color. Does anyone has a winning strategy and if so, who?

1955 Moscow Mathematical Olympiad, 309

Tags: combinatorial geometry , combinatorics , number theory , convex polygon , enumeration

A point $O$ inside a convex $n$-gon $A_1A_2 . . .A_n$ is connected with segments to its vertices. The sides of this $n$-gon are numbered $1$ to $n$ (distinct sides have distinct numbers). The segments $OA_1,OA_2, . . . ,OA_n$ are similarly numbered. a) For $n = 9$ find a numeration such that the sum of the sides’ numbers is the same for all triangles $A_1OA_2, A_2OA_3, . . . , A_nOA_1$. b) Prove that for $n = 10$ there is no such numeration.

1984 Tournament Of Towns, (079) 5

Tags: combinatorics , combinatorial geometry , tiling

A $7 \times 7$ square is made up of $16$ $1 \times 3$ tiles and $1$ $1 \times 1$ tile. Prove that the $1 \times 1$ tile lies either at the centre of the square or adjoins one of its boundaries .

2004 All-Russian Olympiad Regional Round, 10.4

Tags: geometry , combinatorics , combinatorial geometry

$N \ge 3$ different points are marked on the plane. It is known that among pairwise distances between marked points there are not more than $n$ different distances. Prove that $N \le (n + 1)^2$.

I Soros Olympiad 1994-95 (Rus + Ukr), 10.4

Tags: combinatorics , geometry , combinatorial geometry

There are 1995 segments such that a triangle can be formed from any three of them. Prove that using these $1995 $ segments, it is possible to assemble $664$ acute-angled triangles so that each segment is part of no more than one triangle.

1995 Poland - Second Round, 6

Tags: tiling , combinatorics , combinatorial geometry

Determine all positive integers $n$ for which the square $n \times n$ can be cut into squares $2\times 2$ and $3\times3$ (with the sides parallel to the sides of the big square).

2009 Junior Balkan Team Selection Tests - Romania, 3

Tags: combinatorics , equilateral , combinatorial geometry

The plane is divided into a net of equilateral triangles of side length $1$, with disjoint interiors. A checker is placed initialy inside a triangle. The checker can be moved into another triangle sharing a common vertex (with the triangle hosting the checker) and having the opposite sides (with respect to this vertex) parallel. A path consists in a finite sequence of moves. Prove that there is no path between two triangles sharing a common side.

2019 Korea Junior Math Olympiad., 1

Tags: combinatorial geometry , algebraic geometry , combinatorics , coloring

Each integer coordinates are colored with one color and at least 5 colors are used to color every integer coordinates. Two integer coordinates $(x, y)$ and $(z, w)$ are colored in the same color if $x-z$ and $y-w$ are both multiples of 3. Prove that there exists a line that passes through exactly three points when five points with different colors are chosen randomly.

2005 China National Olympiad, 5

Tags: geometry , rectangle , combinatorial geometry , combinatorics

There are 5 points in a rectangle (including its boundary) with area 1, no three of them are in the same line. Find the minimum number of triangles with the area not more than $\frac 1{4}$, vertex of which are three of the five points.

1984 Bulgaria National Olympiad, Problem 3

Tags: geometry , 3d geometry , tetrahedron , combinatorics , combinatorial geometry

Points $P_1,P_2,\ldots,P_n,Q$ are given in space $(n\ge4)$, no four of which are in a plane. Prove that if for any three distinct points $P_\alpha,P_\beta,P_\gamma$ there is a point $P_\delta$ such that the tetrahedron $P_\alpha P_\beta P_\gamma P_\delta$ contains the point $Q$, then $n$ is an even number.

2016 Taiwan TST Round 2, 3

Tags: combinatorial geometry , combinatorics

There is a grid of equilateral triangles with a distance 1 between any two neighboring grid points. An equilateral triangle with side length $n$ lies on the grid so that all of its vertices are grid points, and all of its sides match the grid. Now, let us decompose this equilateral triangle into $n^2$ smaller triangles (not necessarily equilateral triangles) so that the vertices of all these smaller triangles are all grid points, and all these small triangles have equal areas. Prove that there are at least $n$ equilateral triangles among these smaller triangles.

2011 Philippine MO, 3

Tags: prime number , combinatorial geometry , number theory

The $2011$th prime number is $17483$ and the next prime is $17489$. Does there exist a sequence of $2011^{2011}$ consecutive positive integers that contain exactly $2011$ prime numbers?

1983 Tournament Of Towns, (036) O5

Tags: geometry , geometric transformation , reflection , combinatorial geometry , combinatorics

A version of billiards is played on a right triangular table, with a pocket in each of the three corners, and one of the acute angles being $30^o$. A ball is played from just in front of the pocket at the $30^o$. vertex toward the midpoint of the opposite side. Prove that if the ball is played hard enough, it will land in the pocket of the $60^o$ vertex after $8$ reflections.