Let $ a$, $ b$ and $ c$ be the lengths of the sides of a triangle. Prove that \[ a^{2}b(a \minus{} b) \plus{} b^{2}c(b \minus{} c) \plus{} c^{2}a(c \minus{} a)\ge 0. \] Determine when equality occurs.

Let $a,b,c$ are non-negative numbers such that $$2(a^2+b^2+c^2)+3(ab+bc+ca)=5(a+b+c)$$ then prove that $4(a^2+b^2+c^2)+2(ab+bc+ca)+7abc\le 25$

Given a strictly increasing infinite sequence $\{a_n\}$ of positive real numbers such that for any $n\in N$: $$a_{n+2}=(a_{n+1}-a_{n})^{\sqrt{n}}+n^{-\sqrt{n}}$$ Prove that for any $C>0$ there exist a positive integer $m(C)$ (depended on $C$) such that $a_{m(C)}>C$.

Is there an infinite sequence $ a_0, a_1, a_2, \cdots $ of nonzero real numbers such that for $ n = 1, 2, 3, \cdots $ the polynomial \[ p_n(x) = a_0 + a_1 x + a_2 x^2 + \cdots + a_n x^n \] has exactly $n$ distinct real roots?

Prove that for every integer $S\ge100$ there exists an integer $P$ for which the following story could hold true: The mathematician asks the shop owner: ``How much are the table, the cabinet and the bookshelf?'' The shop owner replies: ``Each item costs a positive integer amount of Euros. The table is more expensive than the cabinet, and the cabinet is more expensive than the bookshelf. The sum of the three prices is $S$ and their product is $P$.'' The mathematician thinks and complains: ``This is not enough information to determine the three prices!'' (Proposed by Gerhard Woeginger, Austria)

A shipping company charges $.30l+.40w+.50h$ dollars to process a right rectangular prism-shaped box with dimensions $l,w,h$ in inches. The customers themselves are allowed to label the three dimensions of their box with $l,w,h$ for the purpose of calculating the processing fee. A customer finds that there are two different ways to label the dimensions of their box $B$ to get a fee of $\$8.10$, and two different ways to label $B$ to get a fee of $\$8.70$. None of the faces of $B$ are squares. Find the surface area of $B$, in square inches. [i]Proposed by Justin Hsieh[/i]

Find all $n$ such that there is a real polynomial $f(x)$ of degree $n$ such that $f(x) \ge f'(x)$ for all real $x$.

On the puzzle page of a newspaper this problem is proposed: “Two children, Antonio and José, have $160$ comics. Antonio counts his by $7$ by $7$ and there are $4$ left over. José counts his $ 8$ by $8$ and he also has $4$ left over. How many comics does he have each?" In the next issue of the newspaper this solution is given: “Antonio has $60$ comics and José has $100$.” Analyze this solution and indicate what a mathematician would do with this problem.

For distinct real numbers $a_1,a_2,...,a_n$, we calculate the $\frac{n(n-1)}{2}$ sums $a_i +a_j$ with $1 \le i < j \le n$, and sort them in ascending order. Find all integers $n \ge 3$ for which there exist $a_1,a_2,...,a_n$, for which this sequence of $\frac{n(n-1)}{2}$ sums form an arithmetic progression (i.e. the dierence between consecutive terms is constant).

Let the nonnegative numbers $a_1, a_2,... a_9$, where $a_1 = a_9 = 0$ and let at least one of the numbers is nonzero. Denote the sentence $(P)$: '' For $2 \le i \le 8$ there is a number $a_i$, such that $a_{i - 1} + a_{i + 1} <ka_i $”. a) Show that the sentence $(P)$ is true for $k = 2$. b) Determine whether is the sentence $(P)$ true for $k = \frac{19}{10}$

Let $N_0$ be the set of all non-negative integers and let $f : N_0 \times N_0 \to [0, +\infty)$ be a function such that $f(a, b) = f(b, a)$ and $$f(a, b) = f(a + 1, b) + f(a, b + 1),$$ for all $a, b \in N_0$. Denote by $x_n = f(n, 0)$ for all $n \in N_0$. Prove that for all $n \in N_0$ the following inequality takes place $$2^n x_n \ge x_0.$$

A little boy takes a $ 12$ in long strip of paper and makes a Mobius strip out of it by tapping the ends together after adding a half twist. He then takes a $ 1$ inch long train model and runs it along the center of the strip at a speed of $ 12$ inches per minute. How long does it take the train model to make two full complete loops around the Mobius strip? A complete loop is one that results in the train returning to its starting point.

Find all functions $f : [0,\infty) \to [0,\infty)$ such that $f(f(x)) +f(x) = 12x$, for all $x \ge 0$.

The graph of the function $f(x)=x^n+a_{n-1}x_{n-1}+\ldots +a_1x+a_0$ (where $n>1$) intersects the line $y=b$ at the points $B_1,B_2,\ldots ,B_n$ (from left to right), and the line $y=c\ (c\not= b)$ at the points $C_1,C_2,\ldots ,C_n$ (from left to right). Let $P$ be a point on the line $y=c$, to the right to the point $C_n$. Find the sum \[\cot (\angle B_1C_1P)+\ldots +\cot (\angle B_nC_nP) \]

