$\mathbb{Q}$ is set of all rational numbers. Find all functions $f:\mathbb{Q}\times\mathbb{Q}\rightarrow\mathbb{Q}$ such that for all $x$, $y$, $z$ $\in\mathbb{Q}$ satisfy $f(x,y)+f(y,z)+f(z,x)=f(0,x+y+z)$

Find all functions $g:\mathbb{N}\rightarrow\mathbb{N}$ such that \[\left(g(m)+n\right)\left(g(n)+m\right)\] is a perfect square for all $m,n\in\mathbb{N}.$ [i]Proposed by Gabriel Carroll, USA[/i]

A sequence of positive real numbers $a_1, a_2, a_3, ... $ satisfies $a_n = a_{n-1} + a_{n-2}$ for all $n \ge 3$. A sequence $b_1, b_2, b_3, ...$ is defined by equations $b_1 = a_1$ , $b_n = a_n + (b_1 + b_3 + ...+ b_{n-1})$ for even $n > 1$ , $b_n = a_n + (b_2 + b_4 + ... +b_{n-1})$ for odd $n > 1$. Prove that if $n\ge 3$, then $\frac13 < \frac{b_n}{n \cdot a_n} < 1$

Let $ w, x, y, z$ are non-negative reals such that $ wx \plus{} xy \plus{} yz \plus{} zw \equal{} 1$. Show that $ \frac {w^3}{x \plus{} y \plus{} z} \plus{} \frac {x^3}{w \plus{} y \plus{} z} \plus{} \frac {y^3}{w \plus{} x \plus{} z} \plus{} \frac {z^3}{w \plus{} x \plus{} y}\geq \frac {1}{3}$.

[u]Round 1[/u] [b]p1.[/b] The alphabet of the Aau-Bau language consists of two letters: A and B. Two words have the same meaning if one of them can be constructed from the other by replacing any AA with A, replacing any BB with B, or by replacing any ABA with BAB. For example, the word AABA means the same thing as ABA, and AABA also means the same thing as ABAB. In this language, is it possible to name all seven days of the week? [b]p2.[/b] A museum has a $4\times 4$ grid of rooms. Every two rooms that share a wall are connected by a door. Each room contains some paintings. The total number of paintings along any path of $7$ rooms from the lower left to the upper right room is always the same. Furthermore, the total number of paintings along any path of $7$ rooms from the lower right to the upper left room is always the same. The guide states that the museum has exactly $500$ paintings. Show that the guide is mistaken. [img]https://cdn.artofproblemsolving.com/attachments/7/6/0fd93a0deaa71a5bb1599d2488f8b4eac5d0eb.jpg[/img] [b]p3.[/b] A playground has a swing-set with exactly three swings. When 3rd and 4th graders from Dr. Anna’s math class play during recess, she has a rule that if a $3^{rd}$ grader is in the middle swing there must be $4^{th}$ graders on that person’s left and right. And if there is a $4^{th}$ grader in the middle, there must be $3^{rd}$ graders on that person’s left and right. Dr. Anna calculates that there are $350$ different ways her students can arrange themselves on the three swings with no empty seats. How many students are in her class? [img]https://cdn.artofproblemsolving.com/attachments/5/9/4c402d143646582376d09ebbe54816b8799311.jpg[/img] [b]p4.[/b] The archipelago Artinagos has $19$ islands. Each island has toll bridges to at least $3$ other islands. An unsuspecting driver used a bad mapping app to plan a route from North Noether Island to South Noether Island, which involved crossing $12$ bridges. Show that there must be a route with fewer bridges. [img]https://cdn.artofproblemsolving.com/attachments/e/3/4eea2c16b201ff2ac732788fe9b78025004853.jpg[/img] [b]p5.[/b] Is it possible to place the numbers from $1$ to $121$ in an $11\times 11$ table so that numbers that differ by $1$ are in horizontally or vertically adjacent cells and all the perfect squares $(1, 4, 9, ... , 121)$ are in one column? [u]Round 2[/u] [b]p6.[/b] Hungry and Sneaky have opened a rectangular box of chocolates and are going to take turns eating them. The chocolates are arranged in a $2m \times 2n$ grid. Hungry can take any two chocolates that are side-by-side, but Sneaky can take only one at a time. If there are no more chocolates located side-by-side, all remaining chocolates go to Sneaky. Hungry goes first. Each player wants to eat as many chocolates as possible. What is the maximum number of chocolates Sneaky can get, no matter how Hungry picks his? [img]https://cdn.artofproblemsolving.com/attachments/b/4/26d7156ca6248385cb46c6e8054773592b24a3.jpg[/img] [b]p7.[/b] There is a thief hiding in the sultan’s palace. The palace contains $2019$ rooms connected by doors. One can walk from any room to any other room, possibly through other rooms, and there is only one way to do this. That is, one cannot walk in a loop in the palace. To catch the thief, a guard must be in the same room as the thief at the same time. Prove that $11$ guards can always find and catch the thief, no matter how the thief moves around during the search. [img]https://cdn.artofproblemsolving.com/attachments/a/b/9728ac271e84c4954935553c4d58b3ff4b194d.jpg[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Find two disjoint sets $N_1$ and $N_2$ with $N_1\cup N_2=\mathbb N$, so that neither set contains an infinite arithmetic progression.

