In chess tournament participates $n$ participants ($n >1$). In tournament each of participants plays with each other exactly $1$ game. For each game participant have $1$ point if he wins game, $0,5$ point if game is drow and $0$ points if he lose game. If after ending of tournament participant have at least $ 75 % $ of maximum possible points he called $winner$ $of$ $tournament$. Find maximum possible numbers of $winners$ $of$ $tournament$.

Real numbers $X_1, X_2, \dots, X_{10}$ are chosen uniformly at random from the interval $[0,1]$. If the expected value of $\min(X_1,X_2,\dots, X_{10})^4$ can be expressed as a rational number $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$, what is $m+n$? [i]2016 CCA Math Bonanza Lightning #4.4[/i]

The squares of an $8 \times 8$ board are coloured alternatingly black and white. A rectangle consisting of some of the squares of the board is called [i]important[/i] if its sides are parallel to the sides of the board and all its corner squares are coloured black. The side lengths can be anything from $1$ to $8$ squares. On each of the $64$ squares of the board, we write the number of important rectangles in which it is contained. The sum of the numbers on the black squares is $B$, and the sum of the numbers on the white squares is $W$. Determine the difference $B - W$.

A family of finite sets $\left\{ A_{1},A_{2},.......,A_{m}\right\} $is called [i]equipartitionable [/i] if there is a function $\varphi:\cup_{i=1}^{m}$$\rightarrow\left\{ -1,1\right\} $ such that $\sum_{x\in A_{i}}\varphi\left(x\right)=0$ for every $i=1,.....,m.$ Let $f\left(n\right)$ denote the smallest possible number of $n$-element sets which form a non-equipartitionable family. Prove that a) $f(4k +2) = 3$ for each nonnegative integer $k$, b) $f\left(2n\right)\leq1+m d\left(n\right)$, where $m d\left(n\right)$ denotes the least positive non-divisor of $n.$

For positive integer $k>1$, let $f(k)$ be the number of ways of factoring $k$ into product of positive integers greater than $1$ (The order of factors are not countered, for example $f(12)=4$, as $12$ can be factored in these $4$ ways: $12,2\cdot 6,3\cdot 4, 2\cdot 2\cdot 3$. Prove: If $n$ is a positive integer greater than $1$, $p$ is a prime factor of $n$, then $f(n)\leq \frac{n}{p}$

Find the number of integer values of $k$ in the closed interval $[-500,500]$ for which the equation $\log(kx)=2\log(x+2)$ has exactly one real solution.

[b]p1.[/b] Trung has $2$ bells. One bell rings $6$ times per hour and the other bell rings $10$ times per hour. At the start of the hour both bells ring. After how much time will the bells ring again at the same time? Express your answer in hours. [b]p2.[/b] In a soccer tournament there are $n$ teams participating. Each team plays every other team once. The matches can end in a win for one team or in a draw. If the match ends with a win, the winner gets $3$ points and the loser gets $0$. If the match ends in a draw, each team gets $1$ point. At the end of the tournament the total number of points of all the teams is $21$. Let $p$ be the number of points of the team in the first place. Find $n + p$. [b]p3.[/b] What is the largest $3$ digit number $\overline{abc}$ such that $b \cdot \overline{ac} = c \cdot \overline{ab} + 50$? [b]p4.[/b] Let s(n) be the number of quadruplets $(x, y, z, t)$ of positive integers with the property that $n = x + y + z + t$. Find the smallest $n$ such that $s(n) > 2014$. [b]p5.[/b] Consider a decomposition of a $10 \times 10$ chessboard into p disjoint rectangles such that each rectangle contains an integral number of squares and each rectangle contains an equal number of white squares as black squares. Furthermore, each rectangle has different number of squares inside. What is the maximum of $p$? [b]p6.[/b] If two points are selected at random from a straight line segment of length $\pi$, what is the probability that the distance between them is at least $\pi- 1$? [b]p7.[/b] Find the length $n$ of the longest possible geometric progression $a_1, a_2,..,, a_n$ such that the $a_i$ are distinct positive integers between $100$ and $2014$ inclusive. [b]p8.[/b] Feng is standing in front of a $100$ story building with two identical crystal balls. A crystal ball will break if dropped from a certain floor $m$ of the building or higher, but it will not break if it is dropped from a floor lower than $m$. What is the minimum number of times Feng needs to drop a ball in order to guarantee he determined $m$ by the time all the crystal balls break? [b]p9.[/b] Let $A$ and $B$ be disjoint subsets of $\{1, 2,..., 10\}$ such that the product of the elements of $A$ is equal to the sum of the elements in $B$. Find how many such $A$ and $B$ exist. [b]p10.[/b] During the semester, the students in a math class are divided into groups of four such that every two groups have exactly $2$ students in common and no two students are in all the groups together. Find the maximum number of such groups. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Determine all triples of real numbers $(x, y, z)$ which satisfy the following system of equations: \[ \begin{cases} x+y+z=0 \\ x^3+y^3+z^3 = 90 \\ x^5+y^5+z^5=2850. \end{cases} \]

For any positive integers $a,b,c,n$, we define $$D_n(a,b,c)=\mathrm{gcd}(a+b+c,a^2+b^2+c^2,a^n+b^n+c^n).$$ 1. Prove that if $n$ is a positive integer not divisible by $3$, then for any positive integer $k$, there exist three integers $a,b,c$ such that $\mathrm{gcd}(a,b,c)=1$, and $D_n(a,b,c)>k$. 2. For any positive integer $n$ divisible by $3$, find all values of $D_n(a,b,c)$, where $a,b,c$ are three positive integers such that $\mathrm{gcd}(a,b,c)=1$.

Several paper-made disks (not necessarily equal) are put on the table so that there is some overlapping, but no disk is entirely inside another. The parts that overlap are cut off and removed. Show that the remaining parts cannot be assembled so as to form different disks.

Compute the number of primes less than $40$ that are the sum of two primes.

We say that a positive integer is guarani if the sum of the number with its reverse is a number that only has odd digits. For example, $249$ and $30$ are guarani, since $249 + 942 = 1191$ and $30 + 03 = 33$. a) How many $2021$-digit numbers are guarani? b) How many $2023$-digit numbers are guarani?

