Prove that for all positive real numbers $a, b$, and $c$ , $\sqrt[3]{abc}+\frac{1}{a}+\frac{1}{b}+\frac{1}{c} \ge 2\sqrt3$. When does the equality occur?

Prove that $\sqrt1+ \sqrt2+\sqrt3+...+ \sqrt{n^2-1}+\sqrt{n^2} \ge \frac{2n^3+n}{3}$ for any positive integer $n$.

[b]p1.[/b] Solve: $INK + INK + INK + INK + INK + INK = PEN$ ($INK$ and $PEN$ are $3$-digit numbers, and different letters stand for different digits). [b]p2. [/b]Two people play a game. They put $3$ piles of matches on the table: the first one contains $1$ match, the second one $3$ matches, and the third one $4$ matches. Then they take turns making moves. In a move, a player may take any nonzero number of matches FROM ONE PILE. The player who takes the last match from the table loses the game. a) The player who makes the first move can win the game. What is the winning first move? b) How can he win? (Describe his strategy.) [b]p3.[/b] The planet Naboo is under attack by the imperial forces. Three rebellion camps are located at the vertices of a triangle. The roads connecting the camps are along the sides of the triangle. The length of the first road is less than or equal to $20$ miles, the length of the second road is less than or equal to $30$ miles, and the length of the third road is less than or equal to $45$ miles. The Rebels have to cover the area of this triangle with a defensive field. What is the maximal area that they may need to cover? [b]p4.[/b] Money in Wonderland comes in $\$5$ and $\$7$ bills. What is the smallest amount of money you need to buy a slice of pizza that costs $\$ 1$ and get back your change in full? (The pizza man has plenty of $\$5$ and $\$7$ bills.) For example, having $\$7$ won't do, since the pizza man can only give you $\$5$ back. [b]p5.[/b] (a) Put $5$ points on the plane so that each $3$ of them are vertices of an isosceles triangle (i.e., a triangle with two equal sides), and no three points lie on the same line. (b) Do the same with $6$ points. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

One morning a baker notices that she has $188$ cups of flour and $113$ cups of sugar available. Each loaf of bread that the baker makes takes three cups of flour and a half cup of sugar. Each cake that the baker makes takes two cups of flour and two cups of sugar. The baker decides to make some loaves of bread and some cakes so that she exactly uses up all of her supplies of flour and sugar. Find the number of cakes she should make.

$\boxed{\text{N4}}$ Find all primes $p,q$ such that $2p^3-q^2=2(p+q)^2$.

Isabella has $6$ coupons that can be redeemed for free ice cream cones at Pete's Sweet Treats. In order to make the coupons last, she decides that she will redeem one every 10 days until she has used them all. She knows that Pete's is closed on Sundays, but as she circles the 6 dates on her calender, she realizes that no circled date falls on a Sunday. On what day of the week does Isabella redeem her first coupon? $\textbf{(A) }\text{Monday}\qquad\textbf{(B) }\text{Tuesday}\qquad\textbf{(C) }\text{Wednesday}\qquad\textbf{(D) }\text{Thursday}\qquad\textbf{(E) }\text{Friday}$

How many pairs of parallel edges, such as $\overline{AB}$ and $\overline{GH}$ or $\overline{EH}$ and $\overline{FG}$, does a cube have? $\textbf{(A) }6 \qquad\textbf{(B) }12 \qquad\textbf{(C) } 18 \qquad\textbf{(D) } 24 \qquad \textbf{(E) } 36$ [asy] import three; currentprojection=orthographic(1/2,-1,1/2); /* three - currentprojection, orthographic */ draw((0,0,0)--(1,0,0)--(1,1,0)--(0,1,0)--cycle); draw((0,0,0)--(0,0,1)); draw((0,1,0)--(0,1,1)); draw((1,1,0)--(1,1,1)); draw((1,0,0)--(1,0,1)); draw((0,0,1)--(1,0,1)--(1,1,1)--(0,1,1)--cycle); label("$D$",(0,0,0),S); label("$A$",(0,0,1),N); label("$H$",(0,1,0),S); label("$E$",(0,1,1),N); label("$C$",(1,0,0),S); label("$B$",(1,0,1),N); label("$G$",(1,1,0),S); label("$F$",(1,1,1),N); [/asy]

