Found problems: 4776
Suppose that $X$ and $Y$ are two metric spaces and $f:X \longrightarrow Y$ is a continious function. Also for every compact set $K \subseteq Y$, it's pre-image $f^{pre}(K)$ is a compact set in $X$. Prove that $f$ is a closed function, i.e for every close set $C\subseteq X$, it's image $f(C)$ is a closed subset of $Y$.
Let $ f(n)$ be a function defined on the set of all positive integers and having its values in the same set. Suppose that $ f(f(n) \plus{} f(m)) \equal{} m \plus{} n$ for all positive integers $ n,m.$ Find the possible value for $ f(1988).$
Let $n$ be a positive integer. Prove that the number of ways to express $n$ as a sum of distinct positive integers (up to order) and the number of ways to express $n$ as a sum of odd positive integers (up to order) are the same.
Find the number of ways a series of $+$ and $-$ signs can be inserted between the numbers $0,1,2,\cdots, 12$ such that the value of the resulting expression is divisible by 5.
[i]Proposed by Matthew Lerner-Brecher[/i]
In whatever follows $f$ denotes a differentiable function from $\mathbb{R}$ to $\mathbb{R}$. $f \circ f$
denotes the composition of $f(x)$.
$\textbf{(a)}$ If $f\circ f(x) = f(x) \forall x \in \mathbb{R}$ then for all $x$, $f'(x) =$ or $f'(f(x)) =$. Fill in the
blank and justify.
$\textbf{(b)}$Assume that the range of $f$ is of the form $ \left(-\infty , +\infty \right), [a, \infty ),(- \infty , b], [a, b] $.
Show that if $f \circ f = f$, then the range of $f$ is $\mathbb{R}$. [hide=Hint](Hint: Consider a maximal
element in the range of f)[/hide]
$\textbf{(c)}$ If $g$ satisfies $g \circ g \circ g = g$, then $g$ is onto. Prove that $g$ is either strictly increasing or strictly decreasing. Furthermore show that if $g$ is strictly increasing, then $g$ is unique.
Let $\{a_n\}_{n=1}^{\infty}$ be a sequence of positive integers for which
\[ a_{n+2} = \left[\frac{2a_n}{a_{n+1}}\right]+\left[\frac{2a_{n+1}}{a_n}\right]. \]
Prove that there exists a positive integer $m$ such that $a_m=4$ and $a_{m+1} \in\{3,4\}$.
[b]Note.[/b] $[x]$ is the greatest integer not exceeding $x$.
Let $f$ be a function from the set of integers to the set of positive integers. Suppose that, for any two integers $m$ and $n$, the difference $f(m) - f(n)$ is divisible by $f(m- n)$. Prove that, for all integers $m$ and $n$ with $f(m) \leq f(n)$, the number $f(n)$ is divisible by $f(m)$.
[i]Proposed by Mahyar Sefidgaran, Iran[/i]
Let $a\# b$ be defined as $ab-a-3$. For example, $4\#5=20-4-3=13$ Compute $(2\#0)\#(1\#4)$.
Let $a,b,c,d\in\mathbb{Z}_{\ge 0}$, $d\ne 0$ and the function $f:\mathbb{Z}_{\ge 0}\to\mathbb Z_{\ge 0}$ defined by
\[f(n)=\left\lfloor \frac{an+b}{cn+d}\right\rfloor\text{ for all } n\in\mathbb{Z}_{\ge 0}.\]
Prove that the following are equivalent:
[list=1]
[*] $f$ is surjective;
[*] $c=0$, $b<d$ and $0<a\le d$.
[/list]
[i]Tiberiu Trif[/i]
Find all functions $f$ from the set of real numbers into the set of real numbers which satisfy for all $x$, $y$ the identity \[ f\left(xf(x+y)\right) = f\left(yf(x)\right) +x^2\]
[i]Proposed by Japan[/i]
Found all functions $f: \mathbb{R} \to \mathbb{R}$, such that for any $x,y \in \mathbb{R}$,
\[f(x^2+xy+f(y))=f^2(x)+xf(y)+y.\]
Let $ f$ be a finite real function of one variable. Let $ \overline{D}f$ and $ \underline{D}f$ be its upper and lower derivatives, respectively, that is, \[ \overline{D}f\equal{}\limsup_{{h,k\rightarrow 0}_{{h,k \geq 0}_{h\plus{}k>0}}} \frac{f(x\plus{}h)\minus{}f(x\minus{}k)}{h\plus{}k}\] ,
\[ \underline{D}f\equal{}\liminf_{{h,k\rightarrow 0}_{{h,k \geq 0}_{h\plus{}k>0}}} \frac{f(x\plus{}h)\minus{}f(x\minus{}k)}{h\plus{}k}.\] Show that $ \overline{D}f$ and $ \underline{D}f$ are Borel-measurable functions. [A. Csaszar]
Let $I \subset \mathbb{R}$ be an open interval and $f:I \to \mathbb{R}$ a twice differentiable function such that $f(x)f''(x)=0,$ for any $x \in I.$ Prove that $f''(x)=0,$ for any $x \in I.$
For a function $f : [0,1] \to [0,1] $ we define $f^1 = f $ and $f^{n+1} (x) = f (f^n(x))$ for $0 \le x \le 1$ and $n \in N$. Given that there is a $n$ such that $|f^n(x) - f^n(y)| < |x - y| $ for all distinct $x, y \in [0,1]$, prove that there is a unique $x_0 \in [0,1]$ such that $f (x_0) = x_0$.
Let $ C$ be a nonempty closed bounded subset of the real line and $ f: C\to C$ be a nondecreasing continuous function. Show that there exists a point $ p\in C$ such that $ f(p) \equal{} p$.
(A set is closed if its complement is a union of open intervals. A function $ g$ is nondecreasing if $ g(x)\le g(y)$ for all $ x\le y$.)
Let f be a rational function (i.e. the quotient of two real polynomials) and suppose that $f(n)$ is an integer for infinitely many integers n. Prove that f is a polynomial.
Consider the sets $A = \{0,1,2\},$ and $B = \{1,2,3,4,5\}.$ Find the number of functions $f: A \to B$ such that $x + f(x) + xf(x)$ is odd for all $x.$ (A function $f:A \to B$ is a rule that assigns to every number in $A$ a number in $B.$)
\[\mathrm a. ~15\qquad \mathrm b. ~27 \qquad \mathrm c. ~30 \qquad\mathrm d. ~42\qquad\mathrm e. ~45\]
Given two positive integers $n$ and $m$ and a function $f : \mathbb{Z} \times \mathbb{Z} \to \left\{0,1\right\}$ with the property that
\begin{align*}
f\left(i, j\right) = f\left(i+n, j\right) = f\left(i, j+m\right) \qquad \text{for all } \left(i, j\right) \in \mathbb{Z} \times \mathbb{Z} .
\end{align*}
Let $\left[k\right] = \left\{1,2,\ldots,k\right\}$ for each positive integer $k$.
Let $a$ be the number of all $\left(i, j\right) \in \left[n\right] \times \left[m\right]$ satisfying
\begin{align*}
f\left(i, j\right) = f\left(i+1, j\right) = f\left(i, j+1\right) .
\end{align*}
Let $b$ be the number of all $\left(i, j\right) \in \left[n\right] \times \left[m\right]$ satisfying
\begin{align*}
f\left(i, j\right) = f\left(i-1, j\right) = f\left(i, j-1\right) .
\end{align*}
Prove that $a = b$.
Set $T$ consists of $66$ points in plane, and $P$ consists of $16$ lines in plane. Pair $(A,l)$ is [i]good[/i] if $A \in T$, $l \in P$ and $A \in l$. Prove that maximum number of good pairs is no greater than $159$, and prove that there exits configuration with exactly $159$ good pairs.
Let $S$ be a finite set, and let $\mathcal{A}$ be the set of all functions from $S$ to $S$. Let $f$ be an element of $\mathcal{A}$, and let $T=f(S)$ be the image of $S$ under $f$. Suppose that $f\circ g\circ f\ne g\circ f\circ g$ for every $g$ in $\mathcal{A}$ with $g\ne f$. Show that $f(T)=T$.
If $ a$, $ b$, $ c$, $ d$, and $ e$ are constants such that every $ x > 0$ satisfies
\[ \frac{5x^4 \minus{} 8x^3 \plus{} 2x^2 \plus{} 4x \plus{} 7}{(x \plus{} 2)^4}
\equal{} a \plus{} \frac{b}{x \plus{} 2} \plus{} \frac{c}{(x \plus{} 2)^2}
\plus{} \frac{d}{(x \plus{} 2)^3} \plus{} \frac{e}{(x \plus{} 2)^4} \, ,\]
then what is the value of $ a \plus{} b \plus{} c \plus{} d \plus{} e$?
Find $\lim_{n\to\infty} \frac{1}{(\ln n)^2}\sum_{k=3}^n \frac{\ln k}{k}.$
Let $n$ be a positive integer. Starting with the sequence $1,\frac{1}{2}, \frac{1}{3} , \cdots , \frac{1}{n}$, form a new sequence of $n -1$ entries $\frac{3}{4}, \frac{5}{12},\cdots ,\frac{2n -1}{2n(n -1)}$, by taking the averages of two consecutive entries in the first sequence. Repeat the averaging of neighbors on the second sequence to obtain a third sequence of $n -2$ entries and continue until the final sequence consists of a single number $x_n$. Show that $x_n < \frac{2}{n}$.
A $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ where $h_i\left(x_1,x_2, \cdots , x_n\right)$ are $n$ variable polynomials with real coefficients is called [i]good[/i] if the following condition holds:
For any $n$ functions $f_1,f_2, \cdots ,f_n : \mathbb R \to \mathbb R$ if for all $1 \le i \le n+1$, $P_i(x)=h_i \left(f_1(x),f_2(x), \cdots, f_n(x) \right)$ is a polynomial with variable $x$, then $f_1(x),f_2(x), \cdots, f_n(x)$ are polynomials.
$a)$ Prove that for all positive integers $n$, there exists a [i]good[/i] $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ such that the degree of all $h_i$ is more than $1$.
$b)$ Prove that there doesn't exist any integer $n>1$ that for which there is a [i]good[/i] $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ such that all $h_i$ are symmetric polynomials.
[i]Proposed by Alireza Shavali[/i]
Olja writes down $n$ positive integers $a_1, a_2, \ldots, a_n$ smaller than $p_n$ where $p_n$ denotes the $n$-th prime number. Oleg can choose two (not necessarily different) numbers $x$ and $y$ and replace one of them with their product $xy$. If there are two equal numbers Oleg wins. Can Oleg guarantee a win?
[i]Proposed by Matko Ljulj.[/i]