Found problems: 4776
Let $a,b,c$ be distinct positive real numbers, and let $k$ be a positive integer greater than $3$. Show that
\[\left\lvert\frac{a^{k+1}(b-c)+b^{k+1}(c-a)+c^{k+1}(a-b)}{a^k(b-c)+b^k(c-a)+c^k(a-b)}\right\rvert\ge \frac{k+1}{3(k-1)}(a+b+c)\]
and
\[\left\lvert\frac{a^{k+2}(b-c)+b^{k+2}(c-a)+c^{k+2}(a-b)}{a^k(b-c)+b^k(c-a)+c^k(a-b)}\right\rvert\ge \frac{(k+1)(k+2)}{3k(k-1)}(a^2+b^2+c^2).\]
[i]Calvin Deng.[/i]
Denote by $\mathbb{N}$ the set of all positive integers. Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all positive integers $m$ and $n$, the integer $f(m)+f(n)-mn$ is nonzero and divides $mf(m)+nf(n)$.
[i]Proposed by Dorlir Ahmeti, Albania[/i]
Determine all functions $f:\mathbb{R}\to\mathbb{R}$ such that all real numbers $x$ and $y$ satisfy \[f(f(x)+y)=f(x^2-y)+4f(x)y.\]
Let $n$ be a positive integer. Suppose for any $\mathcal{S} \subseteq \{1, 2, \cdots, n\}$, $f(\mathcal{S})$ is the set containing all positive integers at most $n$ that have an odd number of factors in $\mathcal{S}$. How many subsets of $\{1, 2, \cdots, n\}$ can be turned into $\{1\}$ after finitely many (possibly zero) applications of $f$?
The function $f(x, y)$ is defined for all real numbers $x, y$. It satisfies $f(x,0) = ax$ (where $a$ is a non-zero constant) and if $(c, d)$ and $(h, k)$ are distinct points such that $f(c, d) = f(h, k)$, then $f(x, y)$ is constant on the line through $(c, d)$ and $(h, k)$. Show that for any real $b$, the set of points such that $f(x, y) = b$ is a straight line and that all such lines are parallel. Show that $f(x, y) = ax + by$, for some constant $b$.
Show that there is no function \(f:\mathbb{N}^* \rightarrow \mathbb{N}^*\) such that \(f^n(n)=n+1\) for all \(n\) (when \(f^n\) is the \(n\)th iteration of \(f\))
Let $f$ be any function that maps the set of real numbers into the set of real numbers. Prove that there exist real numbers $x$ and $y$ such that \[f\left(x-f(y)\right)>yf(x)+x\]
[i]Proposed by Igor Voronovich, Belarus[/i]
[b]Problem 3.[/b] Let $n\geq 3$ is given natural number, and $M$ is the set of the first $n$ primes. For any nonempty subset $X$ of $M$ with $P(X)$ denote the product of its elements. Let $N$ be a set of the kind $\ds\frac{P(A)}{P(B)}$, $A\subset M, B\subset M, A\cap B=\emptyset$ such that the product of any 7 elements of $N$ is integer. What is the maximal number of elements of $N$?
[i]Alexandar Ivanov[/i]
function $f:\mathbb{N}^{\star} \times \mathbb{N}^{\star} \rightarrow \mathbb{N}^{\star}$ ($\mathbb{N}^{\star}=\mathbb{N}\cup \{0\}$)with these conditon:
1- $f(0,x)=x+1$
2- $f(x+1,0)=f(x,1)$
3- $f(x+1,y+1)=f(x,f(x+1,y))$(romania 1997)
find $f(3,1997)$
Let $ \mathbb{N}$ denote the set of all positive integers. Prove that there exists a unique function $ f: \mathbb{N} \mapsto \mathbb{N}$ satisfying
\[ f(m \plus{} f(n)) \equal{} n \plus{} f(m \plus{} 95)
\]
for all $ m$ and $ n$ in $ \mathbb{N}.$ What is the value of $ \sum^{19}_{k \equal{} 1} f(k)?$
Find all functions $f: \mathbb{N} \to \mathbb{N}$ such that for all $m,n \in \mathbb{N}$ holds $f(mn)=f(m)f(n)$ and $m+n \mid f(m)+f(n)$ .
Find all functions $f: \mathbb R \to \mathbb R$ such that for all reals $x$ and $y$,
\[f(f(x)-y^{2})=f(x)^{2}-2f(x)y^{2}+f(f(y)).\]
$a,b$ are positive integers, $a>b$. $\sin\theta=\frac{2ab}{a^2+b^2}(0<\theta<\frac{\pi}{2})$. If $A_n=(a^2+b^2)\sin n\theta$, prove that $A_n$ is an integer for all $n\in\mathbb{Z}_+$
Let $\mathbb{R}$ be the set of real numbers. Let $f:\mathbb{R}\rightarrow\mathbb{R}$ be a function such that \[f(x+y)f(x-y)\geqslant f(x)^2-f(y)^2\] for every $x,y\in\mathbb{R}$. Assume that the inequality is strict for some $x_0,y_0\in\mathbb{R}$.
Prove that either $f(x)\geqslant 0$ for every $x\in\mathbb{R}$ or $f(x)\leqslant 0$ for every $x\in\mathbb{R}$.
Let $\, |U|, \, \sigma(U) \,$ and $\, \pi(U) \,$ denote the number of elements, the sum, and the product, respectively, of a finite set $\, U \,$ of positive integers. (If $\, U \,$ is the empty set, $\, |U| = 0, \, \sigma(U) = 0, \, \pi(U) = 1$.) Let $\, S \,$ be a finite set of positive integers. As usual, let $\, \binom{n}{k} \,$ denote $\, n! \over k! \, (n-k)!$. Prove that \[ \sum_{U \subseteq S} (-1)^{|U|} \binom{m - \sigma(U)}{|S|} = \pi(S) \] for all integers $\, m \geq \sigma(S)$.
Determine all functions $f:\mathbb{R}\to\mathbb{R}$ which are differentiable in $0$ and satisfy the following inequality for all real numbers $x,y$ \[f(x+y)+f(xy)\geq f(x)+f(y).\][i]Dan Ștefan Marinescu and Mihai Piticari[/i]
Let $n>1 \in \mathbb{N}$ and $a_1, a_2, ..., a_n$ be a sequence of $n$ natural integers. Let:
$$b_1 = \left[\frac{a_2 + \cdots + a_n}{n-1}\right], b_i = \left[\frac{a_1 + \cdots + a_{i-1} + a_{i+1} + \cdots + a_n}{n-1}\right], b_n = \left[\frac{a_1 + \cdots + a_{n-1}}{n-1}\right]$$
Define a mapping $f$ by $f(a_1,a_2, \cdots a_n) = (b_1,b_2,\cdots,b_n)$.
a) Let $g: \mathbb{N} \to \mathbb{N}$ be a function such that $g(1)$ is the number of different elements in $f(a_1,a_2, \cdots a_n)$ and $g(m)$ is the number od different elements in $f^m(a_1,a_2, \cdots a_n) = f(f^{m-1}(a_1,a_2, \cdots a_n)); m>1$. Prove that $\exists k_0 \in \mathbb{N}$ s.t. for $m \ge k_0$ the function $g(m)$ is periodic.
b) Prove that $\sum_{m=1}^k \frac{g(m)}{m(m+1)} < C$ for all $k \in \mathbb{N}$, where $C$ is a function that doesn't depend on $k$.
Find all functions $f:\mathbb{N} \to \mathbb{N}$ such that for any two positive integers $a$ and $b$ we have $$ f^a(b) + f^b(a) \mid 2(f(ab) +b^2 -1)$$
Where $f^n(m)$ is defined in the standard iterative manner.
Function $F(x)=|\cos^2x+2\sin x\cos x-\sin^2x+Ax+B|$, where $A,B$ are two real numbers, $x\in[0,\frac{3}{2}\pi]$. $M$ is the maximun value of $F(x)$. Find the minumum value of $M$.
Denote the set of all positive integers by $\mathbb{N}$, and the set of all ordered positive integers by $\mathbb{N}^2$. For all non-negative integers $k$, define [i]good functions of order k[/i] recursively for all non-negative integers $k$, among all functions from $\mathbb{N}^2$ to $\mathbb{N}$ as follows:
(i) The functions $f(a,b)=a$ and $f(a,b)=b$ are both good functions of order $0$.
(ii) If $f(a,b)$ and $g(a,b)$ are good functions of orders $p$ and $q$, respectively, then $\gcd(f(a,b),g(a,b))$ is a good function of order $p+q$, while $f(a,b)g(a,b)$ is a good function of order $p+q+1$.
Prove that, if $f(a,b)$ is a good function of order $k\leq \binom{n}{3}$ for some positive integer $n\geq 3$, then there exist a positive integer $t\leq \binom{n}{2}$ and $t$ pairs of non-negative integers $(x_1,y_1),\ldots,(x_n,y_n)$ such that
$$f(a,b)=\gcd(a^{x_1}b^{y_1},\ldots,a^{x_t}b^{y_t})$$
holds for all positive integers $a$ and $b$.
[i]Proposed by usjl[/i]
Find all functions $f:\mathbb{R}\to \mathbb{R},g:\mathbb{R}\to \mathbb{R}$ such that
$$f(x-2f(y))= xf(y)-yf(x)+g(x)$$ for all real $x,y$
The function $f(n)$ satisfies $f(0)=0$, $f(n)=n-f \left( f(n-1) \right)$, $n=1,2,3 \cdots$. Find all polynomials $g(x)$ with real coefficient such that
\[ f(n)= [ g(n) ], \qquad n=0,1,2 \cdots \]
Where $[ g(n) ]$ denote the greatest integer that does not exceed $g(n)$.
Find all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ that satisfy the conditions
\[f(1+xy)-f(x+y)=f(x)f(y) \quad \text{for all } x,y \in \mathbb{R},\]
and $f(-1) \neq 0$.
For each positive integer $m$ and $n$ define function $f(m, n)$ by $f(1, 1) = 1$, $f(m+ 1, n) = f(m, n) +m$ and $f(m, n + 1) = f(m, n) - n$. Find the sum of all the values of $p$ such that $f(p, q) = 2004$ for some $q$.
Let $A$ and $B$ be sets with $2011^2$ and $2010$ elements, respectively. Show that there is a function $f:A \times A \to B$ satisfying the condition $f(x,y)=f(y,x)$ for all $(x,y) \in A \times A$ such that for every function $g:A \to B$ there exists $(a_1,a_2) \in A \times A$ with $g(a_1)=f(a_1,a_2)=g(a_2)$ and $a_1 \neq a_2.$