Found problems: 4776
Let $f: \mathbb{Z}^2\to \mathbb{R}$ be a function.
It is known that for any integer $C$ the four functions of $x$
\[f(x,C), f(C,x), f(x,x+C), f(x, C-x)\]
are polynomials of degree at most $100$. Prove that $f$ is equal to a polynomial in two variables and find its maximal possible degree.
[i]Remark: The degree of a bivariate polynomial $P(x,y)$ is defined as the maximal value of $i+j$ over all monomials $x^iy^j$ appearing in $P$ with a non-zero coefficient.[/i]
At a chess tournament the winner gets 1 point and the defeated one 0 points. A tie makes both obtaining $\frac{1}{2}$ points. 14 players, none of them equally aged, participated in a competition where everybody played against all the other players. After the competition a ranking was carried out. Of the two players with the same number of points the younger received the better ranking. After the competition Jan realizes that the best three players together got as many points as the last 9 players obtained points together. And Joerg noted that the number of ties was maximal. Determine the number of ties.
Find all functions $f:\mathbb{R}\backslash\{0\}\rightarrow\mathbb{R}$ for which $xf(xy) + f(-y) = xf(x)$ for all non-zero real numbers $x, y$.
Let $ f$ be a linear function for which $ f(6)\minus{}f(2)\equal{}12$. What is $ f(12)\minus{}f(2)$?
$ \textbf{(A)}\ 12 \qquad
\textbf{(B)}\ 18 \qquad
\textbf{(C)}\ 24 \qquad
\textbf{(D)}\ 30 \qquad
\textbf{(E)}\ 36$
Let $a,b,c,d$ be positive real numbers such that $a+b+c+d=1$. Prove that\[ 6(a^3+b^3+c^3+d^3)\ge(a^2+b^2+c^2+d^2)+\frac{1}{8} \]
A number $p$ is $perfect$ if the sum of its divisors, except $p$ is $p$. Let $f$ be a function such that:
$f(n)=0$, if n is perfect
$f(n)=0$, if the last digit of n is 4
$f(a.b)=f(a)+f(b)$
Find $f(1998)$
Five distinct points $A, B, C, D$ and $E$ lie in this order on a circle of radius $r$ and satisfy $AC = BD = CE = r$. Prove that the orthocentres of the triangles $ACD, BCD$ and $BCE$ are the vertices of a right-angled triangle.
On the number line, consider the point $x$ that corresponds to the value $10$. Consider $24$ distinct integer points $y_1$, $y_2$, $\ldots$, $y_{24}$ on the number line such that for all $k$ such that $1\leq k\leq 12$, we have that $y_{2k-1}$ is the reflection of $y_{2k}$ across $x$. Find the minimum possible value of \[\textstyle\sum_{n=1}^{24}(|y_n-1|+|y_n+1|).\]
Define $L(x) = x - \frac{x^2}{2}$ for every real number $x$. If $n$ is a positive integer, define $a_n$ by
\[
a_n = L \Bigl( L \Bigl( L \Bigl( \cdots L \Bigl( \frac{17}{n} \Bigr) \cdots \Bigr) \Bigr) \Bigr),
\]
where there are $n$ iterations of $L$. For example,
\[
a_4 = L \Bigl( L \Bigl( L \Bigl( L \Bigl( \frac{17}{4} \Bigr) \Bigr) \Bigr) \Bigr).
\]
As $n$ approaches infinity, what value does $n a_n$ approach?
Find the continuous function such that $ f(x)\equal{}\frac{e^{2x}}{2(e\minus{}1)}\int_0^1 e^{\minus{}y}f(y)dy\plus{}\int_0^{\frac 12} f(y)dy\plus{}\int_0^{\frac 12}\sin ^ 2(\pi y)dy$.
Prove that\[(1+\frac{1}{3})(1+\frac{1}{3^2})\cdots(1+\frac{1}{3^n})< 2.\]
Let $f:\mathbb{R} \to \mathbb{R}$ be a function that is a function that is differentiable $n+1$ times for some positive integer $n$ . The $i^{th}$ derivative of $f$ is denoted by $f^{(i)}$ . Suppose-
$f(1)=f(0)=f^{(1)}(0)=...=f^{(n)}(0)=0$.
Prove that $f^{(n+1)}(x)=0$ for some $x \in (0,1)$
Let $Q$ be a set of prime numbers, not necessarily finite. For a positive integer $n$ consider its prime factorization: define $p(n)$ to be the sum of all the exponents and $q(n)$ to be the sum of the exponents corresponding only to primes in $Q$. A positive integer $n$ is called [i]special[/i] if $p(n)+p(n+1)$ and $q(n)+q(n+1)$ are both even integers. Prove that there is a constant $c>0$ independent of the set $Q$ such that for any positive integer $N>100$, the number of special integers in $[1,N]$ is at least $cN$.
(For example, if $Q=\{3,7\}$, then $p(42)=3$, $q(42)=2$, $p(63)=3$, $q(63)=3$, $p(2022)=3$, $q(2022)=1$.)
For a function $ f(x)\equal{}\int_x^{\frac{\pi}{4}\minus{}x} \log_4 (1\plus{}\tan t)dt\ \left(0\leq x\leq \frac{\pi}{8}\right)$, answer the following questions.
(1) Find $ f'(x)$.
(2) Find the $ n$ th term of the sequence $ a_n$ such that $ a_1\equal{}f(0),\ a_{n\plus{}1}\equal{}f(a_n)\ (n\equal{}1,\ 2,\ 3,\ \cdots)$.
Let $ n\in \mathbb{N^*}$ and $ f: [0,1]\rightarrow \mathbb{R}$ a continuos function with the prop. $ \int_{0}^{1}(1\minus{}x^n)f(x)dx\equal{}0$.
Prove that $ \int_{0}^{1}f^2(x)dx \geq 2(n\plus{}1)\left(\int_{0}^{1}f(x)dx\right)^2$
Determine all functions $ f$ defined on the natural numbers that take values among the natural numbers for which
\[ (f(n))^p \equiv n\quad {\rm mod}\; f(p)
\]
for all $ n \in {\bf N}$ and all prime numbers $ p$.
Let $ F:\mathbb{R}\longrightarrow\mathbb{R} $ be a primitive with $ F(0)=0 $ of the function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ defined by $ f(x)=\frac{x}{1+e^x} , $ and let be a sequence $ \left( x_n \right)_{n\ge 0} $ such that $ x_0>0 $ and defined as $ x_n=F\left( x_{n-1} \right) . $
Calculate $ \lim_{n\to\infty } \frac{1}{n}\sum_{k=1}^n \frac{x_k}{\sqrt{x_{k+1}}} $
[i]Florian Dumitrel[/i]
Find all the functions $f:\mathbb{R} \rightarrow \mathbb{R}$ such that
$$|f(x)-f(y)| = 2 |x - y| $$
The function $f$ is defined on the set of integers and satisfies \[ f(n)=\begin{cases} n-3 & \text{if } n\ge 1000 \\ f(f(n+5)) & \text{if } n<1000\end{cases} \] Find $f(84)$.
Construct a function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ having the following properties:
$ \text{(i)} f $ is not monotonic on any real interval.
$ \text{(ii)} f $ has Darboux property (intermediate value property) on any real interval.
$ \text{(iii)} f(x)\leqslant f\left( x+1/n \right) ,\quad \forall x\in\mathbb{R} ,\quad \forall n\in\mathbb{N} $
[i]Alexandru Cioba[/i]
Suppose that ${f: \Bbb{R} \rightarrow \Bbb{R}}$ is an additive function $($that is ${f(x+y) = f(x)+f(y)}$ for all ${x, y \in \Bbb{R}})$ for which ${x \mapsto f(x)f(\sqrt{1-x^2})}$ is bounded of some nonempty subinterval of ${(0,1)}$. Prove that ${f}$ is continuous.
[i]Proposed by Zoltán Boros[/i]
Given $x_0\in\mathbb R$, $f,g:\mathbb R\to\mathbb R$, we define the $\emph{non-redundant binary tree}$ $T(x_0,f,g)$ in the following way:
[list=1]
[*]The tree $T$ initially consists of just $x_0$ at height $0$.
[*]Let $v_0,\dots,v_k$ be the vertices at height $h$. Then the vertices of height $h+1$ are added to $T$ by: for $i=0,1,\dots,k$, $f(v_i)$ is added as a child of $v_i$ if $f(v_i)\not\in T$, and $g(v_i)$ is added as a child of $v_i$ if $g(v_i)\not\in T$.
[/list]
For example, if $f(x)=x+1$ and $g(x)=x-1$, then the first three layers of $T(0,f,g)$ look like:
[asy]
size(100);
draw((-0.1,-0.2)--(-0.4,-0.8),EndArrow(size=3));
draw((0.1,-0.2)--(0.4,-0.8),EndArrow(size=3));
draw((-0.6,-1.2)--(-0.9,-1.8),EndArrow(size=3));
draw((0.6,-1.2)--(0.9,-1.8),EndArrow(size=3));
label("$0$",(0,0));
label("$1$",(-.5,-1));
label("$-1$",(.5,-1));
label("$2$",(-1,-2));
label("$-2$",(1,-2));[/asy]
If $f(x)=1024x-2047\lfloor x/2\rfloor$ and $g(x)=2x-3\lfloor x/2\rfloor+2\lfloor x/4\rfloor$, then how many vertices are in $T(2016,f,g)$?
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:\mathbb{Z} \to \mathbb{Z}$ such that the numbers
\[n, f(n),f(f(n)),\dots,f^{m-1}(n)\]
are distinct modulo $m$ for all integers $n,m$ with $m>1$.
(Here $f^k$ is defined by $f^0(n)=n$ and $f^{k+1}(n)=f(f^{k}(n))$ for $k \ge 0$.)
If $ c$ is a positive integer and $ p$ is an odd prime, what is the smallest residue (in absolute value) of \[ \sum_{n=0}^{\frac{p-1}{2}} \binom{2n}{n}c^n \;(\textrm{mod}\;p\ ) \ ?\]
J. Suranyi