Find the volume of the part bounded by $z=x+y,\ z=x^2+y^2$ in the $xyz$ space.

Suppose that $f: \mathbb{R}\rightarrow\mathbb{R}$ fulfils $\left|\sum^n_{k=1}3^k\left(f(x+ky)-f(x-ky)\right)\right|\le1$ for all $n\in\mathbb{N},x,y\in\mathbb{R}$. Prove that $f$ is a constant function.

A rectangular board of 8 columns has squared numbered beginning in the upper left corner and moving left to right so row one is numbered 1 through 8, row two is 9 through 16, and so on. A student shades square 1, then skips one square and shades square 3, skips two squares and shades square 6, skips 3 squares and shades square 10, and continues in this way until there is at least one shaded square in each column. What is the number of the shaded square that first achieves this result? [asy] unitsize(20); for(int a = 0; a < 10; ++a) { draw((0,a)--(8,a)); } for (int b = 0; b < 9; ++b) { draw((b,0)--(b,9)); } draw((0,0)--(0,-.5)); draw((1,0)--(1,-1.5)); draw((.5,-1)--(1.5,-1)); draw((2,0)--(2,-.5)); draw((4,0)--(4,-.5)); draw((5,0)--(5,-1.5)); draw((4.5,-1)--(5.5,-1)); draw((6,0)--(6,-.5)); draw((8,0)--(8,-.5)); fill((0,8)--(1,8)--(1,9)--(0,9)--cycle,black); fill((2,8)--(3,8)--(3,9)--(2,9)--cycle,black); fill((5,8)--(6,8)--(6,9)--(5,9)--cycle,black); fill((1,7)--(2,7)--(2,8)--(1,8)--cycle,black); fill((6,7)--(7,7)--(7,8)--(6,8)--cycle,black); label("$2$",(1.5,8.2),N); label("$4$",(3.5,8.2),N); label("$5$",(4.5,8.2),N); label("$7$",(6.5,8.2),N); label("$8$",(7.5,8.2),N); label("$9$",(0.5,7.2),N); label("$11$",(2.5,7.2),N); label("$12$",(3.5,7.2),N); label("$13$",(4.5,7.2),N); label("$14$",(5.5,7.2),N); label("$16$",(7.5,7.2),N); [/asy] $\text{(A)}\ 36 \qquad \text{(B)}\ 64 \qquad \text{(C)}\ 78 \qquad \text{(D)}\ 91 \qquad \text{(E)}\ 120$

Find all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ such that $$f(2f(x)) = f(x - f(y)) + f(x) + y$$ for all $x, y \in \mathbb{R}$.