Let $a_1=1$ and $a_{n+1}=a_{n}+\frac{1}{2a_n}$ for $n \geq 1$. Prove that $a)$ $n \leq a_n^2 < n + \sqrt[3]{n}$ $b)$ $\lim_{n\to\infty} (a_n-\sqrt{n})=0$

Find all pairs of cubic equations $x^3+ax^2+bx+c=0$ and $x^3+bx^2+ax+c=0$ where $a, b$ are positive integers, $c\neq 0$ is an integer, such that each equation has three integer roots and exactly one of these three roots is common to both the equations.

Let $n$ be an integer number greater than or equal to $2$, and let $K$ be a closed convex set of area greater than or equal to $n$, contained in the open square $(0, n) \times (0, n)$. Prove that $K$ contains some point of the integral lattice $\mathbb{Z} \times \mathbb{Z}$. [i]Marius Cavachi[/i]

[b]p1.[/b] Compute $45\times 45 - 6$. [b]p2.[/b] Consecutive integers have nice properties. For example, $3$, $4$, $5$ are three consecutive integers, and $8$, $9$, $10$ are three consecutive integers also. If the sum of three consecutive integers is $24$, what is the smallest of the three numbers? [b]p3.[/b] How many positive integers less than $25$ are either multiples of $2$ or multiples of $3$? [b]p4.[/b] Charlotte has $5$ positive integers. Charlotte tells you that the mean, median, and unique mode of his five numbers are all equal to $10$. What is the largest possible value of the one of Charlotte's numbers? [b]p5.[/b] Mr. Meeseeks starts with a single coin. Every day, Mr. Meeseeks goes to a magical coin converter where he can either exchange $1$ coin for $5$ coins or exchange $5$ coins for $3$ coins. What is the least number of days Mr. Meeseeks needs to end with $15$ coins? [b]p6.[/b] Twelve years ago, Violet's age was twice her sister Holo's age. In $7$ years, Holo's age will be $13$ more than a third of Violet's age. $3$ years ago, Violet and Holo's cousin Rindo's age was the sum of their ages. How old is Rindo? [b]p7.[/b] In a $2 \times 3$ rectangle composed of $6$ unit squares, let $S$ be the set of all points $P$ in the rectangle such that a unit circle centered at $P$ covers some point in exactly $3$ of the unit squares. Find the area of the region $S$. For example, the diagram below shows a valid unit circle in a $2 \times 3$ rectangle. [img]https://cdn.artofproblemsolving.com/attachments/d/9/b6e00306886249898c2bdb13f5206ced37d345.png[/img] [b]p8.[/b] What are the last four digits of $2^{1000}$? [b]p9.[/b] There is a point $X$ in the center of a $2 \times 2 \times 2$ box. Find the volume of the region of points that are closer to $X$ than to any of the vertices of the box. [b]p10.[/b] Evaluate $\sqrt{37 \cdot 41 \cdot 113 \cdot 290 - 4319^2}$ [b]p11.[/b] (Estimation) A number is abundant if the sum of all its divisors is greater than twice the number. One such number is $12$, because $1+2+3+4+6+12 = 28 > 24$: How many abundant positive integers less than $20190$ are there? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A positive integer $n\geq 4$ is called [i]interesting[/i] if there exists a complex number $z$ such that $|z|=1$ and \[1+z+z^2+z^{n-1}+z^n=0.\] Find how many interesting numbers are smaller than $2022.$

Find all $f: \mathbb R \to\mathbb R$ such that for all real numbers $x$, $f(x) \geq 0$ and for all real numbers $x$ and $y$, \[ f(x+y)+f(x-y)-2f(x)-2y^2=0. \]

Set $S_n = \sum_{p=1}^n (p^5+p^7)$. Determine the greatest common divisor of $S_n$ and $S_{3n}.$

