We say that a function $f : N \to N$ is increasing if $f(n) < f(m)$ whenever $n < m$, multiplicative if $f(nm) = f(n)f(m)$ whenever $n$ and $m$ are coprime, and completely multiplicative if $f(nm) = f(n)f(m)$ for all $n,m$. (a) Prove that if $f$ is increasing then $f(n) \ge n$ for each $n$. (b) Prove that if $f$ is increasing and completely multiplicative and $f(2) = 2$, then $f(n) = n$ for all $n$. (c) Does (b) remain true if the word ”completely” is omitted?

Let $ \left(x_{n}\right)$ be a real sequence satisfying $ x_{0}=0$, $ x_{2}=\sqrt[3]{2}x_{1}$, and $ x_{n+1}=\frac{1}{\sqrt[3]{4}}x_{n}+\sqrt[3]{4}x_{n-1}+\frac{1}{2}x_{n-2}$ for every integer $ n\geq 2$, and such that $ x_{3}$ is a positive integer. Find the minimal number of integers belonging to this sequence.

David has some pennies. One apple costs $3$ pennies, one banana costs $5$ pennies, and one cranberry costs $7$ pennies. If David spends all his money on apples, he will have $2$ pennies left; if David spends all his money on bananas, he will have $3$ pennies left; is David spends all his money on cranberries, he will have $2$ pennies left. What is the least possible amount of pennies that David can originally have?

