Found problems: 4776
Prove that there is no function $f$ from the set of non-negative integers into itself such that $f(f(n))=n+1987$ for all $n$.
Let $P$ be a point on the graph of the function $y=x+\frac{2}{x}(x>0)$. $PA,PB$ are perpendicular to line $y=x$ and $x=0$, respectively, the feet of perpendicular being $A$ and $B$. Find the value of $\overrightarrow{PA}\cdot \overrightarrow{PB}$.
Find all $a\in\mathbb{R}$ for which there exists a non-constant function $f: (0,1]\rightarrow\mathbb{R}$ such that \[a+f(x+y-xy)+f(x)f(y)\leq f(x)+f(y)\] for all $x,y\in(0,1].$
Does there exist a sequence $\displaystyle{\left( {{a_n}} \right)}$ of complex numbers such that for every positive integer $\displaystyle{p}$ we have that $\displaystyle{\sum\limits_{n = 1}^{ + \infty } {a_n^p} }$ converges if and only if $\displaystyle{p}$ is not a prime?
[i]Proposed by Tomáš Bárta, Charles University, Prague.[/i]
The function $f$ is increasing and convex (i.e. every straight line between two points on the graph of $f$ lies above the graph) and satisfies $f(f(x))=3^x$ for all $x\in\mathbb{R}$. If $f(0)=0.5$ determine $f(0.75)$ with an error of at most $0.025$. The following are corrent to the number of digits given:
\[3^{0.25}=1.31607,\quad 3^{0.50}=1.73205,\quad 3^{0.75}=2.27951.\]
Let $G=G(V,E)$ be a simple graph with vertex set $V$ and edge set $E$. Suppose $|V|=n$. A map $f:\,V\rightarrow\mathbb{Z}$ is called good, if $f$ satisfies the followings:
(1) $\sum_{v\in V} f(v)=|E|$;
(2) color arbitarily some vertices into red, one can always find a red vertex $v$ such that $f(v)$ is no more than the number of uncolored vertices adjacent to $v$.
Let $m(G)$ be the number of good maps. Prove that if every vertex in $G$ is adjacent to at least one another vertex, then $n\leq m(G)\leq n!$.
Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a continuous function with the following property: for all $\alpha \in \mathbb{R}_{>0}$, the sequence $(a_n)_{n \in \mathbb{N}}$ defined as $a_n = f(n\alpha)$ satisfies $\lim_{n \to \infty} a_n = 0$. Is it necessarily true that $\lim_{x \to +\infty} f(x) = 0$?
Evaluate $ \int_0^1 \frac{x}{1\plus{}x}\sqrt{1\minus{}x^2}\ dx$.
Prove for $ 0 < k \leq 1$ and $ a_i \in \mathbb{R}^\plus{},$ $ i \equal{} 1,2 \ldots, n$ the following inequality holds:
\[ \left( \frac{a_1}{a_2 \plus{} \ldots \plus{} a_n} \right)^k \plus{} \ldots \plus{} \left( \frac{a_n}{a_1 \plus{} \ldots \plus{} a_{n\minus{}1}} \right)^k \geq \frac{n}{(n\minus{}1)^k}.\]
Let $ x$, $ y$, $ z \in\mathbb{R}^+$ satisfying $ xyz = 1$. Prove that
\[ \frac {(x + y - 1)^2}{z} + \frac {(y + z - 1)^2}{x} + \frac {(z + x - 1)^2}{y}\geqslant x + y + z\mbox{.}\]
Denote by $m(a,b)$ the arithmetic mean of positive real numbers $a,b$. Given a positive real function $g$ having positive derivatives of the first and second order, define $\mu (a,b)$ the mean value of $a$ and $b$ with respect to $g$ by $2g(\mu (a,b)) = g(a)+g(b)$. Decide which of the two mean values $m$ and $\mu$ is larger.
Hamilton Avenue has eight houses. On one side of the street are the houses
numbered 1,3,5,7 and directly opposite are houses 2,4,6,8 respectively. An
eccentric postman starts deliveries at house 1 and delivers letters to each of
the houses, finally returning to house 1 for a cup of tea. Throughout the
entire journey he must observe the following rules. The numbers of the houses
delivered to must follow an odd-even-odd-even pattern throughout, each house
except house 1 is visited exactly once (house 1 is visited twice) and the postman
at no time is allowed to cross the road to the house directly opposite. How
many different delivery sequences are possible?
Let $n$ be a positive integer. Denote $M = \{(x, y)|x, y \text{ are integers }, 1 \leq x, y \leq n\}$. Define function $f$ on $M$ with the following properties:
[b]a.)[/b] $f(x, y)$ takes non-negative integer value; [b]
b.)[/b] $\sum^n_{y=1} f(x, y) = n - 1$ for $1 \eq x \leq n$;
[b]c.)[/b] If $f(x_1, y_1)f(x2, y2) > 0$, then $(x_1 - x_2)(y_1 - y_2) \geq 0.$
Find $N(n)$, the number of functions $f$ that satisfy all the conditions. Give the explicit value of $N(4)$.
Given positive numbers $a,b,c$, find the minimum of the function $f(x) = \sqrt{a^2 +x^2} +\sqrt{(b-x)^2 +c^2}$.
[color=darkred]Let $u:[a,b]\to\mathbb{R}$ be a continuous function that has finite left-side derivative $u_l^{\prime}(x)$ in any point $x\in (a,b]$ . Prove that the function $u$ is monotonously increasing if and only if $u_l^{\prime}(x)\ge 0$ , for any $x\in (a,b]$ .[/color]
If $ a@b\equal{}\frac{a\plus{}b}{a\minus{}b}$, find $ n$ such that $ 3@n\equal{}3$.
Source: 1976 Euclid Part A Problem 3
-----
The minimum value of the function $2x^2+6x+7$ is
$\textbf{(A) } 7 \qquad \textbf{(B) } \frac{5}{2} \qquad \textbf{(C) } \frac{9}{4} \qquad \textbf{(D) } -\frac{9}{2} \qquad \textbf{(E) } \frac{5}{4}$
Prove that a harmonic function that is not identically zero in the plane cannot vanish on a two-dimensional positive-measure set.
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)$.
Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for all $x,y, \in \mathbb{R}$,
\[xf(x+xy)=xf(x)+f(x^{2})\cdot f(y).\]
Find all pairs $(a, b)$ of real numbers such that $a \cdot \lfloor b \cdot n\rfloor = b \cdot \lfloor a \cdot n \rfloor$ applies to all positive integers$ n$.
(For a real number $x, \lfloor x\rfloor$ denotes the largest integer that is less than or equal to $x$.)
Let $f(x)=Ax^2+Bx+C$, $g(x)=ax^2+bx+c$ be two quadratic polynomial functions with real coefficients that satisfy the relation \[|f(x)| \ge |g(x)|\] for all real $x$. Prove that $|b^2-4ac| \le |B^2-4AC|.$
My solution was nearly complete...
The audience arranges $n$ coins in a row. The sequence of heads and tails is chosen arbitrarily. The audience also chooses a number between $1$ and $n$ inclusive. Then the assistant turns one of the coins over, and the magician is brought in to examine the resulting sequence. By an agreement with the assistant beforehand, the magician tries to determine the number chosen by the audience.
[list][b](a)[/b] Prove that if this is possible for some $n$, then it is also possible for $2n$.
[b](b)[/b] Determine all $n$ for which this is possible.[/list]
A continuous function $f : R \to R$ satisfies the conditions $f(1000) = 999$ and $f(x)f(f(x)) = 1$ for all real $x$. Determine $f(500)$.
Find all functions $f,g$:$R \to R$ such that $f(x+yg(x))=g(x)+xf(y)$ for $x,y \in R$.