Given are positive reals , such that . Prove that .
Albania
Balkan MO Shortlist 2020.
Given are positive reals , such that . Prove that .
Albania
Let be distinct polynomials of degree with non-zero coefficients. Suppose that they have common real roots counting multiplicity and common coefficients. Determine the maximum possible value of .
Demetres Christofides, Cyprus
Let be a polynomial with real coefficients and three real roots , , such that . Let be the point where the graph of intersects and the point , , . If the circumcircle of intersects for a second time at , find the minimum value of the length of the segment and the polynomials for which this is attained.
Brazitikos Silouanos, Greece
Let and be integes, and let be a subset of of size at least such that any two members of share some entry. Prove that there are an integer and members of such that and share the -th entry alone, whenever and are distinct.
Miroslav Marinov, Bulgaria
Odin and Evelyn are playing a game, Odin going first. There are initially empty boxes, for some given positive integer . On each player's turn, they can write a non-negative integer in an empty box, or erase a number in a box and replace it with a strictly smaller non-negative integer. However, Odin is only ever allowed to write odd numbers, and Evelyn is only allowed to write even numbers. The game ends when either one of the players cannot move, in which case the other player wins; or there are exactly boxes with the number , in which case Evelyn wins if all other boxes contain the number , and Odin wins otherwise. Who has a winning strategy?
A strategical video game consists of a map of finitely many towns. In each town there are directions, labelled from through . One of the towns is designated as initial, and one - as terminal. Starting from the initial town the hero of the game makes a finite sequence of moves. At each move the hero selects a direction from the current town. This determines the next town he visits and a certain positive amount of points he receives. Two strategical video games are equivalent if for every sequence of directions the hero can reach the terminal town from the initial in one game, he can do so in the other game, and, in addition, he accumulates the same amount of points in both games. For his birthday John receives two strategical video games - one with towns and one with towns. He claims they are equivalent. Marry is convinced they are not. Marry is right. Prove that she can provide a sequence of at most directions that shows the two games are indeed not equivalent.
Stefan Gerdjikov, Bulgaria
Let be the centroid and orthocentre of which has an obtuse angle at . Let be the circle with diameter . intersects again at . The tangent to at intersects at . Given that , prove . Sam Bealing, United Kingdom
Let be a triangle. On the sides , , of the triangle, construct outwardly three squares with centres , , respectively. Let be the circumcircle of . Given that lies on , prove that the centre of lies on the perimeter of .
Sam Bealing, United Kingdom
Let be an isosceles trapezium inscribed in a circle with centre . Assume that is a diameter of and let be the midpoint of . Let be the perpendicular line on passing through . Let be a point on , let be the point of intersection of with and assume that is perpendicular to . Let be the point of intersection of with and let be the antidiametric point of on . Let be the point of intersection of and . Assume that the tangents of at the points and meet the lines and at the points and respectively. Prove that is perpendicular to .
Theoklitos Parayiou, Cyprus
Let be an isosceles triangle with and . Its circumcircle has center is the midpoint of and is the foot of the perpendicular from to . With center and radius we draw a circle which internally intersects at the point and the circle at the points and , such that lies on the small arc and on the small arc . Prove that the lines , , are concurrent.
Brazitikos Silouanos, Greece
Determine all positive integers such that is a positive integer for some .
A number of children are at a party and they sit in a circle to play a game of Pass and Parcel. Because the host has no other form of entertainment, the parcel has infinitely many layers. On turn , starting with , the following two things happen in order: The parcel is passed positions clockwise; and**** The child currently holding the parcel unwraps a layer and claims the prize inside. For what values of will every chidren receive a prize?
Given an integer , determine all functions from the positive integers into themselves such that is divisibe by for all positive integers .
Consider an integer and an odd prime . Let be the set of all positive integers strictly less than that are not divisible by , and let be the number of elements of . Does there exist permutation of the numbers in such that the sum ,where , be divisible by but not by ?