1
Part of 2009 Romania Team Selection Test
Problems(5)
Covered by translates of A-A
Source: Romania TST 1 2009, Problem 1
5/4/2012
For non-empty subsets define In the sequel we work with non-empty finite subsets of .Prove that we can cover by at most translates of , i.e. there exists with such that
combinatorics proposedcombinatorics
Maximum of x_1+...+x_n subject to x_1+...+x_n=x_1...x_n
Source: Romania TST 4 2009, Problem 1
5/4/2012
Given an integer , determine the maximum value the sum may achieve, as the run through the positive integers, subject to and .
algebra proposedalgebra
About special rulers
Source: Romania TST 2 2009, Problem 1
5/4/2012
We call Golomb ruler a ruler of length , bearing marks , such that the lengths that can be measured using marks on the ruler are consecutive integers starting with , and each such length be measurable between just two of the gradations of the ruler. Find all Golomb rulers.
combinatorics proposedcombinatorics
Inequality for angle
Source: Romania TST 3 2009, Problem 1
5/4/2012
Let be a circumscribed quadrilateral such that , be the common point of and and be the common point of and . Show that Fixed, thank you Luis.
inequalitiesgeometry proposedgeometry
Superposing two polygonal domains
Source: Romania TST 5 2009, Problem 1
5/4/2012
Given two (identical) polygonal domains in the Euclidean plane, it is not possible in general to superpose the two using only translations and rotations. Prove that this can however be achieved by splitting one of the domains into a finite number of polygonal subdomains which then fit together, via translations and rotations in the plane, to recover the other domain.
algebrafunctiondomaingeometrygeometric transformationrotationgeometry proposed