Find the number of quadruples $(a,b,c,d)$ of integers which satisfy both \begin{align*}\frac{1}{a} + \frac{1}{b} + \frac{1}{c} + \frac{1}{d} &= \frac{1}{2}\qquad\text{and}\\\\2(a+b+c+d) &= ab + cd + (a+b)(c+d) + 1.\end{align*}

Let $n \geqslant 3$ be an integer, and let $x_1,x_2,\ldots,x_n$ be real numbers in the interval $[0,1]$. Let $s=x_1+x_2+\ldots+x_n$, and assume that $s \geqslant 3$. Prove that there exist integers $i$ and $j$ with $1 \leqslant i<j \leqslant n$ such that \[2^{j-i}x_ix_j>2^{s-3}.\]

Prove that if $f$ is a non-constant real-valued function such that for all real $x$, $f(x+1) + f(x-1) = \sqrt{3} f(x)$, then $f$ is periodic. What is the smallest $p$, $p > 0$ such that $f(x+p) = f(x)$ for all $x$?

Find all real values of $a$ for which the equation $x(x+1)^3=(2x+a)(x+a+1)$ has four distinct real roots.

Consider the function $f : R^+ \to R^+$ and satisfying $$f(x + 2y + f(x + y)) = f(2x) + f(3y), \,\, \forall \,\, x, y > 0.$$ 1. Find all functions $f(x)$ that satisfy the given condition. 2. Suppose that $f(4\sin^4x)f(4\cos^4x) \ge f^2(1)$ for all $x \in \left(0\frac{\pi}{2}\right) $. Find the minimum value of $f(2022)$.

$f(x)$ is a monic polynomial of degree $2$ with integer coefficients such that $f(x)$ doesn't have any real roots and also $f(0)$ is a square-free integer (and is not $1$ or $-1$). Prove that for every integer $n$ the polynomial $f(x^n)$ is irreducible over $\mathbb Z[x]$. [i]proposed by Mohammadmahdi Yazdi[/i]

The following functions are written on the board, $$F(x) = x^2 + \frac{12}{x^2}, G(x) = \sin(\pi x^2), H(x) = 1.$$ If functions $f,g$ are currently on the board, we may write on the board the functions $$f(x) + g(x), f(x) - g(x), f(x)g(x), cf(x)$$ (the last for any real number $c$). Can a function $h(x)$ appear on the board such that $$|h(x) - x| < \frac{1}{3}$$ for all $x \in [1,10]$ ?

Find the smallest real number $M$, for which $\{a\}+\{b\}+\{c\}\leq M$ for any real positive numbers $a, b, c$ with $abc = 2024$. Here $\{a\}$ denotes the fractional part of number $a$. [i]Proposed by Fedir Yudin, Anton Trygub[/i]

Does there exist a piecewise linear function $f$ defined on the segment [$-1,1]$ (including the ends) such that $f(f(x)) = -x$ for all x? (A function is called piecewise linear if its graph is the union of a finite set of points and intervals; it may be discontinuous).

Let $x$ and $y$ be positive real numbers. 1. Prove: if $x^3 - y^3 \ge 4x$, then $x^2 > 2y$. 2. Prove: if $x^5 - y^3 \ge 2x$, then $x^3 \ge 2y$.

Let $m=\frac{-1+\sqrt{17}}{2}$. Let the polynomial $P(x)=a_nx^n+a_{n-1}x^{n-1}+...+a_1x+a_0$ is given, where $n$ is a positive integer, the coefficients $a_0,a_1,a_2,...,a_n$ are positive integers and $P(m) =2018$ . Prove that the sum $a_0+a_1+a_2+...+a_n$ is divisible by $2$ .

Let $n > 3$ be an integer. Prove that there exist positive integers $x_1,..., x_n$ in geometric progression and positive integers $y_1,..., y_n$ in arithmetic progression such that $x_1<y_1<x_2<y_2<...<x_n<y_n$

We call a function $f: \mathbb{Q}^+ \to \mathbb{Q}^+$ [i]good[/i] if for all $x,y \in \mathbb{Q}^+$ we have: $$f(x)+f(y)\geq 4f(x+y).$$ a) Prove that for all good functions $f: \mathbb{Q}^+ \to \mathbb{Q}^+$ and $x,y,z \in \mathbb{Q}^+$ $$f(x)+f(y)+f(z) \geq 8f(x+y+z)$$ b) Does there exists a good functions $f: \mathbb{Q}^+ \to \mathbb{Q}^+$ and $x,y,z \in \mathbb{Q}^+$ such that $$f(x)+f(y)+f(z) < 9f(x+y+z) ?$$

Let $a,b,c$ be positive real numbers . Prove that$$ \frac{1}{ab(b+1)(c+1)}+\frac{1}{bc(c+1)(a+1)}+\frac{1}{ca(a+1)(b+1)}\geq\frac{3}{(1+abc)^2}.$$

$(POL 3)$ Given a polynomial $f(x)$ with integer coefficients whose value is divisible by $3$ for three integers $k, k + 1,$ and $k + 2$. Prove that $f(m)$ is divisible by $3$ for all integers $m.$

One considers the set $$A = \left\{ n \in N^* \big | 1 < \sqrt{1 + \sqrt{n}} < 2 \right\}$$ a) Find the set $A$. b) Find the set of numbers $n \in A$ such that $$\sqrt{n} \cdot \left| 1-\sqrt{1 + \sqrt{n}}\right| <1 ?$$

Find all triples of reals $(a, b, c)$ such that $$a - \frac{1}{b}=b - \frac{1}{c}=c - \frac{1}{a}.$$