Let $ABC$ be isosceles triangle ($AB=BC$) and $K$ and $M$ be the midpoints of $AB$ and $AC,$ respectively.Let the circumcircle of $\triangle BKC$ meets the line $BM$ at $N$ other than $B.$ Let the line passing through $N$ and parallel to $AC$ intersects the circumcircle of $\triangle ABC$ at $A_1$ and $C_1.$ Prove that $\triangle A_1BC_1$ is equilateral.

A $n \times n$ table is filled with the numbers as follows: the first column is filled with $1$’s, the second column with $2$’s, and so on. Then, the numbers on the main diagonal (from top-left to bottom-right) are erased. Prove that the total sums of the numbers on both sides of the main diagonal differ in exactly two times. [i](3 points)[/i]

Consider the complex numbers $x,y,z$ such that $|x|=|y|=|z|=1$. Define the number $$a=\left (1+\frac xy\right )\left (1+\frac yz\right )\left (1+\frac zx\right ).$$ $\textbf{(a)}$ Prove that $a$ is a real number. $\textbf{(b)}$ Find the minimal and maximal value $a$ can achieve, when $x,y,z$ vary subject to $|x|=|y|=|z|=1$. [i] (Stefan Bălăucă & Vlad Robu)[/i]

It is known that $m$ and $n$ are positive integers, $m > n^{n-1}$, and all the numbers $m+1$, $m+2$, \dots, $m+n$ are composite. Prove that there exist such different primes $p_1$, $p_2$, \dots, $p_n$ that $p_k$ divides $m+k$ for $k = 1$, 2, \dots, $n$. [i]Proposed by C. A. Grimm [/i]

There are $100$ points on the circumference of a circle, arbitrarily labelled by $1,2,\ldots,100$. For each three points, call their triangle [b]clockwise[/b] if the increasing order of them is in clockwise order. Prove that it is impossible to have exactly $2017$ [b]clockwise[/b] triangles.

Identical spherical tennis balls of radius 1 are placed inside a cylindrical container of radius 2 and height 19. Compute the maximum number of tennis balls that can fit entirely inside this container.

[b]p1.[/b] How many ways can we arrange the elements $\{1, 2, ..., n\}$ to a sequence $a_1, a_2, ..., a_n$ such that there is only exactly one $a_i$, $a_{i+1}$ such that $a_i > a_{i+1}$? [b]p2. [/b]How many distinct (non-congruent) triangles are there with integer side-lengths and perimeter $2012$? [b]p3.[/b] Let $\phi$ be the Euler totient function, and let $S = \{x| \frac{x}{\phi (x)} = 3\}$. What is $\sum_{x\in S} \frac{1}{x}$? [b]p4.[/b] Denote $f(N)$ as the largest odd divisor of $N$. Compute $f(1) + f(2) + f(3) +... + f(29) + f(30)$. [b]p5.[/b] Triangle $ABC$ has base $AC$ equal to $218$ and altitude $100$. Squares $s_1, s_2, s_3, ...$ are drawn such that $s_1$ has a side on $AC$ and has one point each touching $AB$ and $BC$, and square $s_k$ has a side on square $s_{k-}1$ and also touches $AB$ and $BC$ exactly once each. What is the sum of the area of these squares? [b]p6.[/b] Let $P$ be a parabola $6x^2 - 28x + 10$, and $F$ be the focus. A line $\ell$ passes through $F$ and intersects the parabola twice at points $P_1 = (2,-22)$, $P_2$. Tangents to the parabola with points at $P_1, P_2$ are then drawn, and intersect at a point $Q$. What is $m\angle P_1QP_2$? PS. You had better use hide for answers.

Show that any odd number can be written as the difference between two perfect squares.