Consider a function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that admits primitives. Prove that: $ \text{(i)} $ Every term (function) of the sequence functions $ \left( h_n\right)_{n\ge 2}:\mathbb{R}\longrightarrow\mathbb{R} $ defined, for any natural number $ n $ as $ h_n(x)=x^nf\left( x^3 \right) , $ is primitivable. $ \text{(ii)} $ The function $ \phi :\mathbb{R}\longrightarrow\mathbb{R} $ defined as $$ \phi (x) =\left\{ \begin{matrix} e^{-1/x^2} f(x),& \quad x\neq 0 \\ 0,& \quad x=0 \end{matrix} \right. $$ is primitivable. [i]Cristinel Mortici[/i]

Suppose that the function $ g : (0,1) \rightarrow \mathbb{R}$ can be uniformly approximated by polynomials with nonnegative coefficients. Prove that $ g$ must be analytic. Is the statement also true for the interval $ (\minus{}1,0)$ instead of $ (0,1)$? [i]J. Kalina, L. Lempert[/i]

Determine all functions $f: \mathbb{R} \mapsto \mathbb{R}$ satisfying \[f\left(\sqrt{2} \cdot x\right) + f\left(4 + 3 \cdot \sqrt{2} \cdot x \right) = 2 \cdot f\left(\left(2 + \sqrt{2}\right) \cdot x\right)\] for all $x$.

Let $f(x)$ be a periodic function of period $T > 0$ defined over $\mathbb R$. Its first derivative is continuous on $\mathbb R$. Prove that there exist $x, y \in [0, T )$ such that $x \neq y$ and \[f(x)f'(y)=f'(x)f(y).\]

Let $\mathbb{Z}_{\ge 0}$ be the set of all nonnegative integers. Find all the functions $f: \mathbb{Z}_{\ge 0} \rightarrow \mathbb{Z}_{\ge 0} $ satisfying the relation \[ f(f(f(n))) = f(n+1 ) +1 \] for all $ n\in \mathbb{Z}_{\ge 0}$.

Let $a\# b$ be defined as $ab-a-3$. For example, $4\#5=20-4-3=13$ Compute $(2\#0)\#(1\#4)$.

Let $ S\subseteq\mathbb{R}$ be a set of real numbers. We say that a pair $ (f, g)$ of functions from $ S$ into $ S$ is a [i]Spanish Couple[/i] on $ S$, if they satisfy the following conditions: (i) Both functions are strictly increasing, i.e. $ f(x) < f(y)$ and $ g(x) < g(y)$ for all $ x$, $ y\in S$ with $ x < y$; (ii) The inequality $ f\left(g\left(g\left(x\right)\right)\right) < g\left(f\left(x\right)\right)$ holds for all $ x\in S$. Decide whether there exists a Spanish Couple [list][*] on the set $ S \equal{} \mathbb{N}$ of positive integers; [*] on the set $ S \equal{} \{a \minus{} \frac {1}{b}: a, b\in\mathbb{N}\}$[/list] [i]Proposed by Hans Zantema, Netherlands[/i]

For how many positive integers $x$ is $\log_{10}{(x-40)} + \log_{10}{(60-x)} < 2$? ${ \textbf{(A)}\ 10\qquad\textbf{(B)}\ 18\qquad\textbf{(C)}\ 19\qquad\textbf{(D)}}\ 20\qquad\textbf{(E)}\ \text{infinitely many} $

Let $M$ be an interior point of tetrahedron $V ABC$. Denote by $A_1,B_1, C_1$ the points of intersection of lines $MA,MB,MC$ with the planes $VBC,V CA,V AB$, and by $A_2,B_2, C_2$ the points of intersection of lines $V A_1, VB_1, V C_1$ with the sides $BC,CA,AB$. [b](a)[/b] Prove that the volume of the tetrahedron $V A_2B_2C_2$ does not exceed one-fourth of the volume of $V ABC$. [b](b)[/b] Calculate the volume of the tetrahedron $V_1A_1B_1C_1$ as a function of the volume of $V ABC$, where $V_1$ is the point of intersection of the line $VM$ with the plane $ABC$, and $M$ is the barycenter of $V ABC$.

Let $f:[0,1]\to\mathbb R$ be a continuous function such that $\int^1_0x^mf(x)dx=0$ for $m=0,1,\ldots,1999$. Prove that $f$ has at least $2000$ zeroes on the segment $[0,1]$.

Let $n $ be a positive integer. Let $f $ be a function from nonnegative integers to themselves. Let $f (0,i)=f (i,0)=0$, $f (1, 1)=n $, and $ f(i, j)= [\frac {f(i-1,j)}{2}]+ [\frac {f(i, j-1)}{2}] $ for positive integers $i, j$ such that $i*j>1$. Find the number of pairs $(i,j) $ such that $f (i, j) $ is an odd number.( $[x]$ is the floor function).

Determine all $ f:R\rightarrow R $ such that $$ f(xf(y)+y^3)=yf(x)+f(y)^3 $$

Consider a function $f$ on nonnegative integers such that $f(0)=1, f(1)=0$ and $f(n)+f(n-1)=nf(n-1)+(n-1)f(n-2)$ for $n \ge 2$. Show that \[\frac{f(n)}{n!}=\sum_{k=0}^n \frac{(-1)^k}{k!}\]

a) There is an infinite sequence of $0,1$, like $\dots,a_{-1},a_{0},a_{1},\dots$ (i.e. an element of $\{0,1\}^{\mathbb Z}$). At each step we make a new sequence. There is a function $f$ such that for each $i$, $\mbox{new }a_{i}=f(a_{i-100},a_{i-99},\dots,a_{i+100})$. This operation is mapping $F: \{0,1\}^{\mathbb Z}\longrightarrow\{0,1\}^{\mathbb Z}$. Prove that if $F$ is 1-1, then it is surjective. b) Is the statement correct if we have an $f_{i}$ for each $i$?

Let $P(x) \in \mathbb{R}[x]$ be a monic, non-constant polynomial. Determine all continuous functions $f: \mathbb{R} \to \mathbb{R}$ such that $$f(f(P(x))+y+2023f(y))=P(x)+2024f(y),$$ for all reals $x,y$.

Find all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ such that $f(x^3)-f(y^3)=(x^2+xy+y^2)(f(x)-f(y))$.

Let $f:\mathbb R\to\mathbb R$ satisfy \[|f(x+y)-f(x-y)-y|\leq y^2\] For all $(x,y)\in\mathbb R^2.$ Show that $f(x)=\frac x2+c$ where $c$ is a constant.

Find all functions $ f:\mathbb{Q}\longrightarrow\mathbb{R} $ satisfying the equation $$ f(x+y)+f(x-y)=f(x)+f(y) +f(f(x+y)) , $$ for any rational numbers $ x,y. $ [i]Mihai Onucu Drîmbe[/i]

$ABCD$ is a quadrilateral with $AD=BC$. If $\angle ADC$ is greater than $\angle BCD$, prove that $AC>BD$.

For every integer $n>2$, prove the equality $$\left\lfloor\frac{n(n+1)}{4n-2}\right\rfloor=\left\lfloor\frac{n+1}4\right\rfloor.$$

Prove that in an abelian ring $ A $ in which $ 1\neq 0, $ every element is idempotent if and only if the number of polynomial functions from $ A $ to $ A $ is equal to the square of the cardinal of $ A. $