3
Part of 2005 Romania Team Selection Test
Problems(5)
all distances between n points are less than 1 - max area
Source: Romanian IMO TST 2005 - day 3, problem 3
4/19/2005
Let be a polygon (not necessarily convex) with vertices, such that all its sides and diagonals are less or equal with 1 in length. Prove that the area of the polygon is less than .
geometryintegrationperimeteranalytic geometryinequalitiescalculusgeometry proposed
another hard solid geometry - at first look anyway
Source: Romanian IMO TST - day 1, problem 3
3/31/2005
Prove that if the distance from a point inside a convex polyhedra with faces to the vertices of the polyhedra is at most 1, then the sum of the distances from this point to the faces of the polyhedra is smaller than .
Calin Popescu
geometry3D geometrycircumcircleinequalitiestetrahedronspheregeometry proposed
bounded bs sequence
Source: Romanian IMO TST 2005 - day 2, problem 3
4/1/2005
A sequence of real numbers is called a bs sequence if , for all . Prove that a bs sequence is bounded if and only if the function given by , for all is the null function.
Mihai Baluna - ISL 2004
functioninductionalgebra proposedalgebra
prime of the form 8k+7 and fractional parts sum
Source: Romanian IMO TST 2005 - day 4, problem 3
4/23/2005
Let be an integer and let be a prime number. Prove that
Călin Popescu
modular arithmeticfloor functionquadraticsinductionalgebrafunctional equationnumber theory proposed
hard functional equation with divisibility
Source: Romanian IMO TST 2005 - day 5, problem 3
4/24/2005
Let . Find all functions such that for all the number is a divisor of .
functionlinear algebramatrixalgebra proposedalgebra