[b]p1.[/b] Let $p > 5$ be a prime. It is known that the average of all of the prime numbers that are at least $5$ and at most $p$ is $12$. Find $p$. [b]p2.[/b] The numbers $1, 2,..., n$ are written down in random order. What is the probability that $n-1$ and $n$ are written next to each other? (Give your answer in term of $n$.) [b]p3.[/b] The Duke Blue Devils are playing a basketball game at home against the UNC Tar Heels. The Tar Heels score $N$ points and the Blue Devils score $M$ points, where $1 < M,N < 100$. The first digit of $N$ is $a$ and the second digit of $N$ is $b$. It is known that $N = a+b^2$. The first digit of $M$ is $b$ and the second digit of $M$ is $a$. By how many points do the Blue Devils win? [b]p4.[/b] Let $P(x)$ be a polynomial with integer coefficients. It is known that $P(x)$ gives a remainder of $1$ upon polynomial division by $x + 1$ and a remainder of $2$ upon polynomial division by $x + 2$. Find the remainder when $P(x)$ is divided by $(x + 1)(x + 2)$. [b]p5.[/b] Dracula starts at the point $(0,9)$ in the plane. Dracula has to pick up buckets of blood from three rivers, in the following order: the Red River, which is the line $y = 10$; the Maroon River, which is the line $y = 0$; and the Slightly Crimson River, which is the line $x = 10$. After visiting all three rivers, Dracula must then bring the buckets of blood to a castle located at $(8,5)$. What is the shortest distance that Dracula can walk to accomplish this goal? [b]p6.[/b] Thirteen hungry zombies are sitting at a circular table at a restaurant. They have five identical plates of zombie food. Each plate is either in front of a zombie or between two zombies. If a plate is in front of a zombie, that zombie and both of its neighbors can reach the plate. If a plate is between two zombies, only those two zombies may reach it. In how many ways can we arrange the plates of food around the circle so that each zombie can reach exactly one plate of food? (All zombies are distinct.) [b]p7.[/b] Let $R_I$ , $R_{II}$ ,$R_{III}$ ,$R_{IV}$ be areas of the elliptical region $$\frac{(x - 10)^2}{10}+ \frac{(y-31)^2}{31} \le 2009$$ that lie in the first, second, third, and fourth quadrants, respectively. Find $R_I -R_{II} +R_{III} -R_{IV}$ . [b]p8.[/b] Let $r_1, r_2, r_3$ be the three (not necessarily distinct) solutions to the equation $x^3+4x^2-ax+1 = 0$. If $a$ can be any real number, find the minimum possible value of $$\left(r_1 +\frac{1}{r_1} \right)^2+ \left(r_2 +\frac{1}{r_2} \right)^2+ \left(r_3 +\frac{1}{r_3} \right)^2$$ [b]p9.[/b] Let $n$ be a positive integer. There exist positive integers $1 = a_1 < a_2 <... < a_n = 2009$ such that the average of any $n - 1$ of elements of $\{a_1, a_2,..., a_n\}$ is a positive integer. Find the maximum possible value of $n$. [b]p10.[/b] Let $A(0) = (2, 7, 8)$ be an ordered triple. For each $n$, construct $A(n)$ from $A(n - 1)$ by replacing the $k$th position in $A(n - 1)$ by the average (arithmetic mean) of all entries in $A(n - 1)$, where $k \equiv n$ (mod $3$) and $1 \le k \le 3$. For example, $A(1) = \left( \frac{17}{3} , 7, 8 \right)$ and $A(2) = \left( \frac{17}{3} , \frac{62}{9}, 8\right)$. It is known that all entries converge to the same number $N$. Find the value of $N$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $S$ be the set of positive real numbers. Find all functions $f\colon S^3 \to S$ such that, for all positive real numbers $x$, $y$, $z$ and $k$, the following three conditions are satisfied: (a) $xf(x,y,z) = zf(z,y,x)$, (b) $f(x, ky, k^2z) = kf(x,y,z)$, (c) $f(1, k, k+1) = k+1$. ([i]United Kingdom[/i])

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

Does there exist a surjective function $f:R \to R$ such that the expression $f(x + y) - f(x) - f(y)$ takes exactly two values $0$ and $1$ for various real $x$ and $y$ ? (E. Barabanov)

Prove that \[\frac{a^3}{a^2+ab+b^2}+\frac{b^3}{b^2+bc+c^2}+\frac{c^3}{c^2+ca+a^2}\geq \frac{a+b+c}{3}\] for positive reals $a,b,c$ (S Tokarev)

Let $n$ be a positive integer. How many integer solutions $(i, j, k, l) , \ 1 \leq i, j, k, l \leq n$, does the following system of inequalities have: \[1 \leq -j + k + l \leq n\]\[1 \leq i - k + l \leq n\]\[1 \leq i - j + l \leq n\]\[1 \leq i + j - k \leq n \ ?\]

Find the integer numbers $a, b, c$ such that the function $f: R \to R$, $f(x) = ax^2 +bx + c$ satisfies the equalities : $$f(f(1) ))= f (f(2 ) )= f(f (3 ))$$

Let $r$ and $s$ be positive integers. Define $a_0 = 0$, $a_1 = 1$, and $a_n = ra_{n-1} + sa_{n-2}$ for $n \geq 2$. Let $f_n = a_1a_2\cdots a_n$. Prove that $\displaystyle\frac{f_n}{f_kf_{n-k}}$ is an integer for all integers $n$ and $k$ such that $0 < k < n$. [i]Evan O' Dorney.[/i]