Found problems: 4776
Determine whether there exists a function $ f: \mathbb{N}\longrightarrow \mathbb{N}$ such that
$ f(n)\equal{}f(f(n\minus{}1))\plus{}f(f(n\plus{}1))$ for all natural numbers $ n\ge 2$.
The function $f(n)$ is defined on the positive integers and takes non-negative integer values. $f(2)=0,f(3)>0,f(9999)=3333$ and for all $m,n:$ \[ f(m+n)-f(m)-f(n)=0 \text{ or } 1. \] Determine $f(1982)$.
The graph of the function $ f$ is shown below. How many solutions does the equation $ f(f(x)) \equal{} 6$ have?
[asy]size(220);
defaultpen(fontsize(10pt)+linewidth(.8pt));
dotfactor=4;
pair P1=(-7,-4), P2=(-2,6), P3=(0,0), P4=(1,6), P5=(5,-6);
real[] xticks={-7,-6,-5,-4,-3,-2,-1,1,2,3,4,5,6};
real[] yticks={-6,-5,-4,-3,-2,-1,1,2,3,4,5,6};
draw(P1--P2--P3--P4--P5);
dot("(-7, -4)",P1);
dot("(-2, 6)",P2,LeftSide);
dot("(1, 6)",P4);
dot("(5, -6)",P5);
xaxis("$x$",-7.5,7,Ticks(xticks),EndArrow(6));
yaxis("$y$",-6.5,7,Ticks(yticks),EndArrow(6));[/asy]$ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 7$
Consider a composition of functions $\sin, \cos, \tan, \cot, \arcsin, \arccos, \arctan, \arccos$, applied to the number $1$. Each function may be applied arbitrarily many times and in any order. (ex: $\sin \cos \arcsin \cos \sin\cdots 1$). Can one obtain the number $2010$ in this way?
Let $a$ and $b$ satisfy $a \ge b >0, a + b = 1$.
i) Prove that if $m$ and $n$ are positive integers with $m < n$, then $a^m - a^n \ge b^m- b^n > 0$.
ii) For each positive integer $n$, consider a quadratic function $f_n(x) = x^2 - b^nx- a^n$.
Show that $f(x)$ has two roots that are in between $-1$ and $1$.
Let $p\in\mathbb N,f:[0,1]\to(0,\infty)$ be a continuous function and
$$a_n=\int^1_0x^p\sqrt[n]{f(x)}dx,n\in\mathbb N,n\ge2.$$
Demonstrate that:
a) $\lim_{n\to\infty}a_n=\frac1{p+1}$
b) $\lim_{n\to\infty}((p+1)a_n)^n=\exp\left((p+1)\int^1_0x^p\ln f(x)dx\right)$
[i]Proposed by Nicolae Papacu[/i]
Let $ f$ and $ g$ be two integer-valued functions defined on the set of all integers such that
[i](a)[/i] $ f(m \plus{} f(f(n))) \equal{} \minus{}f(f(m\plus{} 1) \minus{} n$ for all integers $ m$ and $ n;$
[i](b)[/i] $ g$ is a polynomial function with integer coefficients and g(n) = $ g(f(n))$ $ \forall n \in \mathbb{Z}.$
Find all nondecreasing functions $f: \mathbb{R}\rightarrow\mathbb{R}$ such that
(i) $f(0) = 0, f(1) = 1;$
(ii) $f(a) + f(b) = f(a)f(b) + f(a + b - ab)$ for all real numbers $a, b$ such that $a < 1 < b$.
[i]Proposed by A. Di Pisquale & D. Matthews, Australia[/i]
Find the solution of the functional equation $P(x)+P(1-x)=1$ with power $2015$
P.S: $P(y)=y^{2015}$ is also a function with power $2015$
For every $ n\in\mathbb{N}$ let $ d(n)$ denote the number of (positive) divisors of $ n$. Find all functions $ f: \mathbb{N}\to\mathbb{N}$ with the following properties: [list][*] $ d\left(f(x)\right) \equal{} x$ for all $ x\in\mathbb{N}$.
[*] $ f(xy)$ divides $ (x \minus{} 1)y^{xy \minus{} 1}f(x)$ for all $ x$, $ y\in\mathbb{N}$.[/list]
[i]Proposed by Bruno Le Floch, France[/i]
Find all functions $f: R\to R$ such that:
\[ f(x^2)-f(y^2)=(x+y)(f(x)-f(y)), x,y \in R \]
Let $s_n$ be the number of solutions to $a_1 + a_2 + a_3 +a _4 + b_1 + b_2 = n$, where $a_1,a_2,a_3$ and $a_4$ are elements of the set $\{2, 3, 5, 7\}$ and $b_1$ and $b_2$ are elements of the set $\{ 1, 2, 3, 4\}$. Find the number of $n$ for which $s_n$ is odd.
[i]Author: Alex Zhu[/i]
[hide="Clarification"]$s_n$ is the number of [i]ordered[/i] solutions $(a_1, a_2, a_3, a_4, b_1, b_2)$ to the equation, where each $a_i$ lies in $\{2, 3, 5, 7\}$ and each $b_i$ lies in $\{1, 2, 3, 4\}$. [/hide]
Find all real functions $f: \mathbb{R} \to \mathbb{R}$ such that $f(x^2+yf(x))=xf(x+y)$.
Let $f$ be a real-valued function defined on the positive integers satisfying the following condition: For all $n>1$ there exists a prime divisor $p$ of $n$ such that $f(n)=f\left(\frac{n}{p}\right)-f(p)$. Given that $f(2001)=1$, what is the value of $f(2002)$?
Study the real function $f(x) = \left(1 +\frac{1}{x}\right)^x$ defined for $ x \in R - \{-1, 0\}$ . Graphic representation.
Given a point $p$ and a line segment $l$, let $d(p,l)$ be the distance between them. Let $A$, $B$, and $C$ be points in the plane such that $AB=6$, $BC=8$, $AC=10$. What is the area of the region in the $(x,y)$-plane formed by the ordered pairs $(x,y)$ such that there exists a point $P$ inside triangle $ABC$ with $d(P,AB)+x=d(P,BC)+y=d(P,AC)?$
Denote by $ S$ the set of all positive integers. Find all functions $ f: S \rightarrow S$ such that
\[ f (f^2(m) \plus{} 2f^2(n)) \equal{} m^2 \plus{} 2 n^2\]
for all $ m,n \in S$.
[i]Bulgaria[/i]
Find all functions $f : \mathbb Z \to \mathbb Z$ such that
\[f (n |m|) + f (n(|m| +2)) = 2f (n(|m| +1)) \qquad \forall m,n \in \mathbb Z.\]
[b]Note.[/b] $|x|$ denotes the absolute value of the integer $x.$
Prove that there is no function $f:\mathbb{R}^{+} \to \mathbb{R}^{+}$ such that $f(x)^2 \geq f(x+y)(f(x)+y)$ for all $x,y \in \mathbb{R}^{+}$.
Let $\mathcal P$ denote the set of planes in three-dimensional space with positive $x$, $y$, and $z$ intercepts summing to one. A point $(x,y,z)$ with $\min \{x,y,z\} > 0$ lies on exactly one plane in $\mathcal P$. What is the maximum possible integer value of $\left(\frac{1}{4} x^2 + 2y^2 + 16z^2\right)^{-1}$?
[i]Proposed by Sammy Luo[/i]
Find all functions $f \colon \mathbb{R} \to \mathbb{R}$ that satisfy the following property for all real numbers $x$ and all polynomials $P$ with real coefficients:
If $P(f(x)) = 0$, then $f(P(x)) = 0$.
For any positive integer $ k$, let $ f_k$ be the number of elements in the set $ \{ k \plus{} 1, k \plus{} 2, \ldots, 2k\}$ whose base 2 representation contains exactly three 1s.
(a) Prove that for any positive integer $ m$, there exists at least one positive integer $ k$ such that $ f(k) \equal{} m$.
(b) Determine all positive integers $ m$ for which there exists [i]exactly one[/i] $ k$ with $ f(k) \equal{} m$.
Suppose that $a,b,c,d\in\mathbb{R}$ and $f(x)=ax^3+bx^2+cx+d$ such that $f(2)+f(5)<7<f(3)+f(4)$. Prove that there exists $u,v\in\mathbb{R}$ such that $u+v=7 , f(u)+f(v)=7$
For two given positive integers $ m,n > 1$, let $ a_{ij} (i = 1,2,\cdots,n, \; j = 1,2,\cdots,m)$ be nonnegative real numbers, not all zero, find the maximum and the minimum values of $ f$, where
\[ f = \frac {n\sum_{i = 1}^{n}(\sum_{j = 1}^{m}a_{ij})^2 + m\sum_{j = 1}^{m}(\sum_{i= 1}^{n}a_{ij})^2}{(\sum_{i = 1}^{n}\sum_{j = 1}^{m}a_{ij})^2 + mn\sum_{i = 1}^{n}\sum_{j=1}^{m}a_{ij}^2}. \]
Let $f$ be a function $f: \mathbb{N} \cup \{0\} \mapsto \mathbb{N},$ and satisfies the following conditions:
(1) $f(0) = 0, f(1) = 1,$
(2) $f(n+2) = 23 \cdot f(n+1) + f(n), n = 0,1, \ldots.$
Prove that for any $m \in \mathbb{N}$, there exist a $d \in \mathbb{N}$ such that $m | f(f(n)) \Leftrightarrow d | n.$