For a non-constant function $f:\mathbb{R}\to \mathbb{R}$ prove that there exist real numbers $x,y$ satisfying $f(x+y)<f(xy)$

Let $m$ be a positive integer. Define the sequence $\{a_{n}\}_{n \ge 0}$ by \[a_{0}=0, \; a_{1}=m, \; a_{n+1}=m^{2}a_{n}-a_{n-1}.\] Prove that an ordered pair $(a, b)$ of non-negative integers, with $a \le b$, gives a solution to the equation \[\frac{a^{2}+b^{2}}{ab+1}= m^{2}\] if and only if $(a, b)$ is of the form $(a_{n}, a_{n+1})$ for some $n \ge 0$.

[b]1A.[/b] The iTest, by virtue of being the first national internet-based high school math competition, saves a lot of paper every year. The quantity of trees saved (“$a$”) is determined by the following formula: $a = x^2 + 3x + 9$, where $x$ is the number of participating students in the competition. If $x$ is the correct answer from short answer [hide=problem 22]x=20[/hide], then find $a$. [i](1 point)[/i] [b]1B.[/b] Let $q$ be the sum of the digits of $a$. If $q = b! - (b-1)! + (b-2)! - (b-3)!$, find $b$. [i](2 points)[/i] [b]1C.[/b] Find the number of the following statements that are false: [i] (4 points)[/i] 1. $q$ is the first prime number resulting from the sum of cubes of distinct fractions, where both the numerator and denominator are primes. 2. $q$ is composite. 3. $q$ is composite and is the sum of the first four prime numbers and $1$. 4. $q$ is the smallest prime equal to the difference of cubes of two consecutive primes. 5. $q$ is not the smallest prime equal to the product of twin primes plus their arithmetic mean. 6. The sum of $q$ consecutive Fibonacci numbers, starting from the $q^{th}$ Fibonacci number, is prime. 7. $q$ is the largest prime factor of $1bbb$. 8. $q$ is the $8^{th}$ largest prime number. 9. $a$ is composite. 10. $a + q + b = q^2$. 11. The decimal expansion of $q^q$ begins with $q$. 12. $q$ is the smallest prime equal to the sum of three distinct primes. 13. $q^5 + q^2 + q^1 + q^3 + q^5 + q^6 + q^4 + q^0 = 52135640$. 14. $q$ is not the smallest prime such that $q$ and $q^2$ have the same sum of their digits. 15. $q$ is the smallest prime such that $q$ = (the product of its digits + the sum of its digits). [hide=ANSWER KEY]1A. 469 1B. 4 1C. 6[/hide]

Every day, Pinky the flamingo eats either $1$ or $2$ shrimp, each with equal probability. Once Pinky has consumed $10$ or more shrimp in total, its skin will turn pink. Once Pinky has consumed $11$ or more shrimp in total, it will get sick. What is the probability that Pinky does not get sick on the day its skin turns pink?

Integers $a_1, a_2, \ldots, a_n$ satisfy $$1<a_1<a_2<\ldots < a_n < 2a_1.$$ If $m$ is the number of distinct prime factors of $a_1a_2\cdots a_n$, then prove that $$(a_1a_2\cdots a_n)^{m-1}\geq (n!)^m.$$

How many ways can $2^{2012}$ be expressed as the sum of four (not necessarily distinct) positive squares?

We are given a $4\times4$ square, consisting of $16$ squares with side length of $1$. Every $1\times1$ square inside the square has a non-negative integer entry such that the sum of any five squares that can be covered with the figures down below (the figures can be moved and rotated) equals $5$. What is the greatest number of different numbers that can be used to cover the square?

Show that the number \[p_n=\left(\frac{3+\sqrt5}{2}\right)^n+\left(\frac{3-\sqrt5}{2}\right)^n-2\] is a positive integer for any positive integer $n.$ Furthermore, show that the numbers $p_{2n-1}$ and $p_{2n}/5$ are perfect squares $($for any positive integer $n).$

There are n points in the plane with the property that the distance between any two points is at least 1. Prove that for sufficiently large n , the number of pairs of points whose distance is in $[ t_1 , t_1 + 1] \cup [ t_2 , t_2 + 1]$ for some $t_1, t_2$ , is at most $[\frac{n^2}{3}]$ , and the bound is sharp.

For positive integers $n$ and $k$, let $f(n,k)$ be the remainder when $n$ is divided by $k$, and for $n>1$ let $F(n) = \displaystyle\max_{1 \le k \le \frac{n}{2}} f(n,k)$. Find the remainder when $\displaystyle\sum_{n=20}^{100} F(n)$ is divided by $1000$.

Show that if $a$ and $b$ are integer numbers, and $a^2 + b^2 + 9ab$ is divisible by $11$, then $a^2-b^2$ divisible by $11$.

