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

Let $ n > 1$ be a fixed integer. Define functions $ f_0(x) \equal{} 0,$ $ f_1(x) \equal{} 1 \minus{} \cos(x),$ and for $ k > 0,$ \[ f_{k\plus{}1}(x) \equal{} f_k(x) \cdot \cos(x) \minus{} f_{k\minus{}1}(x).\] If $ F(x) \equal{} \sum^n_{r\equal{}1} f_r(x),$ prove that [b](a)[/b] $ 0 < F(x) < 1$ for $ 0 < x < \frac{\pi}{n\plus{}1},$ and [b](b)[/b] $ F(x) > 1$ for $ \frac{\pi}{n\plus{}1} < x < \frac{\pi}{n}.$
$f$ is a continuous real-valued function such that $f(x+y)=f(x)f(y)$ for all real $x$, $y$. If $f(2)=5$, find $f(5)$.
Let $f : \mathbb{N} \to \mathbb{N}$ be a function such that the following conditions hold: $\qquad\ (1) \; f(1) = 1.$ $\qquad\ (2) \; \dfrac{(x + y)}{2} < f(x + y) \le f(x) + f(y) \; \forall \; x, y \in \mathbb{N}.$ $\qquad\ (3) \; f(4n + 1) < 2f(2n + 1) \; \forall \; n \ge 0.$ $\qquad\ (4) \; f(4n + 3) \le 2f(2n + 1) \; \forall \; n \ge 0.$ Find the sum of all possible values of $f(2023)$.
Let $\alpha$ be given positive real number, find all the functions $f: N^{+} \rightarrow R$ such that $f(k + m) = f(k) + f(m)$ holds for any positive integers $k$, $m$ satisfying $\alpha m \leq k \leq (\alpha + 1)m$.
Find all functions $f: [0, +\infty) \to [0, +\infty)$ satisfying the equation \[(y+1)f(x+y) = f\left(xf(y)\right)\] For all non-negative real numbers $x$ and $y.$
Figures $ 0$, $ 1$, $ 2$, and $ 3$ consist of $ 1$, $ 5$, $ 13$, and $ 25$ nonoverlapping squares, respectively. If the pattern were continued, how many nonoverlapping squares would there be in figure $ 100$? [asy] unitsize(8); draw((0,0)--(1,0)--(1,1)--(0,1)--cycle); draw((9,0)--(10,0)--(10,3)--(9,3)--cycle); draw((8,1)--(11,1)--(11,2)--(8,2)--cycle); draw((19,0)--(20,0)--(20,5)--(19,5)--cycle); draw((18,1)--(21,1)--(21,4)--(18,4)--cycle); draw((17,2)--(22,2)--(22,3)--(17,3)--cycle); draw((32,0)--(33,0)--(33,7)--(32,7)--cycle); draw((29,3)--(36,3)--(36,4)--(29,4)--cycle); draw((31,1)--(34,1)--(34,6)--(31,6)--cycle); draw((30,2)--(35,2)--(35,5)--(30,5)--cycle); label("Figure",(0.5,-1),S); label("$0$",(0.5,-2.5),S); label("Figure",(9.5,-1),S); label("$1$",(9.5,-2.5),S); label("Figure",(19.5,-1),S); label("$2$",(19.5,-2.5),S); label("Figure",(32.5,-1),S); label("$3$",(32.5,-2.5),S);[/asy]$ \textbf{(A)}\ 10401 \qquad \textbf{(B)}\ 19801 \qquad \textbf{(C)}\ 20201 \qquad \textbf{(D)}\ 39801 \qquad \textbf{(E)}\ 40801$
[b]a)[/b] prove that the function $\zeta(s)=\sum_{n=1}^\infty\frac{1}{n^s}$ that is defined on the area $Re(s)>1$, is an analytic function. [b]b)[/b] prove that the function $\zeta(s)-\frac{1}{s-1}$ can be spanned to an analytic function over $\mathbb C$. [b]c)[/b] using the span of part [b]b[/b] show that $\zeta(1-n)=-\frac{B_n}{n}$ that $B_n$ is the $n$th bernoli number that is defined by generating function $\frac{t}{e^t-1}=\sum_{n=0}^{\infty}B_n\frac{t^n}{n!}$.
Find all functions $f,g,h: \mathbb{R} \mapsto \mathbb{R}$ such that $f(x) - g(y) = (x-y) \cdot h(x+y)$ for $x,y \in \mathbb{R}.$
Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$, such that for arbitrary $x,y \in \mathbb{R}$: \[ (y+1)f(x)+f(xf(y)+f(x+y))=y.\]
Is there a real interval $ I $ for which there exists a primitivable function $ f:I\longrightarrow I $ with the property that $ (f\circ f) (x)=-x, $ for all $ x\in I $ ?
Determine all functions $f : \mathbb{R} \to \mathbb{R}$ satisfying \[ f(a^2) - f(b^2) \leq (f(a)+b)(a-f(b)) \] for all $a,b \in \mathbb{R}$.
Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ satisfying \[f(x+f(y))=x+f(f(y))\] for all real numbers $x$ and $y$, with the additional constraint $f(2004)=2005$.
Zeroes and ones are arranged in all the squares of $n\times n$ table. All the squares of the left column are filled by ones, and the sum of numbers in every figure of the form [asy]size(50); draw((2,1)--(0,1)--(0,2)--(2,2)--(2,0)--(1,0)--(1,2));[/asy] (consisting of a square and its neighbours from left and from below) is even. Prove that no two rows of the table are identical. [i]Proposed by O. Vanyushina[/i]
Find all functions $ f : \mathbb{R}\to\mathbb{R}$ that satisfy \[ f (x^{3} \plus{} y^{3}) \equal{} x^{2}f (x) \plus{} yf (y^{2}) \] for all $ x, y \in\mathbb R.$
An infinite table whose rows and columns are numbered with positive integers, is given. For a sequence of functions $f_1(x), f_2(x), \ldots $ let us place the number $f_i(j)$ into the cell $(i,j)$ of the table (for all $i, j\in \mathbb{N}$). A sequence $f_1(x), f_2(x), \ldots $ is said to be {\it nice}, if all the numbers in the table are positive integers, and each positive integer appears exactly once. Determine if there exists a nice sequence of functions $f_1(x), f_2(x), \ldots $, such that each $f_i(x)$ is a polynomial of degree 101 with integer coefficients and its leading coefficient equals to 1.
A magician has one hundred cards numbered 1 to 100. He puts them into three boxes, a red one, a white one and a blue one, so that each box contains at least one card. A member of the audience draws two cards from two different boxes and announces the sum of numbers on those cards. Given this information, the magician locates the box from which no card has been drawn. How many ways are there to put the cards in the three boxes so that the trick works?
Find all functions $f : \mathbb R \to \mathbb R$ such that the equality \[y^2f(x) + x^2f(y) + xy = xyf(x + y) + x^2 + y^2\] holds for all $x, y \in \Bbb R$, where $\Bbb R$ is the set of real numbers.
Let $\mathcal{F}$ be the set of continuous functions $f : [0, 1]\to\mathbb{R}$ satisfying $\max_{0\le x\le 1} |f(x)| = 1$ and let $I : \mathcal{F} \to \mathbb{R}$, \[I(f) = \int_0^1 f(x)\, \text{d}x - f(0) + f(1).\] a) Show that $I(f) < 3$, for any $f \in \mathcal{F}$. b) Determine $\sup\{I(f) \mid f \in \mathcal{F}\}$.
Find all functions $f : \mathbb{Z} \to \mathbb{Z}$ such that $(f(x + y))^2 = f(x^2) + f(y^2)$ for all $x, y \in \mathbb{Z}$.
Find all functions $f: \mathbb{Z}\to \mathbb{Z}$ such that for all $m,n\in \mathbb{Z}$: \[f(m+f(n)) = f(m)+n.\]
Find all functions $f: \mathbb{Q}[x] \to \mathbb{R}$ such that: (a) for all $P, Q \in \mathbb{Q}[x]$, $f(P \circ Q) = f(Q \circ P);$ (b) for all $P, Q \in \mathbb{Q}[x]$ with $PQ \neq 0$, $f(P\cdot Q) = f(P) + f(Q).$ ($P \circ Q$ indicates $P(Q(x))$.)
The first two terms of a sequence are $ a_1 \equal{} 1$ and $ a_2 \equal{} \frac {1}{\sqrt3}$. For $ n\ge1$, \[ a_{n \plus{} 2} \equal{} \frac {a_n \plus{} a_{n \plus{} 1}}{1 \minus{} a_na_{n \plus{} 1}}. \]What is $ |a_{2009}|$? $ \textbf{(A)}\ 0\qquad \textbf{(B)}\ 2 \minus{} \sqrt3\qquad \textbf{(C)}\ \frac {1}{\sqrt3}\qquad \textbf{(D)}\ 1\qquad \textbf{(E)}\ 2 \plus{} \sqrt3$
Calculate \[T = \sum \frac{1}{n_1! \cdot n_2! \cdot \cdots n_{1994}! \cdot (n_2 + 2 \cdot n_3 + 3 \cdot n_4 + \ldots + 1993 \cdot n_{1994})!}\] where the sum is taken over all 1994-tuples of the numbers $n_1, n_2, \ldots, n_{1994} \in \mathbb{N} \cup \{0\}$ satisfying $n_1 + 2 \cdot n_2 + 3 \cdot n_3 + \ldots + 1994 \cdot n_{1994} = 1994.$
Prove that there exists a positive real number $C$ with the following property: for any integer $n\ge 2$ and any subset $X$ of the set $\{1,2,\ldots,n\}$ such that $|X|\ge 2$, there exist $x,y,z,w \in X$(not necessarily distinct) such that \[0<|xy-zw|<C\alpha ^{-4}\] where $\alpha =\frac{|X|}{n}$.
Given an integer $n\ge 2$, a function $f:\mathbb{Z}\rightarrow \{1,2,\ldots,n\}$ is called [i]good[/i], if for any integer $k,1\le k\le n-1$ there exists an integer $j(k)$ such that for every integer $m$ we have \[f(m+j(k))\equiv f(m+k)-f(m) \pmod{n+1}. \] Find the number of [i]good[/i] functions.