There's a real number written on every field of a $n \times n$ chess board. The sum of all numbers of a "cross" (union of a line and a column) is $\geq a$. What's the smallest possible sum of all numbers on the board¿

For a function $f : [0,1] \to [0,1] $ we define $f^1 = f $ and $f^{n+1} (x) = f (f^n(x))$ for $0 \le x \le 1$ and $n \in N$. Given that there is a $n$ such that $|f^n(x) - f^n(y)| < |x - y| $ for all distinct $x, y \in [0,1]$, prove that there is a unique $x_0 \in [0,1]$ such that $f (x_0) = x_0$.

[b]E[/b]ach of the integers $1,2,...,729$ is written in its base-$3$ representation without leading zeroes. The numbers are then joined together in that order to form a continuous string of digits: $12101112202122...$ How many times in this string does the substring $012$ appear?

How many of $ 11^2 \plus{} 13^2 \plus{} 17^2$, $ 24^2 \plus{} 25^2 \plus{} 26^2$, $ 12^2 \plus{} 24^2 \plus{} 36^2$, $ 11^2 \plus{} 12^2 \plus{} 132^2$ are perfect square ? $\textbf{(A)}\ 4 \qquad\textbf{(B)}\ 3 \qquad\textbf{(C)}\ 2 d)1 \qquad\textbf{(E)}\ 0$

Show that for all positive integers $n$, the number $2^{3^n}+1$ is divisible by $3^{n+1}$.

For a positive integer $N$, we color the positive divisors of $N$ (including 1 and $N$) with four colors. A coloring is called [i]multichromatic[/i] if whenever $a$, $b$ and $\gcd(a, b)$ are pairwise distinct divisors of $N$, then they have pairwise distinct colors. What is the maximum possible number of multichromatic colorings a positive integer can have if it is not the power of any prime?

An acute-angled triangle $ABC$ with an altitude $AD$ and orthocenter $H$ are given. $AD$ intersects the circumcircle of $ABC$ $\omega$ at $P$. $K$ is a point on segment $BC$ such that $KC=BD$. The circumcircle of $KPH$ intersects $\omega$ at $Q$ and $BC$ at $N$. A line perpendicular to $PQ$ and passing through $N$ intersects $AD$ at $T$. Prove that the center of $\omega$ lies on line $TK$. [i]U. Maksimenkau[/i]

[b]p1.[/b] (a) Brian has a big job to do that will take him two hours to complete. He has six friends who can help him. They all work at the same rate, somewhat slower than Brian. All seven working together can finish the job in $45$ minutes. How long will it take to do the job if Brian worked with only three of his friends? (b) Brian could do his next job in $N$ hours, working alone. This time he has an unlimited list of friends who can help him, but as he moves down the list, each friend works more slowly than those above on the list. The first friend would take $kN$ ($k > 1$) hours to do the job alone, the second friend would take $k^2N$ hours alone, the third friend would take $k^3N$ hours alone, etc. Theoretically, if Brian could get all his infinite number of friends to help him, how long would it take to complete the job? [b]p2.[/b] (a) The centers of two circles of radius $1$ are two opposite vertices of a square of side $1$. Find the area of the intersection of the two circles. (b) The centers of two circles of radius $1$ are two consecutive vertices of a square of side $1$. Find the area of the intersection of the two circles and the square. (c) The centers of four circles of radius $1$ are the vertices of a square of side $1$. Find the area of the intersection of the four circles. [b]p3.[/b] For any real number$ x$, $[x]$ denotes the greatest integer that does not exceed $x$. For example, $[7.3] = 7$, $[10/3] = 3$, $[5] = 5$. Given natural number $N$, denote as $f(N)$ the following sum of $N$ integers: $$f(N) = [N/1] + [N/2] + [N/3] + ... + [N/n].$$ (a) Evaluate $f(7) - f(6)$. (b) Evaluate $f(35) - f(34)$. (c) Evaluate (with explanation) $f(1996) - f(1995)$. [b]p4.[/b] We will say that triangle $ABC$ is good if it satisfies the following conditions: $AB = 7$, the other two sides are integers, and $\cos A =\frac27$. (a) Find the sides of a good isosceles triangle. (b) Find the sides of a good scalene (i.e. non-isosceles) triangle. (c) Find the sides of a good scalene triangle other than the one you found in (b) and prove that any good triangle is congruent to one of the three triangles you have found. [b]p5.[/b] (a) A bag contains nine balls, some of which are white, the others are black. Two balls are drawn at random from the bag, without replacement. It is found that the probability that the two balls are of the same color is the same as the probability that they are of different colors. How many of the nine balls were of one color and how many of the other color? (b) A bag contains $N$ balls, some of which are white, the others are black. Two balls are drawn at random from the bag, without replacement. It is found that the probability that the two balls are of the same color is the same as the probability that they are of different colors. It is also found that $180 < N < 220$. Find the exact value of $N$ and determine how many of the $N$ balls were of one color and how many of the other color. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ABC$ be an acute triangle with $\angle BAC=30^{\circ}$. The internal and external angle bisectors of $\angle ABC$ meet the line $AC$ at $B_1$ and $B_2$, respectively, and the internal and external angle bisectors of $\angle ACB$ meet the line $AB$ at $C_1$ and $C_2$, respectively. Suppose that the circles with diameters $B_1B_2$ and $C_1C_2$ meet inside the triangle $ABC$ at point $P$. Prove that $\angle BPC=90^{\circ}$ .