Find the area of the set of all points $ z $ in the complex plane that satisfy $ \left| z - 3i \right| + \left| z - 4 \right| \leq 5\sqrt{2} $.

Find all integer solutions to \begin{align*} x^2+2y^2+3z^2&=36,\\ 3x^2+2y^2+z^2&=84,\\ xy+xz+yz&=-7. \end{align*}

Find the number of ordered triples $(x,y,z)$ of non-negative integers satisfying (i) $x \leq y \leq z$ (ii) $x + y + z \leq 100.$

Let $n$ and $k$ be positive integers. Evaluate the following sum $$\sum_{j=0}^k\binom kj^2\binom{n+2k-j}{2k}$$where $\binom nk=\frac{n!}{k!(n-k)!}$.

Let $\mathbb{Z}^+$ denote the set of all positive integers. Find all surjective functions $f:\mathbb{Z}^+ \times \mathbb{Z}^+ \rightarrow \mathbb{Z}^+$ that satisfy all of the following conditions: for all $a,b,c \in \mathbb{Z}^+$, (i)$f(a,b) \leq a+b$; (ii)$f(a,f(b,c))=f(f(a,b),c)$ (iii)Both $\binom{f(a,b)}{a}$ and $\binom{f(a,b)}{b}$ are odd numbers.(where $\binom{n}{k}$ denotes the binomial coefficients)

Let $f(x)$ be a polynomial with positive integer coefficients. For every $n\in\mathbb{N}$, let $a_{1}^{(n)}, a_{2}^{(n)}, \dots , a_{n}^{(n)}$ be fixed positive integers that give pairwise different residues modulo $n$ and let \[g(n) = \sum\limits_{i=1}^{n} f(a_{i}^{(n)}) = f(a_{1}^{(n)}) + f(a_{2}^{(n)}) + \dots + f(a_{n}^{(n)})\] Prove that there exists a constant $M$ such that for all integers $m>M$ we have $\gcd(m, g(m))>2023^{2023}$.

Find all $n$-tuples of real numbers $(x_1, x_2, \dots, x_n)$ such that, for every index $k$ with $1\leq k\leq n$, the following holds: \[ x_k^2=\sum\limits_{\substack{i < j \\ i, j\neq k}} x_ix_j \] [i]Proposed by Oriol Solé[/i]

(1) Let $x>0,\ y$ be real numbers. For variable $t$, find the difference of Maximum and minimum value of the quadratic function $f(t)=xt^2+yt$ in $0\leq t\leq 1$. (2) Let $S$ be the domain of the points $(x,\ y)$ in the coordinate plane forming the following condition: For $x>0$ and all real numbers $t$ with $0\leq t\leq 1$ , there exists real number $z$ for which $0\leq xt^2+yt+z\leq 1$ . Sketch the outline of $S$. (3) Let $V$ be the domain of the points $(x,\ y,\ z) $ in the coordinate space forming the following condition: For $0\leq x\leq 1$ and for all real numbers $t$ with $0\leq t\leq 1$, $0\leq xt^2+yt+z\leq 1$ holds. Find the volume of $V$. [i]2011 Tokyo University entrance exam/Science, Problem 6[/i]

Define the function $\xi : \mathbb Z^2 \to \mathbb Z$ by $\xi(n,k) = 1$ when $n \le k$ and $\xi(n,k) = -1$ when $n > k$, and construct the polynomial \[ P(x_1, \dots, x_{1000}) = \prod_{n=1}^{1000} \left( \sum_{k=1}^{1000} \xi(n,k)x_k \right). \] (a) Determine the coefficient of $x_1x_2 \dots x_{1000}$ in $P$. (b) Show that if $x_1, x_2, \dots, x_{1000} \in \left\{ -1,1 \right\}$ then $P(x_1,x_2,\dots,x_{1000}) = 0$. [i]Proposed by Evan Chen[/i]

Let $N$ be the set of natural numbers. Suppose $f: N \to N$ is a function satisfying the following conditions: (a) $f(mn) =f(m)f(n)$ (b) $f(m) < f(n)$ if $m < n$ (c) $f(2) = 2$ What is the sum of $\Sigma_{k=1}^{20}f(k)$?

Given a real number $c$ and an integer $m, m \ge 2$. Real numbers $x_1, x_2,... , x_m$ satisfy the conditions $x_1 + x_2 +...+ x_m = 0$ and $\frac{x^2_1 + x^2_2 + ...+ x^2_m}{m}= c$. Find max $(x_1, x_2,..., x_m)$ if it is known to be as small as possible.

Find all real numbers with the following property: the difference of its cube and its square is equal to the square of the difference of its square and the number itself.