Given an acute triangle $ABC$ and $(O)$ be its circumcircle. Let $G$ be the point on arc $BC$ that doesn't contain $O$ of the circumcircle $(I)$ of triangle $OBC$. The circumcircle of $ABG$ intersects $AC$ at $E$ and circumcircle of $ACG$ intersects $AB$ at $F$ ($E\ne A, F\ne A$). a) Let $K$ be the intersection of $BE$ and $CF$. Prove that $AK,BC,OG$ are concurrent. b) Let $D$ be a point on arc $BOC$ (arc $BC$ containing $O$) of $(I)$. $GB$ meets $CD$ at $M$ , $GC$ meets $BD$ at $N$. Assume that $MN$ intersects $(O)$ at $P$ nad $Q$. Prove that when $G$ moves on the arc $BC$ that doesn't contain $O$ of $(I)$, the circumcircle $(GPQ)$ always passes through two fixed points.

In a plane, equilateral triangle $ABC$, square $BCDE$, and regular dodecagon $DEFGHIJKLMNO$ each have side length 1 and do not overlap. Find the area of the circumcircle of $\triangle AFN$.

([b]7[/b]) Evaluate the limit $ \lim_{n\rightarrow\infty} n^{\minus{}\frac{1}{2}\left(1\plus{}\frac{1}{n}\right)} \left(1^1\cdot2^2\cdot\cdots\cdot n^n\right)^{\frac{1}{n^2}}$.

Prove that $\sin\sqrt{x}<\sqrt{\sin x}$ for every real $x$ such that $0<x<\frac{\pi}{2}$.

In the rectangular parallelepiped in the figure, the lengths of the segments $EH$, $HG$, and $EG$ are consecutive integers. The height of the parallelepiped is $12$. Find the volume of the parallelepiped. [img]https://cdn.artofproblemsolving.com/attachments/6/4/f74e7fed38c815bff5539613f76b0c4ca9171b.png[/img]

If $a, b$ are positive reals such that $a+b<2$. Prove that $$\frac{1}{1+a^2}+\frac{1}{1+b^2} \le \frac{2}{1+ab}$$ and determine all $a, b$ yielding equality. [i]Proposed by Gottfried Perz[/i]

The vertices of the cube are assigned $1, 2, 3..., 8$ and then each edge we assign the product of the numbers assigned to its two extreme points. Determine the greatest possible the value of the sum of the numbers assigned to all twelve edges of the cube.

In the coordinate space, define a square $S$, defined by the inequality $|x|\leq 1,\ |y|\leq 1$ on the $xy$-plane, with four vertices $A(-1,\ 1,\ 0),\ B(1,\ 1,\ 0),\ C(1,-1,\ 0), D(-1,-1,\ 0)$. Let $V_1$ be the solid by a rotation of the square $S$ about the line $BD$ as the axis of rotation, and let $V_2$ be the solid by a rotation of the square $S$ about the line $AC$ as the axis of rotation. (1) For a real number $t$ such that $0\leq t<1$, find the area of cross section of $V_1$ cut by the plane $x=t$. (2) Find the volume of the common part of $V_1$ and $V_2$.

Let $D$ be an interior point of the side $BC$ of a triangle $ABC$. Let $I_1$ and $I_2$ be the incentres of triangles $ABD$ and $ACD$ respectively. Let $AI_1$ and $AI_2$ meet $BC$ in $E$ and $F$ respectively. If $\angle BI_1E = 60^o$, what is the measure of $\angle CI_2F$ in degrees?

In a triangle with sides $a,b,c,t_a,t_b,t_c$ are the corresponding medians and $D$ the diameter of the circumcircle. Prove that \[\frac{a^2+b^2}{t_c}+\frac{b^2+c^2}{t_a}+\frac{c^2+a^2}{t_b}\le 6D\]

Solve in the reals the equation $ 2^{\lfloor\sqrt[3]{x}\rfloor } =x. $ [i]Nedelcu Ion[/i]

We wish to lay down boards on a floor with width $B$ in the direction across the boards. We have $n$ boards of width $b$, and $B/b$ is an integer, and $nb \le B$. There are enough boards to cover the floor, but the boards may have different lengths. Show that we can cut the boards in such a way that every board length on the floor has at most one join where two boards meet end to end. [img]https://cdn.artofproblemsolving.com/attachments/f/f/24ce8ae05d85fd522da0e18c0bb8017ca3c8e8.png[/img]

A sequence of numbers is defined recursively by $a_1 = 1$, $a_2 = \frac{3}{7}$, and $$a_n=\frac{a_{n-2} \cdot a_{n-1}}{2a_{n-2} - a_{n-1}}$$for all $n \geq 3$ Then $a_{2019}$ can be written as $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive inegers. What is $p+q ?$ $\textbf{(A) } 2020 \qquad\textbf{(B) } 4039 \qquad\textbf{(C) } 6057 \qquad\textbf{(D) } 6061 \qquad\textbf{(E) } 8078$

