Found problems: 4776
Let $n$ be a positive integer and let $S$ be a set of $2^n+1$ elements. Let $f$ be a function from the set of two-element subsets of $S$ to $\{0, \dots, 2^{n-1}-1\}$. Assume that for any elements $x, y, z$ of $S$, one of $f(\{x,y\}), f(\{y,z\}), f(\{z, x\})$ is equal to the sum of the other two. Show that there exist $a, b, c$ in $S$ such that $f(\{a,b\}), f(\{b,c\}), f(\{c,a\})$ are all equal to 0.
Prove that for each $n \in \mathbb N$ there exist natural numbers $a_1<a_2<...<a_n$ such that $\phi(a_1)>\phi(a_2)>...>\phi(a_n)$.
[i]Proposed by Amirhossein Gorzi[/i]
Let $f$ be a function such that $f(x)+f(x+1)=2^x$ and $f(0)=2010$. Find the last two digits of $f(2010)$.
Find all functions $ f:\mathbb{R^{\ast }}\rightarrow \mathbb{ R^{\ast }}$ satisfying $f(\frac{f(x)}{f(y)})=\frac{1}{y}f(f(x))$ for all $x,y\in \mathbb{R^{\ast }}$
and are strictly monotone in $(0,+\infty )$
Find the values of $a\in [0,\infty)$ for which there exist continuous functions $f:\mathbb{R}\rightarrow \mathbb{R}$, such that $f(f(x))=(x-a)^2,\ (\forall)x\in \mathbb{R}$.
Find all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ such that
\[f(x+y) + f(x)f(y) = f(xy) + (y+1)f(x) + (x+1)f(y)\]
for all $x,y \in \mathbb{R}$.
Let $a,b,c,d$ be four non-negative numbers satisfying \[ a+b+c+d=1. \] Prove the inequality \[ a \cdot b \cdot c + b \cdot c \cdot d + c \cdot d \cdot a + d \cdot a \cdot b \leq \frac{1}{27} + \frac{176}{27} \cdot a \cdot b \cdot c \cdot d. \]
Let $d(n)$ denote the number of positive divisors of the positive integer $n$.Determine those numbers $n$ for which $d(n^3)=5d(n)$.
Let $r_1$, $r_2$, $\ldots$, $r_m$ be a given set of $m$ positive rational numbers such that $\sum_{k=1}^m r_k = 1$. Define the function $f$ by $f(n)= n-\sum_{k=1}^m \: [r_k n]$ for each positive integer $n$. Determine the minimum and maximum values of $f(n)$. Here ${\ [ x ]}$ denotes the greatest integer less than or equal to $x$.
Let $(F_n)_{n\in{N^*}}$ be the Fibonacci sequence defined by
$F_1=1$, $F_2=1$, $F_{n+1}=F_n+F_{n-1}$ for every $n\geq{2}$. Find
the limit: \[ \lim_{n \to \infty}(\sum_{i=1}^n{\frac{F_i}{2^i}}) \]
A function $ f$ defined on the positive integers (and taking positive integers values) is given by:
$ \begin{matrix} f(1) \equal{} 1, f(3) \equal{} 3 \\
f(2 \cdot n) \equal{} f(n) \\
f(4 \cdot n \plus{} 1) \equal{} 2 \cdot f(2 \cdot n \plus{} 1) \minus{} f(n) \\
f(4 \cdot n \plus{} 3) \equal{} 3 \cdot f(2 \cdot n \plus{} 1) \minus{} 2 \cdot f(n), \end{matrix}$
for all positive integers $ n.$ Determine with proof the number of positive integers $ \leq 1988$ for which $ f(n) \equal{} n.$
Find all functions $f: \mathbb N \to \mathbb N$ for which
\[ f(n) + f(n+1) = f(n+2)f(n+3)-1996\]
holds for all positive integers $n$.
Find all functions $f : \mathbb{N} \rightarrow \mathbb{N} $ satisfying
\[ f(mn) = \operatorname{lcm} (m,n) \cdot \gcd( f(m), f(n) ) \]
for all positive integer $m,n$.
Ten boxes are arranged in a circle. Each box initially contains a positive number of golf balls. A move consists of taking all of the golf balls from one of the boxes and placing them into the boxes that follow it in a counterclockwise direction, putting one ball into each box. Prove that if the next move always starts with the box where the last ball of the previous move was placed, then after some number of moves, we get back to the initial distribution of golf balls in the boxes.
Let $a$, $b$ and $c$ be positive real numbers such that $a+b+c=3$. Prove the inequality
$$\frac{a^3}{a^2+1}+\frac{b^3}{b^2+1}+\frac{c^3}{c^2+1} \geq \frac{3}{2}.$$
[i]Proposed by Anastasija Trajanova[/i]
Let $P$ be the set of all polygons in the plane and let $M : P \to R$ be a mapping that satisfies:
(i) $M(P) \ge 0$ for each polygon $P$,
(ii) $M(P) = x^2$ if $P$ is an equilateral triangle of side $x$,
(iii) If a polygon $P$ is partitioned into polygons $S$ and $T$, then $M(P) = M(S)+ M(T)$,
(iv) If polygons $P$ and $T$ are congruent, then $M(P) = M(T )$.
Determine $M(P)$ if $P$ is a rectangle with edges $x$ and $y$.
Let be a continuous function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that has the property that
$$ xf(x)\ge \int_0^x f(t)dt , $$
for all real numbers $ x. $ Prove that
[b]a)[/b] the mapping $ x\mapsto \frac{1}{x}\int_0^x f(t) dt $ is nondecreasing on the restrictions $ \mathbb{R}_{<0 } $ and $ \mathbb{R}_{>0 } . $
[b]b)[/b] if $ \int_x^{x+1} f(t)dt=\int_{x-1}^x f(t)dt , $ for any real number $ x, $ then $ f $ is constant.
[i]Mihai Piticari[/i]
Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $$f(f(x)-f(y))+2f(xy)=x^2f(x)+f(y^2)$$ for all real numbers $x,y$.
Let $\mathbb{N}$ be the set of positive integers. A function $f:\mathbb{N}\to\mathbb{N}$ satisfies the equation \[\underbrace{f(f(\ldots f}_{f(n)\text{ times}}(n)\ldots))=\frac{n^2}{f(f(n))}\] for all positive integers $n$. Given this information, determine all possible values of $f(1000)$.
[i]Proposed by Evan Chen[/i]
Given an integer $k$. $f(n)$ is defined on negative integer set and its values are integers. $f(n)$ satisfies \[ f(n)f(n+1)=(f(n)+n-k)^2, \] for $n=-2,-3,\cdots$. Find an expression of $f(n)$.
If the function $f$ is defined by
\[ f(x)=\frac{cx}{2x+3} , ~~~x\neq -\frac 32 , \] satisfies $x=f(f(x))$ for all real numbers $x$ except $-\frac 32$, then $c$ is
$\text{(A)} \ -3 \qquad \text{(B)} \ - \frac{3}{2} \qquad \text{(C)} \ \frac{3}{2} \qquad \text{(D)} \ 3 \qquad \text{(E)} \ \text{not uniquely determined}$
Prove that if $c$ is a positive number distinct from $1$ and $n$ a positive integer, then
\[n^{2}\leq \frac{c^{n}+c^{-n}-2}{c+c^{-1}-2}. \]
Find all functions $f$ from the set of reals to itself so that for all reals $x,y,$
$$f(x)f(f(x)+y) = f(x^2) + f(xy).$$
[i]Proposed by Culver Kwan[/i]
Given positive integer $ n > 1$ and define
\[ S \equal{} \{1,2,\dots,n\}.
\]
Suppose
\[ T \equal{} \{t \in S: \gcd(t,n) \equal{} 1\}.
\]
Let $ A$ be arbitrary non-empty subset of $ A$ such thar for all $ x,y \in A$, we have $ (xy\mod n) \in A$. Prove that the number of elements of $ A$ divides $ \phi(n)$. ($ \phi(n)$ is Euler-Phi function)
Let $n$ be a positive integer and let $V$ be a $(2n-1)$-dimensional vector space over the two-element field. Prove that for arbitrary vectors $v_1,\dots,v_{4n-1} \in V,$ there exists a sequence $1\leq i_1<\dots<i_{2n}\leq 4n-1$ of indices such that $v_{i_1}+\dots+v_{i_{2n}}=0.$