The cosines of the angles of one triangle are respectively equal to the sines of the angles of the other triangle. Find the largest of these six angles of triangles.

If for an arbitrary permutation $(a_1,a_2,...,a_n)$ of set ${1,2,...,n}$ holds $\frac{{a_k}^2}{a_{k+1}}\leq k+2$, $k=1,2,...,n-1$, prove that $a_k=k$ for $k=1,2,...,n$

On the board written numbers from 1 to 25 . Bob can pick any three of them say $a,b,c$ and replace by $a^3+b^3+c^3$ . Prove that last number on the board can not be $2013^3$.

The expression below has six empty boxes. Each box is to be filled in with a number from $1$ to $6$, where all six numbers are used exactly once, and then the expression is evaluated. What is the maximum possible final result that can be achieved? $$\dfrac{\frac{\square}{\square}+\frac{\square}{\square}}{\frac{\square}{\square}}$$

Find the positive integer $N$ for which there exist reals $\alpha, \beta, \gamma, \theta$ which obey \begin{align*} 0.1 &= \sin \gamma \cos \theta \sin \alpha, \\ 0.2 &= \sin \gamma \sin \theta \cos \alpha, \\ 0.3 &= \cos \gamma \cos \theta \sin \beta, \\ 0.4 &= \cos \gamma \sin \theta \cos \beta, \\ 0.5 &\ge \left\lvert N-100 \cos2\theta \right\rvert. \end{align*}[i]Proposed by Evan Chen[/i]

Find two angles which add to $180^{\circ}$ which difference is $1^{'}$

$10$ children each have a lunchbox which they store in a basket before entering their classroom. However, being messy children, their lunchboxes get mixed up. When leaving the classroom each student picks up a lunchbox at random. Define a [i]cyclic triple[/i] of students $(A, B, C)$ to be three distinct students such that $A$ has $B$’s lunchbox, $B$ has $C$’s lunchbox, and $C$ has $A$’s lunchbox. Two cyclic triples are considered the same if they contain the same three students (even if in a different order). Determine the expected value of the number of cyclic triples. [i]2015 CCA Math Bonanza Individual Round #14[/i]

If $f$ is a polynomial, and $f(-2)=3$, $f(-1)=-3=f(1)$, $f(2)=6$, and $f(3)=5$, then what is the minimum possible degree of $f$?

How many of the following capital English letters look the same when rotated $180^\circ$ about their center? [center]A B C D E F G H I J K L M N O P Q R S T U V W X Y Z[/center] [i]Proposed by William Yue[/i]

If $C^p_n=\frac{n!}{p!(n-p)!} (p \ge 1)$, prove the identity \[C^p_n=C^{p-1}_{n-1} + C^{p-1}_{n-2} + \cdots + C^{p-1}_{p} + C^{p-1}_{p-1}\] and then evaluate the sum \[S = 1\cdot 2 \cdot 3 + 2 \cdot 3 \cdot 4 + \cdots + 97 \cdot 98 \cdot 99.\]

If $a_i \ (i = 1, 2, \ldots, n)$ are distinct non-zero real numbers, prove that the equation \[\frac{a_1}{a_1-x} + \frac{a_2}{a_2-x}+\cdots+\frac{a_n}{a_n-x} = n\] has at least $n - 1$ real roots.

Let $C$ denote the set of points $(x, y) \in R^2$ such that $x^2 + y^2 \le1$. A sequence $A_i = (x_i, y_i), |i \ge¸ 0$ of points in $R^2$ is ‘centric’ if it satisfies the following properties: $\bullet$ $A_0 = (x_0, y_0) = (0, 0)$, $A_1 = (x_1, y_1) = (1, 0)$. $\bullet$ For all $n\ge 0$, the circumcenter of triangle $A_nA_{n+1}A_{n+2}$ lies in $C$. Let $K$ be the maximum value of $x^2_{2012} + y^2_{2012}$ over all centric sequences. Find all points $(x, y)$ such that $x^2 + y^2 = K$ and there exists a centric sequence such that $A_{2012} = (x, y)$.

If the following instructions are carried out by a computer, which of $X$ will be printed because of instruction $5$? $1.$ Start $X$ at $3$ and $S$ at $0$ $2.$ Increase the value of $X$ by $2$. $3.$ Increase the value of $S$ by the value of $X$. $4.$ If $S$ is at least $10000$, then go to instsruction $5$; otherwise, go to instruction $2$ and proceed from there. $5.$ Print the value of $X$. $6.$ Stop. $\text{(A)} \ 19 \qquad \text{(B)} \ 21 \qquad \text{(C)} \ 23 \qquad \text{(D)} \ 199 \qquad \text{(E)} \ 201$

Let $a,b,c>0$ such that $a+b+c=1$. Prove: \[\frac{a^{2}}b+\frac{b^{2}}c+\frac{c^{2}}a \ge 3(a^{2}+b^{2}+c^{2}) \]

[b]p1.[/b] $17$ rooks are placed on an $8\times 8$ chess board. Prove that there must be at least one rook that is attacking at least $2$ other rooks. [b]p2.[/b] In New Scotland there are three kinds of coins: $1$ cent, $6$ cent, and $36$ cent coins. Josh has $99$ of the $36$-cent coins (and no other coins). He is allowed to exchange a $36$ cent coin for $6$ coins of $6$ cents, and to exchange a $6$ cent coin for $6$ coins of $1$ cent. Is it possible that after several exchanges Josh will have $500$ coins? [b]p3.[/b] Find all solutions $a, b, c, d, e, f, g, h, i$ if these letters represent distinct digits and the following multiplication is correct: $\begin{tabular}{ccccc} & & a & b & c \\ x & & & d & e \\ \hline & f & a & c & c \\ + & g & h & i & \\ \hline f & f & f & c & c \\ \end{tabular}$ [b]p4.[/b] Pinocchio rode a bicycle for $3.5$ hours. During every $1$-hour period he went exactly $5$ km. Is it true that his average speed for the trip was $5$ km/h? Explain your reasoning. [b]p5.[/b] Let $a, b, c$ be odd integers. Prove that the equation $ax^2 + bx + c = 0$ cannot have a rational solution. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are $43$ points in the space: $3$ yellow and $40$ red. Any four of them are not coplanar. May the number of triangles with red vertices hooked with the triangle with yellow vertices be equal to $2023$? Yellow triangle is hooked with the red one if the boundary of the red triangle meet the part of the plane bounded by the yellow triangle at the unique point. The triangles obtained by the transpositions of vertices are identical.

Points $A_1, A_2,\ldots, A_n$ are found on a circle in this order. Each point $A_i$ has exactly $i$ coins. A move consists in taking two coins from two points (may be the same point) and moving them to adjacent points (one move clockwise and another counter-clockwise). Find all possible values of $n$ for which it is possible after a finite number of moves to obtain a configuration with each point $A_i$ having $n+1-i$ coins.

Prove that there exists a right angle triangle with rational sides and area $d$ if and only if $x^2,y^2$ and $z^2$ are squares of rational numbers and are in Arithmetic Progression Here $d$ is an integer.

a) Show that there are five integers $A, B, C, D$, and $E$ such that $2018 = A^5 + B^5 + C^5 + D^5 + E^5$ b) Show that there are no four integers $A, B, C$ and $D$ such that $2018 = A^5 + B^5 + C^5 + D^5$

