Found problems: 4776
Find all function $ f: \mathbb{R} \rightarrow \mathbb{R}$ such that
\[ f(x \plus{} y)(f(x) \minus{} y) \equal{} xf(x) \minus{} yf(y)
\]
for all $ x,y \in \mathbb{R}$.
Let $\mathbb{Z}_+=\{1,2,3,4...\}$ be the set of all positive integers. Determine all functions $f : \mathbb{Z}_+ \mapsto \mathbb{Z}_+$ that satisfy:
[list]
[*]$f(mn)+1=f(m)+f(n)$ for all positive integers $m$ and $n$;
[*]$f(2024)=1$;
[*]$f(n)=1$ for all positive $n\equiv22\pmod{23}$.
[/list]
An airline company is planning to introduce a network of connections between the ten different airports of Sawubonia. The airports are ranked by priority from first to last (with no ties). We call such a network [i]feasible[/i] if it satisfies the following conditions:
[list]
[*] All connections operate in both directions
[*] If there is a direct connection between two airports A and B, and C has higher priority than B, then there must also be a direct connection between A and C.[/list]
Some of the airports may not be served, and even the empty network (no connections at all) is allowed. How many feasible networks are there?
Let the complex function $F(z)$ be regular on the punctuated disk $\{ 0<|z| < R\}$. By a [i]level curve[/i] we mean a component of the level set of $\mathrm{Re}F(z)$, that is, a maximal connected set on which $\mathrm{Re}F(z)$ is constant. Denote by $A(r)$ the union of those level curves that are entirely contained in the punctuated disk $\{ 0<|z|<r\}$. Prove that if the number of components of $A(r)$ has an upper bound independent of $r$ then $F(z)$ can only have a pole type singularity at $0$.
Determine all functions $f: \mathbb R \to \mathbb R$ which satisfy the inequality
$$f(a^2) - f(b^2) \leq \left( f(a) + b\right)\left( a - f(b)\right),$$
for all $a,b \in \mathbb R$.
Let f be a function that satisfies the following conditions:
$(i)$ If $x > y$ and $f(y) - y \geq v \geq f(x) - x$, then $f(z) = v + z$, for some number $z$ between $x$ and $y$.
$(ii)$ The equation $f(x) = 0$ has at least one solution, and among the solutions of this equation, there is one that is not smaller than all the other solutions;
$(iii)$ $f(0) = 1$.
$(iv)$ $f(1987) \leq 1988$.
$(v)$ $f(x)f(y) = f(xf(y) + yf(x) - xy)$.
Find $f(1987)$.
[i]Proposed by Australia.[/i]
The number of real solutions to the equation \[ \frac{x}{100} = \sin x \] is
$\text{(A)} \ 61 \qquad \text{(B)} \ 62 \qquad \text{(C)} \ 63 \qquad \text{(D)} \ 64 \qquad \text{(E)} \ 65$
is there a function $f:\mathbb{N}\rightarrow \mathbb{N}$ such that
$i) \exists n\in \mathbb{N}:f(n)\neq n$
$ii)$ the number of divisors of $m$ is $f(n)$ if and only if the number of divisors of $f(m)$ is $n$
You are presented with a mystery function $f:\mathbb N^2\to\mathbb N$ which is known to satisfy \[f(x+1,y)>f(x,y)\quad\text{and}\quad f(x,y+1)>f(x,y)\] for all $(x,y)\in\mathbb N^2$. I will tell you the value of $f(x,y)$ for \$1. What's the minimum cost, in dollars, that it takes to compute the $19$th smallest element of $\{f(x,y)\mid(x,y)\in\mathbb N^2\}$? Here, $\mathbb N=\{1,2,3,\dots\}$ denotes the set of positive integers.
find all $f : \mathbb{C} \to \mathbb{C}$ st:
$$f(f(x)+yf(y))=x+|y|^2$$
for all $x,y \in \mathbb{C}$
What is the value of $2-(-2)^{-2}$?
$ \textbf{(A) } -2
\qquad\textbf{(B) } \dfrac{1}{16}
\qquad\textbf{(C) } \dfrac{7}{4}
\qquad\textbf{(D) } \dfrac{9}{4}
\qquad\textbf{(E) } 6
$
[b]a)[/b] Let be a continuous function $ f:\mathbb{R}_{\ge 0}\longrightarrow\mathbb{R}_{>0} . $ Show that there exists a natural number $ n_0 $ and a sequence of positive real numbers $ \left( x_n \right)_{n>n_0} $ that satisfy the following relation.
$$ n\int_0^{x_n} f(t)dt=1,\quad n_0<\forall n\in\mathbb{N} $$
[b]b)[/b] Prove that the sequence $ \left( nx_n \right)_{n> n_0} $ is convergent and find its limit.
Assume $\Omega(n),\omega(n)$ be the biggest and smallest prime factors of $n$ respectively . Alireza and Amin decided to play a game. First Alireza chooses $1400$ polynomials with integer coefficients. Now Amin chooses $700$ of them, the set of polynomials of Alireza and Amin are $B,A$ respectively . Amin wins if for all $n$ we have :
$$\max_{P \in A}(\Omega(P(n))) \ge \min_{P \in B}(\omega(P(n)))$$
Who has the winning strategy.
Proposed by [i]Alireza Haghi[/i]
Let $\, a$, and $b \,$ be odd positive integers. Define the sequence $\{f_n\}_{n\ge 1}$ by putting $\, f_1 = a,$ $f_2 = b, \,$ and by letting $\, f_n \,$ for $\, n \geq 3 \,$ be the greatest odd divisor of $\, f_{n-1} + f_{n-2}$. Show that $\, f_n \,$ is constant for sufficiently large $\, n \,$ and determine the eventual value as a function of $\, a \,$ and $\, b$.
For any function $f:[0,1]\to [0,1]$, let $P_n (f)$ denote the number of fixed points of the function $\underbrace{f(f(\dotsc f}_{n} (x)\dotsc )$, i.e., the number of points $x\in [0,1]$ satisfying $\underbrace{f(f(\dotsc f}_{n} (x)\dotsc )=x$. Construct a piecewise linear, continuous, surjective function $f:[0,1] \to [0,1]$ such that for a suitable $2<A<3$, the sequence $\frac{P_n(f)}{A^n}$ converges.
[i]Based on the 8th problem of the Miklós Schweitzer competition, 2018[/i]
Given functions $f,g:N^*\rightarrow N^*$, $g$ is surjective and $2f(n)^2=n^2+g(n)^2$, $\forall n>0$. Prove that if $|f(n)-n|\le2005\sqrt n$, $\forall n>0$, then $f(n)=n$ for infinitely many $n$.
Find all functions $f: \mathbb{Z} \rightarrow \mathbb{Z}$ such that
$\boxed{1} \ f(1) = 1$
$\boxed{2} \ f(m+n)(f(m)-f(n)) = f(m-n)(f(m)+f(n)) \ \forall \ m,n \in \mathbb{Z}$
Find all functions $f:\mathbb{N}\to\mathbb{R}$ such that
$f(km)+f(kn)-f(k)f(mn)\ge 1$
for all $k,m,n\in\mathbb{N}$.
Let $ \{ f_n \}$ be a sequence of Lebesgue-integrable functions on $ [0,1]$ such that for any Lebesgue-measurable subset $ E$ of $ [0,1]$ the sequence $ \int_E f_n$ is convergent. Assume also that $ \lim_n f_n\equal{}f$ exists almost everywhere. Prove that $ f$ is integrable and $ \int_E f\equal{}\lim_n \int_E f_n$. Is the assertion also true if $ E$ runs only over intervals but we also assume $ f_n \geq 0 ?$ What happens if $ [0,1]$ is replaced by $ [0,\plus{}\infty) ?$
[i]J. Szucs[/i]
Polynomial $P(x)$ with degree $n \geq 3$ has $n$ real roots $x_1 < x_2 < x_3 <...< x_n$, such that $x_2-x_1<x_3-x_2<....<x_n-x_{n-1}$. Prove that the maximum of the function $y=|P(x)|$ where $x$ is on the interval $[ x_1, x_n ]$, is in the interval $[x_n-1, x_n]$.
On the domain $0\leq \theta \leq 2\pi:$
(a) Prove that $\sin^{2}\theta \cdot \sin 2\theta$ takes its maximum at $\frac{\pi}{3}$ and $\frac{4 \pi}{3}$ (and hence its minimum at $\frac{2 \pi}{3}$ and $\frac{ 5 \pi}{3}$).
(b) Show that
$$| \sin^{2} \theta \cdot \sin^{3} 2\theta \cdot \sin^{3} 4 \theta \cdots \sin^{3} 2^{n-1} \theta \cdot \sin 2^{n} \theta |$$
takes its maximum at $\frac{4 \pi}{3}$ (the maximum may also be attained at other points).
(c) Derive the inequality:
$$ \sin^{2} \theta \cdot \sin^{2} 2\theta \cdots \sin^{2} 2^{n} \theta \leq \left( \frac{3}{4} \right)^{n}.$$
Let $k>1$ be an integer. A function $f:\mathbb{N^*}\to\mathbb{N^*}$ is called $k$-[i]tastrophic[/i] when for every integer $n>0$, we have $f_k(n)=n^k$ where $f_k$ is the $k$-th iteration of $f$:
\[f_k(n)=\underbrace{f\circ f\circ\cdots \circ f}_{k\text{ times}}(n)\]
For which $k$ does there exist a $k$-tastrophic function?
Let $ M $ denote the set of the primitives of a function $ f:\mathbb{R}\longrightarrow\mathbb{R} . $
[b]ii)[/b] Show that $ M $ along with the operation $ *:M^2\longrightarrow M $ defined as $ F*G=F+G(2007) $ form a commutative group.
[b]iii)[/b] Show that $ M $ is isomorphic with the additive group of real numbers.
Let $H$ be the orthocenter of an acute-angled triangle $ABC$. Show that the triangles $ABH,BCH$ and $CAH$ have the same perimeter if and only if the triangle $ABC$ is equilateral.
Find all functions $g:\mathbb{N}\rightarrow\mathbb{N}$ such that \[\left(g(m)+n\right)\left(g(n)+m\right)\] is a perfect square for all $m,n\in\mathbb{N}.$
[i]Proposed by Gabriel Carroll, USA[/i]