Compute $$\sum^{\infty}_{i=0} \sum^{\infty}_{j=0}{i + j \choose i} 3^{-(i+j)}.$$

Which positive integers $n$ make the equation \[\sum_{i=1}^n \sum_{j=1}^n \left\lfloor \frac{ij}{n+1} \right\rfloor=\frac{n^2(n-1)}{4}\] true?

Find all functions $f : R \to R$ such that $$f(x + y) \ge xf(x) + yf(y)$$, for all $x, y \in R$ .

Find all functions $ f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying \[ f(x^3\plus{}y^3)\equal{}xf(x^2)\plus{}yf(y^2)\] for all real numbers $ x$ and $ y$. [i]Hery Susanto, Malang[/i]

Given a function $ f:\mathbb{N}\longrightarrow\mathbb{N} , $ find the necessary and sufficient condition that makes the sequence $$ \left(\left( 1+\frac{(-1)^{f(n)}}{n+1} \right)^{(-1)^{-f(n+1)}\cdot(n+2)}\right)_{n\ge 1} $$ to be monotone.

Let $ f(x) \equal{} \prod^n_{k\equal{}1} (x \minus{} a_k) \minus{} 2,$ where $ n \geq 3$ and $ a_1, a_2, \ldots,$ an are distinct integers. Suppose that $ f(x) \equal{} g(x)h(x),$ where $ g(x), h(x)$ are both nonconstant polynomials with integer coefficients. Prove that $ n \equal{} 3.$

[b]p1.[/b] What is the maximum possible value of $m$ such that there exist $m$ integers $a_1, a_2, ..., a_m$ where all the decimal representations of $a_1!, a_2!, ..., a_m!$ end with the same amount of zeros? [b]p2.[/b] Let $f : R \to R$ be a function such that $f(x) + f(y^2) = f(x^2 + y)$, for all $x, y \in R$. Find the sum of all possible $f(-2017)$. [b]p3. [/b] What is the sum of prime factors of $1000027$? [b]p4.[/b] Let $$\frac{1}{2!} +\frac{2}{3!} + ... +\frac{2016}{2017!} =\frac{n}{m},$$ where $n, m$ are relatively prime. Find $(m - n)$. [b]p5.[/b] Determine the number of ordered pairs of real numbers $(x, y)$ such that $\sqrt[3]{3 - x^3 - y^3} =\sqrt{2 - x^2 - y^2}$ [b]p6.[/b] Triangle $\vartriangle ABC$ has $\angle B = 120^o$, $AB = 1$. Find the largest real number $x$ such that $CA - CB > x$ for all possible triangles $\vartriangle ABC$. [b]p7. [/b]Jung and Remy are playing a game with an unfair coin. The coin has a probability of $p$ where its outcome is heads. Each round, Jung and Remy take turns to flip the coin, starting with Jung in round $ 1$. Whoever gets heads first wins the game. Given that Jung has the probability of $8/15$ , what is the value of $p$? [b]p8.[/b] Consider a circle with $7$ equally spaced points marked on it. Each point is $ 1$ unit distance away from its neighbors and labelled $0,1,2,...,6$ in that order counterclockwise. Feng is to jump around the circle, starting at the point $0$ and making six jumps counterclockwise with distinct lengths $a_1, a_2, ..., a_6$ in a way such that he will land on all other six nonzero points afterwards. Let $s$ denote the maximum value of $a_i$. What is the minimum possible value of $s$? [b]p9. [/b]Justin has a $4 \times 4 \times 4$ colorless cube that is made of $64$ unit-cubes. He then colors $m$ unit-cubes such that none of them belong to the same column or row of the original cube. What is the largest possible value of $m$? [b]p10.[/b] Yikai wants to know Liang’s secret code which is a $6$-digit integer $x$. Furthermore, let $d(n)$ denote the digital sum of a positive integer $n$. For instance, $d(14) = 5$ and $d(3) = 3$. It is given that $$x + d(x) + d(d(x)) + d(d(d(x))) = 999868.$$ Please find $x$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose that $g$ and $h$ are polynomials of degree $10$ with integer coefficients such that $g(2) < h(2)$ and \[ g(x) h(x) = \sum_{k=0}^{10} \left( \binom{k+11}{k} x^{20-k} - \binom{21-k}{11} x^{k-1} + \binom{21}{11}x^{k-1} \right) \] holds for all nonzero real numbers $x$. Find $g(2)$. [i]Proposed by Yang Liu[/i]

If $xy = 15$ and $x + y = 11$, calculate the value of $x^3 + y^3$.

Find all $(m,n)$ in $\mathbb{N}^2$ such that $m\mid n^2+1$ and $n\mid m^2+1$.

There are $n \ge 3$ distinct positive real numbers. Show that there are at most $n-2$ different integer power of three that can be written as the sum of three distinct elements from these $n$ numbers.