This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND
OR
NO

Found problems: 4776

Find all continuous and nondecreasing functions $ f:[0,\infty)\longrightarrow\mathbb{R} $ that satisfy the inequality: $$ \int_0^{x+y} f(t) dt\le \int_0^x f(t) dt +\int_0^y f(t) dt,\quad\forall x,y\in [0,\infty) . $$
Let $n$ be a positive integer and $a_1,a_2,\dots,a_n$ be integers. Function $f: \mathbb{Z} \rightarrow \mathbb{R}$ is such that for all integers $k$ and $l$, $l \neq 0$, $$\sum_{i=1}^n f(k+a_il)=0.$$ Prove that $f \equiv 0$.
Let $ N$ denote the set of natural numbers. Let $ \phi: N\rightarrow N$ be a bijective function and assume that there exists a finite limit \[ \lim_{n\rightarrow\infty}\frac{\phi(n)}{n}\equal{}L. \] What are the possible values of $ L$?
Define the function $ f(t)\equal{}\int_0^1 (|e^x\minus{}t|\plus{}|e^{2x}\minus{}t|)dx$. Find the minimum value of $ f(t)$ for $ 1\leq t\leq e$.
Is is true that if the perfect set $F\subseteq [0,1]$ is of zero Lebesgue measure then those functions in $C^1[0,1]$ which are one-to-one on $F$ form a dense subset of $C^1[0,1]$? (We use the metric $$d(f,g)=\sup_{x\in[0,1]} |f(x)-g(x)| + \sup_{x\in[0,1]} |f'(x)-g'(x)|$$ to define the topology in the space $C^1[0,1]$ of continuously differentiable real functions on $[0,1]$.)
Let $S_1$ and $S_2$ be two spheres with distinct radii that touch externally. The spheres lie inside a cone $C$, and each sphere touches the cone in a full circle. Inside the cone there are $n$ additional solid spheres arranged in a ring in such a way that each solid sphere touches the cone $C$, both of the spheres $S_1$ and $S_2$ externally, as well as the two neighboring solid spheres. What are the possible values of $n$? [i]Proposed by Iceland.[/i]
Let $f:\mathbb{R}\rightarrow\mathbb{R}$ be a function defined as the maximum of a finite number of functions $g:\mathbb{R}\rightarrow\mathbb{R}$ of the form $g(x)=C\cdot10^{-|x-d|}$ (with different values of parameters $d{}$ and $C>0$). For real numbers $a<b$ we have $f(a)=f(b)$. Prove that on the segment $[a;b]$ the sum of legnths of segments on which $f$ is increasing is equal to the sum of legnths of segments on which $f$ is decreasing.
Let $ t$ be a positive number. Draw two tangent lines from the point $ (t, \minus{} 1)$ to the parabpla $ y \equal{} x^2$. Denote $ S(t)$ the area bounded by the tangents line and the parabola. Find the minimum value of $ \frac {S(t)}{\sqrt {t}}$.
A function $f:\mathbb N\to\mathbb N$, where $\mathbb N$ is the set of positive integers, satisfies the following condition: for any positive integers $m$ and $n$ ($m>n$) the number $f(m)-f(n)$ is divisible by $m-n$. Is the function $f$ necessarily a polynomial? (In other words, is it true that for any such function there exists a polynomial $p(x)$ with real coefficients such that $f(n)=p(n)$ for all positive integers $n$?) [i](Folklore)[/i]
Assume that $a$ is a given irrational number. (a) Prove that for each positive real number $\epsilon$ there exists at least one integer $q\ge0$ such that $aq-\lfloor aq\rfloor<\epsilon$. (b) Prove that for given $\epsilon>0$ there exist infinitely many rational numbers $\frac pq$ such that $q>0$ and $\left|a-\frac pq\right|<\frac\epsilon q$.
Define a sequence of functions recursively by $f_1(x) = |x-1|$ and $f_n(x)=f_{n-1}(|x-n|)$ for integers $n > 1$. Find the least value of $n$ such that the sum of the zeros of $f_n$ exceeds $500{,}000$.
An isosceles trapezoid has legs and shorter base of length $1$. Find the maximum possible value of its area
Let $x_1,x_2,...,x_n \in [0;1]$ prove that $x_1(1-x_2)+x_2(1-x_3)+...+x_{n-1}(1-x_n)+x_n(1-x_1) \leq [\frac{n}{2}]$
Suppose that $f : \mathbb{N} \rightarrow \mathbb{N}$ is a function for which the expression $af(a)+bf(b)+2ab$ for all $a,b \in \mathbb{N}$ is always a perfect square. Prove that $f(a)=a$ for all $a \in \mathbb{N}$.
Let $ f(n)$ be defined for $ n \in \mathbb{N}$ by $ f(1)\equal{}2$ and $ f(n\plus{}1)\equal{}f(n)^2\minus{}f(n)\plus{}1$ for $ n \ge 1$. Prove that for all $ n >1:$ $ 1\minus{}\frac{1}{2^{2^{n\minus{}1}}}<\frac{1}{f(1)}\plus{}\frac{1}{f(2)}\plus{}...\plus{}\frac{1}{f(n)}<1\minus{}\frac{1}{2^{2^n}}$
Let $\mathbb{R}^{+}$ be the set of positive real numbers. Find all real numbers $a$ for which there exists a function $f :\mathbb{R}^{+} \to \mathbb{R}^{+}$ such that $3(f(x))^{2}=2f(f(x))+ax^{4}$, for all $x \in \mathbb{R}^{+}$.
$f(x)=x^3-6x^2+17x$. If $f(a)=16, f(b)=20$, find $a+b$.
We denote by $\mathbb{R}^\plus{}$ the set of all positive real numbers. Find all functions $f: \mathbb R^ \plus{} \rightarrow\mathbb R^ \plus{}$ which have the property: \[f(x)f(y)\equal{}2f(x\plus{}yf(x))\] for all positive real numbers $x$ and $y$. [i]Proposed by Nikolai Nikolov, Bulgaria[/i]
Determine the value of $a,b$ for which $\int_0^1 (\sqrt{1-x}-ax-b)^2 dx$ is minimized.
Find all integer coefficient polynomial $P(x)$ such that for all positive integer $x$, we have $$\tau(P(x))\geq\tau(x)$$Where $\tau(n)$ denotes the number of divisors of $n$. Define $\tau(0)=\infty$. Note: you can use this conclusion. For all $\epsilon\geq0$, there exists a positive constant $C_\epsilon$ such that for all positive integer $n$, the $n$th smallest prime is at most $C_\epsilon n^{1+\epsilon}$. [i]Proposed by USJL[/i]
Let $ {\mathbb Q}^ \plus{}$ be the set of positive rational numbers. Construct a function $ f : {\mathbb Q}^ \plus{} \rightarrow {\mathbb Q}^ \plus{}$ such that \[ f(xf(y)) \equal{} \frac {f(x)}{y} \] for all $ x$, $ y$ in $ {\mathbb Q}^ \plus{}$.
For all natural numbers $n$, define $f(n) = \tau (n!) - \tau ((n-1)!)$, where $\tau(a)$ denotes the number of positive divisors of $a$. Prove that there exist infinitely many composite $n$, such that for all naturals $m < n$, we have $f(m) < f(n)$.
If $F(n)$ is a function such that $F(1)=F(2)=F(3)=1$, and such that $F(n+1)=\dfrac{F(n)\cdot F(n-1)+1}{F(n-2)}$ for $n\ge 3$, then $F(6)$ is equal to $\textbf{(A) }2\qquad\textbf{(B) }3\qquad\textbf{(C) }7\qquad\textbf{(D) }11\qquad \textbf{(E) }26$
Let be three positive integers $ a,b,c $ and a function $ f:\mathbb{N}\longrightarrow\mathbb{N} $ defined as $$ f(n)=\left\{ \begin{matrix} n-a, & n>c\\ f\left( f(n+b) \right) ,& n\le c \end{matrix} \right. . $$ Determine the number of fixed points this function has.
Let be the set $ \Lambda = \left\{ \lambda\in\text{Hol} \left[ \mathbb{C}\longrightarrow\mathbb{C} \right] |z\in\mathbb{C}\implies |\lambda (z)|\le e^{|\text{Im}(z)|} \right\} . $ Show that: $ \text{(1)}\sin\in\Lambda $ $ \text{(2)}\sum_{p\in\mathbb{Z}}\frac{1}{(1+2p)^2} =\frac{\pi^2}{4} $ $ \text{(3)} f\in\Lambda\implies \left| f'(0) \right|\le 1 $