- Round 1
Is it possible to partition the set into subsets that in each of these subsets the largest number is equal to the sum of the other numbers?
Bundeswettbewerb Mathematik 2013.
Is it possible to partition the set into subsets that in each of these subsets the largest number is equal to the sum of the other numbers?
In the interior of the square , the point lies in such a way that . Find all possible values of .
Suppose and are positive integers such that is divisible by . Prove that is a square number.
A parallelogram of paper with sides and is given. The distance between the longer sides is . The paper should be cut into exactly two parts in such a way that one can stick both the pieces together and fold it in a suitable manner to form a cube of suitable edge length without any further cuts and overlaps. Show that it is really possible and describe such a fragmentation.
Let be a convex hexagon whose vertices lie on a circle. Suppose that . Show that the diagonals and are concurrent.
Consider the Pascal's triangle in the figure where the binomial coefficients are arranged in the usual manner. Select any binomial coefficient from anywhere except the right edge of the triangle and labet it . To the right of , in the horizontal line, there are numbers, we denote them as , where is the last number of the series. Consider the line parallel to the left edge of the triangle containing , there will only be numbers diagonally above in that line. We successively name them as , where . Show that . For example, Suppose you choose (see figure), then , and .