Given a $19 \times 19$ matrix where each component is either $1$ or $-1$. Let $b_i$ be the product of all components in the $i$-th row, and $k_i$ be the product of all components in the $i$-th column, for all $1 \le i \le 19$. Prove that for any such matrix, $b_1 + k_1 + b_2 + k_2 + \cdots + b_{19} + k_{19} \neq 0$.

Two lines intersect inside a unit square, splitting it into four regions. Find the maximum product of the areas of the four regions. [i]Proposed by Nathan Ramesh

Given a triangle $ABC$, with $I$ as its incenter and $\Gamma$ as its circumcircle, $AI$ intersects $\Gamma$ again at $D$. Let $E$ be a point on the arc $BDC$, and $F$ a point on the segment $BC$, such that $\angle BAF=\angle CAE < \dfrac12\angle BAC$. If $G$ is the midpoint of $IF$, prove that the meeting point of the lines $EI$ and $DG$ lies on $\Gamma$. [i]Proposed by Tai Wai Ming and Wang Chongli, Hong Kong[/i]

An aircraft is equipped with three engines that operate independently. The probability of an engine failure is .01. What is the probability of a successful flight if only one engine is needed for the successful operation of the aircraft?

Given an isosceles triangle $BAC$ with vertex angle $\angle BAC =20^o$. Construct an equilateral triangle $BDC$ such that $D,A$ are on the same side wrt $BC$. Construct an isosceles triangle $DEB$ with vertex angle $\angle EDB = 80^o$ and $C,E$ are on the different sides wrt $DB$. Prove that the triangle $AEC$ is isosceles at $E$.

Let $ n$ be a positive integer and let $ a_i$ be real numbers, $ i \equal{} 1,2,\ldots,n$ such that $ |a_i|\leq 1$ and $ \sum_{i\equal{}1}^n a_i \equal{} 0$. Show that $ \sum_{i\equal{}1}^n |x \minus{} a_i|\leq n$, for every $ x\in \mathbb{R}$ with $ |x|\le 1$.

If you walk for $ 45$ minutes at a rate of $ 4$ mph and then run for $ 30$ minutes at a rate of $ 10$ mph, how many miles have you gone at the end of one hour and $ 15$ minutes? \[ \textbf{(A)}\ 3.5 \text{ miles} \qquad \textbf{(B)}\ 8 \text{ miles} \qquad \textbf{(C)}\ 9 \text{ miles} \qquad \textbf{(D)}\ 25 \frac{1}{3} \text{ miles} \qquad \textbf{(E)}\ 480 \text{ miles} \]

Let $\ell$ be a positive integer, and let $m,n$ be positive integers with $m\geq n$, such that $A_1,A_2,\cdots,A_m,B_1,\cdots,B_m$ are $m+n$ pairwise distinct subsets of the set $\{1,2,\cdots,\ell\}$. It is known that $A_i\Delta B_j$ are pairwise distinct, $1\leq i\leq m, 1\leq j\leq n$, and runs over all nonempty subsets of $\{1,2,\cdots,\ell\}$. Find all possible values of $m,n$.

For each $k$, $\mathcal{C}_k$ is biased so that, when tossed, it has probability $\tfrac{1}{(2k+1)}$ of falling heads. If the $n$ coins are tossed, what is the probability that the number of heads is odd? Express the answer as a rational function $n$.

Let $BM$ be the median of triangle $ABC$ in which $AB > BC$. The point $P$ is chosen so that $AB\parallel PC$ and $PM \perp BM$. On the line $BP$, point $Q$ is chosen so that $\angle AQC = 90^\circ$, and points $B$ and $Q$ are on opposite sides of the line $AC$. Prove that $AB = BQ$. [i]Proposed by Mykhailo Shtandenko[/i]

Compute the number of ordered quadruples $(a,b,c,d)$ of distinct positive integers such that $\displaystyle \binom{\binom{a}{b}}{\binom{c}{d}}=21$. [i]Proposed by Luke Robitaille[/i]

Prove that there exists a sequence of unbounded positive integers $a_1\leq a_2\leq a_3\leq\cdots$, such that there exists a positive integer $M$ with the following property: for any integer $n\geq M$, if $n+1$ is not prime, then any prime divisor of $n!+1$ is greater than $n+a_n$.

In the plane are given 100 lines such that no 2 are parallel and no 3 meet in a point. The intersection points are marked. Then all the lines and k of the marked points are erased. Given the remained points of intersection for what max k one can reconstruct the lines? [i]Proposed by A. Golovanov[/i]

Let be a tetahedron $ ABCD, $ and $ E $ be the projection of $ D $ on the plane formed by $ ABC. $ If $ \mathcal{A}_{\mathcal{R}} $ denotes the area of the region $ \mathcal{R}, $ show that the following affirmations are equivalent: [b]a)[/b] $ C=E\vee CE\parallel AB $ [b]b)[/b] $ M\in\overline{CD}\implies\mathcal{A}_{ABM}^2=\frac{CM^2}{CD^2}\cdot\mathcal{A}_{ABD}^2 +\left( 1-\frac{CM^2}{CD^2}\right)\cdot\mathcal{A}_{ABC}^2 $

Let $n$ points lie on the circle. Exactly half of triangles formed by these points are acute-angled. Find all possible $n$. (B.Frenkin)

The set of real numbers $ x$ for which \[ \frac{1}{x\minus{}2009}\plus{}\frac{1}{x\minus{}2010}\plus{}\frac{1}{x\minus{}2011}\ge 1\] is the union of intervals of the form $ a<x\le b$. What is the sum of the lengths of these intervals? $ \textbf{(A)}\ \frac{1003}{335} \qquad \textbf{(B)}\ \frac{1004}{335} \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ \frac{403}{134} \qquad \textbf{(E)}\ \frac{202}{67}$