Let $ n \geq 3$ and consider a set $ E$ of $ 2n \minus{} 1$ distinct points on a circle. Suppose that exactly $ k$ of these points are to be colored black. Such a coloring is [b]good[/b] if there is at least one pair of black points such that the interior of one of the arcs between them contains exactly $ n$ points from $ E$. Find the smallest value of $ k$ so that every such coloring of $ k$ points of $ E$ is good.

Let $f(x) = x^n$ where $n$ is a fixed positive integer and $x =1, 2, \cdots .$ Is the decimal expansion $a = 0.f (1)f(2)f(3) . . .$ rational for any value of $n$ ? The decimal expansion of a is defined as follows: If $f(x) = d_1(x)d_2(x) \cdots d_{r(x)}(x)$ is the decimal expansion of $f(x)$, then $a = 0.1d_1(2)d_2(2) \cdots d_{r(2)}(2)d_1(3) . . . d_{r(3)}(3)d_1(4) \cdots .$

Let $A_1, A_2, \ldots, A_n$ be an $n$ -sided regular polygon. If $\frac{1}{A_1 A_2} = \frac{1}{A_1 A_3} + \frac{1}{A_1A_4}$, find $n$.

The numbers $x, y, z, t, a$ and $b$ are positive integers, so that $xt-yz = 1$ and $$\frac{x}{y} \ge \frac{a}{b} \ge \frac{z}{t} .$$Prove that $$ab \le (x + z) (y +t)$$

Prove that the number \[ \frac{m}{3} + \frac{m^2}{2} + \frac{m^3}{6} \] is an integer for all integer values of $m$.

Let $\omega$ be a circle and let $A,B,C,D,E$ be five points on $\omega$ in this order. Define $F=BC\cap DE$, such that the points $F$ and $A$ are on opposite sides, with regard to the line $BE$ and the line $AE$ is tangent to the circumcircle of the triangle $BFE$. a) Prove that the lines $AC$ and $DE$ are parallel b) Prove that $AE=CD$

We have a pool table $8$ meters long and $2$ meters wide with a single ball in the center. We throw the ball in a straight line and, after traveling $29$ meters, it stops at a corner of the table. How many times did the ball hit the edges of the table? Note: When the ball rebounds on the edge of the table, the two angles that form its trajectory with the edge of the table are the same.

Let $ A$ be a closed and bounded set in the plane, and let $ C$ denote the set of points at a unit distance from $ A$. Let $ p \in C$, and assume that the intersection of $ A$ with the unit circle $ K$ centered at $ p$ can be covered by an arc shorter that a semicircle of $ K$. Prove that the intersection of $ C$ with a suitable neighborhood of $ p$ is a simple arc which $ p$ is not an endpoint. [i]M. Bognar[/i]

The polynomial $P$ of degree $n$ satisfies $P(k) = \frac{k}{k +1}$ for $k = 0,1,2,...,n$. Find $P(n+1)$.

The points lie on three parallel lines with distances as indicated in the figure $A, B$ and $C$ such that square $ABCD$ is a square. Find the area of this square. [img]https://1.bp.blogspot.com/-xeFvahqPVyM/XzcFfB0-NfI/AAAAAAAAMYA/SV2XU59uBpo_K99ZBY43KSSOKe-veOdFQCLcBGAsYHQ/s0/1998%2BMohr%2Bp3.png[/img]

Let $a, b$ and $c$ be positive real numbers such that $abc = 1$. Prove the inequality $\Big(ab + bc +\frac{1}{ca}\Big)\Big(bc + ca +\frac{1}{ab}\Big)\Big(ca + ab +\frac{1}{bc}\Big)\ge (1 + 2a)(1 + 2b)(1 + 2c)$.

Source: 2018 Canadian Open Math Challenge Part B Problem 4 ----- Determine the number of $5$-tuples of integers $(x_1,x_2,x_3,x_4,x_5)$ such that $\text{(a)}$ $x_i\ge i$ for $1\le i \le 5$; $\text{(b)}$ $\sum_{i=1}^5 x_i = 25$.

In decimal representation $$\text {34!=295232799039a041408476186096435b0000000}.$$ Find the numbers $a$ and $b$.