Let $f:\mathbb{R}_{+}^{*}$$\rightarrow$$\mathbb{R}_{+}^{*}$ such that $f'''(x)>0$ for all $x$ $\in$ $\mathbb{R}_{+}^{*}$. Prove that: $f(a^{2}+b^{2}+c^{2})+2f(ab+bc+ac)$ $\geq$ $f(a^{2}+2bc)+f(b^{2}+2ca)+f(c^{2}+2ab)$, for all $a,b,c$ $\in$ $\mathbb{R}_{+}^{*}$.

Find all positive integers $d$ for which there exists a degree $d$ polynomial $P$ with real coefficients such that there are at most $d$ different values among $P(0),P(1),P(2),\cdots,P(d^2-d)$ .

Find all polynomials $P(x)$ with integer coefficients such that $P(P(n) + n)$ is a prime number for infinitely many integers $n$.

Allen and Alan play a game. A nonconstant polynomial $P(x,y)$ with real coefficients and a positive integer $d$ greater than the degree of $P$ are known to both Allen and Alan. Alan thinks of a polynomial $Q(x,y)$ with real coefficients and degree at most $d$ and keeps it secret. Allen can make queries of the form $(s,t)$, where $s$ and $t$ are real numbers such that $P(s,t)\neq0$. Alan must respond with the value $Q(s,t)$. Allen's goal is to determine whether $P$ divides $Q$. Find (in terms of $P$ and $d$) the smallest positive integer, $g$, such that Allen can always achieve this goal making no more than $g$ queries. [i]Linus Tang[/i]

$(GDR 1)$ Find all real numbers $\lambda$ such that the equation $\sin^4 x - \cos^4 x = \lambda(\tan^4 x - \cot^4 x)$ $(a)$ has no solution, $(b)$ has exactly one solution, $(c)$ has exactly two solutions, $(d)$ has more than two solutions (in the interval $(0, \frac{\pi}{4}).$

(a) Let $z$ be a solution of the quadratic equation $$az^2 +bz+c=0$$ and let $n$ be a positive integer. Show that $z$ can be expressed as a rational function of $z^n , a,b,c.$ (b) Using (a) or by any other means, express $x$ as a rational function of $x^{3}$ and $x+\frac{1}{x}.$

Without using tables, find the exact value of the product: \[P = \prod^7_{k=1} \cos \left(\frac{k \pi}{15} \right).\]

If $a$ is a real root of $x^5 - x^3 + x - 2 = 0$, show that $[a^6] =3$

Let $S$ denote the set of rational numbers in the interval $(0,1)$. Determine, with proof, if there exists a subset $T$ of $S$ such that every element in $S$ can be uniquely written as the sum of finitely many distinct elements in $T$.

Prove that there is no bijective function $f : \left\{1,2,3,\ldots \right\}\rightarrow \left\{0,1,2,3,\ldots \right\}$ such that $f(mn)=f(m)+f(n)+3f(m)f(n)$.

Let $ g: \mathbb{C} \rightarrow \mathbb{C}$, $ \omega \in \mathbb{C}$, $ a \in \mathbb{C}$, $ \omega^3 \equal{} 1$, and $ \omega \ne 1$. Show that there is one and only one function $ f: \mathbb{C} \rightarrow \mathbb{C}$ such that \[ f(z) \plus{} f(\omega z \plus{} a) \equal{} g(z),z\in \mathbb{C} \]

Let $a, b, c, d$ be positive real numbers. It is given that at least one of the following two conditions holds: $$ab >\min(\frac{c}{d}, \frac{d}{c}), cd >\min(\frac{a}{b}, \frac{b}{a}).$$ Show that at least one of the following two conditions holds: $$bd>\min(\frac{c}{a}, \frac{a}{c}), ca >\min(\frac{d}{b}, \frac{b}{d}).$$

[b]p1.[/b] A shape made by joining four identical regular hexagons side-to-side is called a hexo. Two hexos are considered the same if one can be rotated / reflected to match the other. Find the number of different hexos. [b]p2.[/b] The sequence $1, 2, 3, 3, 3, 4, 5, 5, 5, 5, 5, 6,... $ consists of numbers written in increasing order, where every even number $2n$ is written once, and every odd number $2n + 1$ is written $2n + 1$ times. What is the $2019^{th}$ term of this sequence? [b]p3.[/b] On planet EMCCarth, months can only have lengths of $35$, $36$, or $42$ days, and there is at least one month of each length. Victor knows that an EMCCarth year has $n$ days, but realizes that he cannot figure out how many months there are in an EMCCarth year. What is the least possible value of $n$? [b]p4.[/b] In triangle $ABC$, $AB = 5$ and $AC = 9$. If a circle centered at $A$ passing through $B$ intersects $BC$ again at $D$ and $CD = 7$, what is $BC$? [b]p5.[/b] How many nonempty subsets $S$ of the set $\{1, 2, 3,..., 11, 12\}$ are there such that the greatest common factor of all elements in $S$ is greater than $1$? [b]p6.[/b] Jasmine rolls a fair $6$-sided die, with faces labeled from $1$ to $6$, and a fair $20$-sided die, with faces labeled from $1$ to $20$. What is the probability that the product of these two rolls, added to the sum of these two rolls, is a multiple of $3$? [b]p7.[/b] Let $\{a_n\}$ be a sequence such that $a_n$ is either $2a_{n-1}$ or $a_{n-1} - 1$. Given that $a_1 = 1$ and $a_{12} = 120$, how many possible sequences $a_1$, $a_2$, $...$, $a_{12}$ are there? [b]p8.[/b] A tetrahedron has two opposite edges of length $2$ and the remaining edges have length $10$. What is the volume of this tetrahedron? [b]p9.[/b] In the garden of EMCCden, there is a tree planted at every lattice point $-10 \le x, y \le 10$ except the origin. We say that a tree is visible to an observer if the line between the tree and the observer does not intersect any other tree (assume that all trees have negligible thickness). What fraction of all the trees in the garden of EMCCden are visible to an observer standing at the origin? [b]p10.[/b] Point $P$ lies inside regular pentagon $\zeta$, which lies entirely within regular hexagon $\eta$. A point $Q$ on the boundary of pentagon $\zeta$ is called projective if there exists a point $R$ on the boundary of hexagon $\eta$ such that $P$, $Q$, $R$ are collinear and $2019 \cdot \overline{PQ} = \overline{QR}$. Given that no two sides of $\zeta$ and $\eta$ are parallel, what is the maximum possible number of projective points on $\zeta$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given a geometric progression whose denominator $q$ is an integer not equal to $0$ or $-1$, prove that the sum of two or more terms in this progression cannot equal any other term in it.

Prove that the number of solutions in $ \left( \mathbb{N}\cup\{ 0 \} \right)\times \left( \mathbb{N}\cup\{ 0 \} \right)\times \left( \mathbb{N}\cup\{ 0 \} \right) $ of the parametric equation $$ \sqrt{x^2+y+n}+\sqrt{y^2+x+n} = z, $$ is greater than zero and finite, for nay natural number $ n. $

Find all triplets of positive integers $ (a,m,n)$ such that $ a^m \plus{} 1 \mid (a \plus{} 1)^n$.

For how many rational numbers $p$ is the area of the triangle formed by the intercepts and vertex of $f(x) = -x^2+4px-p+1$ an integer?

Let $a$ and $b$ be positive real numbers, with $a < b$ and let $n$ be a positive integer. Prove that for all real numbers $x_1, x_2, \ldots , x_n \in [a, b]$: $$ |x_1 - x_2| + |x_2 - x_3| + \cdots + |x_{n-1} - x_n| + |x_n - x_1| \leq \frac{2(b - a)}{b + a}(x_1 + x_2 + \cdots + x_n)$$ And determine for what values of $n$ and $x_1, x_2, \ldots , x_n$ the equality holds.

Consider fractions $\frac{a}{b}$ where $a$ and $b$ are positive integers. (a) Prove that for every positive integer $n$, there exists such a fraction $\frac{a}{b}$ such that $\sqrt{n} \le \frac{a}{b} \le \sqrt{n+1}$ and $b \le \sqrt{n}+1$. (b) Show that there are infinitely many positive integers $n$ such that no such fraction $\frac{a}{b}$ satisfies $\sqrt{n} \le \frac{a}{b} \le \sqrt{n+1}$ and $b \le \sqrt{n}$.

The sequence $(a_n)$ is defined by $a_0 = 0$ and $a_{n+1} = [\sqrt[3]{a_n +n}]^3$ for $n \ge 0$. (a) Find $a_n$ in terms of $n$. (b) Find all $n$ for which $a_n = n$.

What is the smallest natural number $a$ for which there are numbers $b$ and $c$ such that the quadratic trinomial $ax^2 + bx + c$ has two different positive roots not exceeding $\frac {1}{1000}$?

Let $n\in \mathbb{N}$. Prove that the polynom $p(x)=x^{2n}-2x^{2n-1}+3x^{2n-2}-...-2nx+2n+1$ doesn't have real roots.