Find all quadruples of real numbers satisfying the system of equations
Baltic Way 2010.
Find all quadruples of real numbers satisfying the system of equations
Let be a real number such that . Prove that
Let be real numbers greater than 1 . Suppose that for . Prove that
Find all polynomials with real coefficients such that
for every integer .
Let denote the set of real numbers. Find all functions such that
for all .
An board is coloured in colours such that the main diagonal (from top-left to bottom-right) is coloured in the first colour; the two adjacent diagonals are coloured in the second colour; the two next diagonals (one from above and one from below) are coloured in the third colour, etc.; the two corners (top-right and bottom-left) are coloured in the -th colour. It happens that it is possible to place on the board rooks, no two attacking each other and such that no two rooks stand on cells of the same colour. Prove that or .
There are some cities in a country; one of them is the capital. For any two cities and there is a direct flight from to and a direct flight from to , both having the same price. Suppose that all round trips with exactly one landing in every city have the same total cost. Prove that all round trips that miss the capital and with exactly one landing in every remaining city cost the same.
In a club with 30 members, every member initially had a hat. One day each member sent his hat to a different member (a member could have received more than one hat). Prove that there exists a group of 10 members such that no one in the group has received a hat from another one in the group.
There is a pile of 1000 matches. Two players each take turns and can take 1 to 5 matches. It is also allowed at most 10 times during the whole game to take 6 matches, for example 7 exceptional moves can be done by the first player and 3 moves by the second and then no more exceptional moves are allowed. Whoever takes the last match wins. Determine which player has a winning strategy.
Let be an integer with . Consider all dissections of a convex -gon into triangles by non-intersecting diagonals, and all colourings of the triangles with black and white so that triangles with a common side are always of a different colour. Find the least possible number of black triangles.
Let be a square and let be the point of intersection of its diagonals and . Two circles go through and ; respectively. Furthermore, and intersect in exactly two different points and . Prove that lies on .
Let be a convex quadrilateral with precisely one pair of parallel sides.
a) Show that the lengths of its sides (in this order) do not form an arithmetic progression.
b) Show that there is such a quadrilateral for which the lengths of its sides , form an arithmetic progression after the order of the lengths is changed.
In an acute triangle , the segment is an altitude and is the orthocentre. Given that the circumcentre of the triangle lies on the line containing the bisector of the angle , determine all possible values of .
Assume that all angles of a triangle are acute. Let and be points on the sides and of the triangle such that , and lie on the same circle. Further suppose the circle through , and intersects the side in two points and . Show that the midpoint of is the foot of the altitude from to .
The points and are chosen on the angle bisector of a triangle such that is a point inside the triangle such that and . Find .
For a positive integer , let denote the number of divisors of (e.g. ) and let denote the digit sum of (e.g. ). A positive integer is said to be amusing if there exists a positive integer such that . What is the smallest amusing odd integer greater than 1 ?
Find all positive integers such that the decimal representation of consists of odd digits only.
Let be a prime number. For each , there exists a unique integer denoted by such that and . Prove that the sequence
(addition modulo ) contains at most distinct elements.
For which do there exist pairwise distinct primes such that
Determine all positive integers for which there exists an infinite subset of the set of positive integers such that for all pairwise distinct the numbers and are coprime.