If the larger base of an isosceles trapezoid equals a diagonal and the smaller base equals the altitude, then the ratio of the smaller base to the larger base is: $ \textbf{(A)}\ \frac{1}{2} \qquad\textbf{(B)}\ \frac{2}{3} \qquad\textbf{(C)}\ \frac{3}{4} \qquad\textbf{(D)}\ \frac{3}{5} \qquad\textbf{(E)}\ \frac{2}{5}$

On the plane is given the acute triangle $ ABC $. Let $ A_1 $ and $ B_1 $ be the feet of the altitudes of $ A $ and $ B $ drawn from those vertices, respectively. Tangents at points $ A_1 $ and $ B_1 $ drawn to the circumscribed circle of the triangle $ CA_1B_1 $ intersect at $ M $. Prove that the circles circumscribed around the triangles $ AMB_1 $, $ BMA_1 $ and $ CA_1B_1 $ have a common point.

$\left(\dfrac{1}{4}\right)^{-\frac{1}{4}}=$ $\textbf{(A) }-16\qquad \textbf{(B) }-\sqrt{2}\qquad \textbf{(C) }-\dfrac{1}{16}\qquad \textbf{(D) }-\dfrac{1}{256}\qquad \textbf{(E) }\sqrt{2}$

Already the complete problem: Determine all pairs $(a,b)$ of integers different from $0$ for which it is possible to find a positive integer $x$ and an integer $y$ such that $x$ is relatively prime to $b$ and in the following list there is an infinity of integers: $\rightarrow\qquad\frac{a + xy}{b}$, $\frac{a + xy^2}{b^2}$, $\frac{a + xy^3}{b^3}$, $\ldots$, $\frac{a + xy^n}{b^n}$, $\ldots$ One idea? :arrow: [b][url=http://www.mathlinks.ro/Forum/viewtopic.php?t=61319]View all the problems from XIX Mexican Mathematical Olympiad[/url][/b]

Let $ABCDEF$ be a convex hexagon in which diagonals $AD, BE, CF$ are concurrent at $O$. Suppose $[OAF]$ is geometric mean of $[OAB]$ and $[OEF]$ and $[OBC]$ is geometric mean of $[OAB]$ and $[OCD]$. Prove that $[OED]$ is the geometric mean of $[OCD]$ and $[OEF]$. (Here $[XYZ]$ denotes are of $\triangle XYZ$)

Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.