Prove that there are at least 100! ways to partition the number 100! into summands from the set !}. (Partitions differing in the order of summands are considered the same; any summand can be taken multiple times. We remind that .)
IZhO 2019
International Zhautykov Olympiad 2019.
Other problems
Find the biggest real number , such that for every different positive real numbers that satisfy inequality :
The extension of median of the triangle intersects its circumcircle at . Let and be the points on the rays and respectively such that and . Let and be the points on the segments and respectively such that and are tangent to . The segments and intersect at . Prove that the quadrilateral is circumscribed.
An isosceles triangle with is given. Point is chosen on the side . The circle of radius with the center touches the segment and the extensions of and over the points and , respectively. The circle of radius with the center touches the segment and the extensions of and over the points and , respectively. Let the tangent to the circumcircle of the triangle at the point intersect the line at point . Prove that .
Let be a positive integer. A function is given, where is the set of all integers coprime with . ( is the set of integers). A positive integer is called a period of the function if for all such that . It is known that is a period of . Prove that the minimal period of the function divides all its periods.
On a polynomial of degree three it is allowed to perform the following two operations arbitrarily many times:
(i) reverse the order of its coefficients including zeroes (for instance, from the polynomial we can obtain ;
(ii) change polynomial to the polynomial .
Is it possible to obtain the polynomial from the polynomial ?
The answer is no.