2
Part of 2003 Romania National Olympiad
Problems(6)
Triangle
Source: RMO 2003, Grade 7, Problem 2
10/23/2008
Compute the maximum area of a triangle having a median of length 1 and a median of length 2.
geometry
Meeting
Source: RMO 2003, Grade 8, Problem 2
10/23/2008
In a meeting there are 6 participants. It is known that among them there are seven pairs of friends and in any group of three persons there are at least two friends. Prove that:
(a) there exists a person who has at least three friends;
(b) there exists three persons who are friends with each other.
Valentin Vornicu
pigeonhole principle
Friendly numbers
Source: RMO 2003, Grade 9, Problem 2
10/23/2008
An integer , is called friendly if there exists a family of subsets of the set such that:
(1) for every i\equal{}\overline{1,n};
(2) if and only if , for every distinct ;
(3) is non-empty, for every .
Prove that:
(a) 7 is a friendly number;
(b) is friendly if and only if .
Valentin Vornicu
modular arithmetic
A fatal linear algebra problem by M. Andronache
Source: RomNO 2003, grade xi, p.2
8/27/2019
Let be eight real numbers Prove that
Marian Andronache, Ion Savu
Matricesandronachelinear algebraalgebra
Complex representation of a pentagon
Source: Romanian National Olympiad 2003, grade x, p.2
8/27/2019
Let be five nonzero complex numbers having the same absolute value and such that zero is equal to their sum, which is equal to the sum of their squares. Prove that the affixes of these numbers in the complex plane form a regular pentagon.
Daniel Jinga
complex numbersabsolute valuealgebrageometrypentagon
Find all count. functions (Titu Andreescu)
Source: RomNO 2003, grade xii, p.2
8/27/2019
Let be an odd natural number Find all continuous functions that satisfy the following equalities.
\int_0^1 \left( f\left(\sqrt[k]{x}\right) \right)^{n-k} dx=k/n, \forall k\in\{ 1,2,\ldots ,n-1\}
Titu Andreescu
functionreal analysisintegrationDefinite integralTitu Andreescu