Determine all the triples $\{a, b, c \}$ of positive integers coprime (not necessarily pairwise prime) such that $a + b + c$ simultaneously divides the three numbers $a^{12} + b^{12}+ c^{12}$, $ a^{23} + b^{23} + c^{23} $ and $ a^{11004} + b^{11004} + c^{11004}$

Consider all the $7$-digit numbers formed by the digits $1,2 , 3,...,7$ each digit being used exactly once in all the $7! $ numbers. Prove that no two of them have the property that one divides the other.

At a party, $2019$ people decide to form teams of three. To do so, each turn, every person not on a team points to one other person at random. If three people point to each other (that is, $A$ points to $B$, $B$ points to $C$, and $C$ points to $A$), then they form a team. What is the probability that after $65, 536$ turns, exactly one person is not on a team

Let $n$ be a positive integer. $S_1, S_2, \ldots, S_n$ are pairwise non-intersecting sets, and $S_k $ has exactly $k$ elements $(k = 1, 2, \ldots, n)$. Define $S = S_1\cup S_2\cup\cdots \cup S_n$. The function $f: S \to S $ maps all elements in $S_k$ to a fixed element of $S_k$, $k = 1, 2, \ldots, n$. Find the number of functions $g: S \to S$ satisfying $f(g(f(x))) = f(x).$

Prove that there exists two different permutations $ (a_1,a_2,\dots,a_{2009})$ and $ (b_1,b_2,\dots,b_{2009})$ of $ (1,2,\dots,2009)$ such that \[ \sum_{i\equal{}1}^{2009}i^i a_i \minus{} \sum_{i\equal{}1}^{2009} i^i b_i\] is divisible by $ 2009!$.

Points $C$ and $D$ lie on opposite sides of line $\overline{AB}$. Let $M$ and $N$ be the centroids of $\triangle ABC$ and $\triangle ABD$ respectively. If $AB=841$, $BC=840$, $AC=41$, $AD=609$, and $BD=580$, find the sum of the numerator and denominator of the value of $MN$ when expressed as a fraction in lowest terms.

Find all pairs of integers $a,b$ for which there exists a polynomial $P(x) \in \mathbb{Z}[X]$ such that product $(x^2+ax+b)\cdot P(x)$ is a polynomial of a form \[ x^n+c_{n-1}x^{n-1}+\cdots+c_1x+c_0 \] where each of $c_0,c_1,\ldots,c_{n-1}$ is equal to $1$ or $-1$.

A sequence \(\{a_n\}\) is defined as follows: \(a_1 = 1\), \(a_2 = \frac{1}{3}\), and for all \(n \geq 1,\) \(\frac{(1+a_n)(1+a_{n+2})}{(1+a_n+1)^2} = \frac{a_na_{n+2}}{a_{n+1}^2}\). Prove that, for all \(n \geq 1\), \(a_1 + a_2 + ... + a_n < \frac{34}{21}\).

Let $\mathbb{R^+}$ denote the set of all positive real numbers. Find all functions $f: \mathbb{R^+}\rightarrow \mathbb{R^+}$ such that $$xf(x + y) + f(xf(y) + 1) = f(xf(x))$$ for all $x, y \in\mathbb{R^+}.$ [i]Proposed by Amadej Kristjan Kocbek, Jakob Jurij Snoj[/i]

Is the following statement true? For each positive integer $n$, we can find eight nonnegative integers $a$, $b$, $c$, $d$, $e$, $f$, $g$, $h$ such that $n=\frac{2^a-2^b}{2^c-2^d}\cdot\frac{2^e-2^f}{2^g-2^h}$.

Suppose that $a$ and $b$ are real numbers such that $\sin(a)+\sin(b)=1$ and $\cos(a)+\cos(b)=\frac{3}{2}$. If the value of $\cos(a-b)$ can be written as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$, determine $100m+n$. [i]Proposed by Michael Ren[/i]

Determine all $x\in(0,3/4)$ which satisfy \[\log_x(1-x)+\log_2\frac{1-x}{x}=\frac{1}{(\log_2x)^2}.\]

Let $ABC$ be a triangle and $w$ its incircle. $w$ touches $BC,CA$ at $A_1,B_1$ respectively. The second intersection of $AA_1$ and $w$ is $A_2$, similarly define $B_2$. Then $AB,A_1B_1,A_2B_2$ concur at a point $C_3$.

The diagram below shows a $12$ by $20$ rectangle split into four strips of equal widths all surrounding an isosceles triangle. Find the area of the shaded region. [img]https://cdn.artofproblemsolving.com/attachments/9/e/ed6be5110d923965c64887a2ca8e858c977700.png[/img]