Problems(5)
rectangle m x n can be tilled with t-shapes and p-shapes
Source: 2017 Romania JBMO TST 1.4
6/27/2020
Two right isosceles triangles of legs equal to are glued together to form either an isosceles triangle - called t-shape - of leg , or a parallelogram - called p-shape - of sides and . Find all integers and , such that a rectangle can be tilled with t-shapes and p-shapes.
combinatoricscombinatorial geometrytilesTiling
sum a/{1 + 2b^3} >= (a^2 + b^2 + c^2 + d^2}/3 if a,b,c,d>=0, a+b+c+d = 3
Source: 2017 Romania JBMO TST 2.4
6/27/2020
Let be non-negative real numbers satisfying . Prove that
When does the equality hold?
inequalitiesalgebra
Combinatorics, equilateral triangles are divided
Source: JBMO TST 3 2017 P4
11/14/2018
The sides of an equilateral triangle are divided into n equal parts by points on each side. Through these points one draws parallel lines to the sides of the triangle. Thus, the initial triangle is divides into equal equilateral triangles. In every vertex of such a triangle there is a beetle. The beetles start crawling simultaneously, with equal speed, along the sides of the small triangles. When they reach a vertex, the beetles change the direction of their movement by or by
.
a) Prove that, if , the beetles can move indefinitely on the sides of the small triangles
without two beetles ever meeting in a vertex of a small triangle.
b) Determine all the values of for which the beetles can move along the sides of the small
triangles without meeting in their vertices.
combinatorics
<NHP=<AHQ wanted, 2 equilateral triangles exterior to a right triangle
Source: 2017 Romania JBMO TST4 p4
5/16/2020
Let be a right triangle, with the right angle at . The altitude from meets at and is the midpoint of the hypotenuse . On the legs, in the exterior of the triangle, equilateral triangles and are constructed. If is the intersection point of the lines and , prove that the angles and are equal.Miguel Ochoa Sanchez and Leonard Giugiuc
Equilateralgeometryanglesequal angles
min no of red unit squares to be painting into a m x n board
Source: 2017 Romania JBMO TST 5.4
6/27/2020
Consider an m\times n board where are positive integers, divided into unit squares. Initially all the squares are white. What is the minimum number of squares that need to be painted red such that each 3\times 3 square contains at least two red squares? Andrei Eckstein and Alexandru Mihalcu
combinatorial geometrycombinatoricsColoring