Let $\triangle ABC$ be such that $AB = 15, BC = 13, CA = 14.$ Let $P$ be the point on the circumcircle of $\triangle ABC$ such that $P$ is on the same side of $AB$ as $C$ and $AP = BP.$ Let $X$ be the foot of the perpendicular from $P$ to $AC.$ Then the length of $AX$ is $\tfrac{m}{n}$ for some relatively prime positive integers $m$ and $n.$ Find $m + n.$

The integers $a, b$ satisfy the following identity $$2a^2 + a = 3b^2 + b.$$ Prove that $a- b$, $2a + 2b + 1$, and $3a + 3b + 1$ are perfect squares.

Let us consider mathematical crossword which we fill with numbers $0$, $1$, $2$, $3$, $4$, $5$, $6$, $7$, $8$, $9$ such that: 1) All digits occur exactly twice 2) $10$ horizontally divides $4$ vertically 3) $4 \cdot$ ($4$ horizontally - $4$ vertically +$5$) equals $1$ vertically 4) $36$ divides $1$ horizontally and $5$ vertically 5) $9$ vertically divides $5$ vertically In how many ways we can solve this mathematical crossword? [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvOC85LzgyNjUzYmNkNTVmNDE1YTg4OWVkNzAzYzE1M2JkZWE0MThiYWY1LnBuZw==&rn=Y3Jvc3N3b3JkLnBuZw==[/img]

Let $P(x)$ be a polynomial of degree $n \le 10$ with integral coefficients such that for every $k \in \{1, 2, \dots, 10\}$ there is an integer $m$ with $P(m) = k$. Furthermore, it is given that $|P(10) - P(0)| < 1000$. Prove that for every integer $k$ there is an integer $m$ such that $P(m) = k.$

Let $a, b$ and $c$ be pairwise different natural numbers. Prove $\frac{a^3 + b^3 + c^3}{3} \ge abc + a + b + c$. When does equality holds? (Karl Czakler)

In a video game, there is a board divided into squares, with $27$ rows and $27$ columns. The squares are painted alternately in black, gray and white as follows: $\bullet$ in the first row, the first square is black, the next is gray, the next is white, the next is black, and so on; $\bullet$ in the second row, the first is white, the next is black, the next is gray, the next is white, and so on; $\bullet$ in the third row, the order would be gray-white-black-gray and so on; $\bullet$ the fourth row is painted the same as the first, the fifth the same as the second, $\bullet$ the sixth the same as the third, and so on. In the box in row $i$ and column $j$, there are $ij$ coins. For example, in the box in row $15$ and column $20$ there are $(15) (20) = 300$ coins. Verify that in total there are, in the black squares, $9^2 (13^2 + 14^2 + 15^2)$ coins.

An elephant writes a sequence of numbers on a board starting with 1. Each minute, it doubles the sum of all the numbers on the board so far, and without erasing anything, writes the result on the board. It stops after writing a number greater than one billion. How many distinct prime factors does the largest number on the board have? [i]Ray Li.[/i]

Art and Kimberly build flagpoles on a level ground with respective heights $10$ m and $15$ m, separated by a distance of $5$ m. Kimberly wants to move her flagpole closer to Art’s, but she can only doing so in the following manner: 1. Run a straight wire from the top of her flagpole to the bottom of Art’s. 2. Run a straight wire from the top of Art’s flagpole to the bottom of hers. 3. Build the flagpole to the point where the wires meet. If Kimberly keeps moving her flagpole in this way, compute the number of flagpoles she will build whose heights are $1$ m or greater (not counting her original $15$ m flagpole).

Let $f: \Bbb{R} \rightarrow \Bbb{R}$ be a function such that (i) For all $x,y \in \Bbb{R}$, \[ f(x)+f(y)+1 \geq f(x+y) \geq f(x)+f(y) \] (ii) For all $x \in [0,1)$, $f(0) \geq f(x)$, (iii) $-f(-1) = f(1) = 1$. Find all such functions $f$.

Let $p$ be a prime satisfying $p^2\mid 2^{p-1}-1$, and let $n$ be a positive integer. Define \[ f(x) = \frac{(x-1)^{p^n}-(x^{p^n}-1)}{p(x-1)}. \] Find the largest positive integer $N$ such that there exist polynomials $g(x)$, $h(x)$ with integer coefficients and an integer $r$ satisfying $f(x) = (x-r)^N g(x) + p \cdot h(x)$. [i]Proposed by Victor Wang[/i]

$\triangle{ABC}$ can cover a convex polygon $M$.Prove that there exsit a triangle which is congruent to $\triangle{ABC}$ such that it can also cover $M$ and has one side line paralel to or superpose one side line of $M$.

What is the sum of all numbers between $0$ and $511$ inclusive that have an even number of $1$s when written in binary?