Let's call a checkered polygon a [i]strip[/i], which can be traversed entirely, starting from some of its cells and then moving only in two directions - up or to the right. Several such strips can be inserted into each other by shifting by a vector $(-1.1)$. Prove that for any strip consisting of an even number of cells, there is such an odd $k$ that if you combine $k$ of the same strips by inserting them sequentially into each other, then the resulting polygon can be divided along the grid lines into two equal parts. [i]Proposed by I. Markelov, S. Markelov[/i]

Let $A$ be a finite set of non-negative integers. Determine all functions $f:\mathbb{Z}_{\ge 0} \to A$ such that \[f(|x-y|)=|f(x)-f(y)|\] for each $x,y\in\mathbb Z_{\ge 0}$. [i]Andrei Bâra[/i]

Let $ABC$ be at triangle with incircle $\Gamma$. Let $\Gamma_1$, $\Gamma_2$, $\Gamma_3$ be three circles inside $\triangle ABC$ each of which is tangent to $\Gamma$ and two sides of the triangle and their radii are $1,4,9$. Find the radius of $\Gamma$.

Let $AB$ be a diameter of a circle; let $t_1$ and $t_2$ be the tangents at $A$ and $B$, respectively; let $C$ be any point other than $A$ on $t_1$; and let $D_1D_2. E_1E_2$ be arcs on the circle determined by two lines through $C$. Prove that the lines $AD_1$ and $AD_2$ determine a segment on $t_2$ equal in length to that of the segment on $t_2$ determined by $AE_1$ and $AE_2.$

Let $(G, *)$ a group of $n > 1$ elements, and let $g \in G$ be an element distinct from the identity. Ana and Bob play with the group $G$ on the following way: Starting with Ana and playing alternately, each player selects an element of $G$ that has not been selected before, until each element of $G$ have been selected or a player have selected the elements $a$ and $a * g$ for some $a \in G$. In that case it is said that the player loses and his opponent wins. $a)$ If $n$ is odd, show that, independent of element $g$, one of the two players has a winning strategy and determines which player possesses such a strategy. $b)$ If $n$ is even, show that there exists an element $g \in G$ for which none of the players has a winning strategy. Note: A group $(G, *)$ es a set $G$ together with a binary operation $* : G\times G \to G$ that satisfy the following properties $(i)$ $*$ is asociative: $\forall a, b, c \in G (a * b) * c = a * (b * c)$; $(ii)$ there exists an identity element $e \in G$ such that $\forall a \in G, a *e = e * a = a;$ $(iii)$ there exists inverse elements: $\forall a \in G \exists a^{-1} \in G$ such that $a*a^{-1} = a^{-1} *a = e.$

Let $x,y,z$ be positive numbers such that $x^2+y^2+z^2=1$. Prove that $$\frac x{1-x^2}+\frac y{1-y^2}+\frac z{1-z^2}\ge\frac{3\sqrt3}2$$

Find the complex numbers $ z_1,z_2,z_3 $ of same absolute value having the property that: $$ 1=z_1z_2z_3=z_1+z_2+z_3. $$

Oriol has a finite collection of cards, each one with a positive integer written on it. We say the collection is $n$-[i]complete[/i] if for any integer $k$ from $1$ to $n$ (inclusive), he can choose some cards such that the sum of the numbers on them is exactly $k$. Suppose that Oriol's collection is $n$-complete, but it stops being $n$-complete if any card is removed from it. What is the maximum possible sum of the numbers on all the cards? [i]Proposed by Ariel García[/i]

It is given set with $n^2$ elements $(n \geq 2)$ and family $\mathbb{F}$ of subsets of set $A$, such that every one of them has $n$ elements. Assume that every two sets from $\mathbb{F}$ have at most one common element. Prove that $i)$ Family $\mathbb{F}$ has at most $n^2+n$ elements $ii)$ Upper bound can be reached for $n=3$

A triangle $ABC$ is considered, and let $D$ be the intersection point of the angle bisector corresponding to angle $A$ with side $BC$. Prove that the circumcircle that passes through $A$ and is tangent to line $BC$ at $D$, it is also tangent to the circle circumscribed around triangle $ABC$.