Found problems: 4776
2018 Bangladesh Mathematical Olympiad, 7
[b]Evaluate[/b]
$\int^{\pi/2}_0 \frac{\cos^4x + \sin x \cos^3 x + \sin^2x\cos^2x + \sin^3x\cos x}{\sin^4x + \cos^4x + 2\ sinx\cos^3x + 2\sin^2x\cos^2x + 2\sin^3x\cos x} dx$
2013 Princeton University Math Competition, 4
Let $f(x)=1-|x|$. Let \begin{align*}f_n(x)&=(\overbrace{f\circ \cdots\circ f}^{n\text{ copies}})(x)\\g_n(x)&=|n-|x| |\end{align*} Determine the area of the region bounded by the $x$-axis and the graph of the function $\textstyle\sum_{n=1}^{10}f(x)+\textstyle\sum_{n=1}^{10}g(x).$
1994 IMO Shortlist, 3
Let $ S$ be the set of all real numbers strictly greater than −1. Find all functions $ f: S \to S$ satisfying the two conditions:
(a) $ f(x \plus{} f(y) \plus{} xf(y)) \equal{} y \plus{} f(x) \plus{} yf(x)$ for all $ x, y$ in $ S$;
(b) $ \frac {f(x)}{x}$ is strictly increasing on each of the two intervals $ \minus{} 1 < x < 0$ and $ 0 < x$.
1994 China Team Selection Test, 2
An $n$ by $n$ grid, where every square contains a number, is called an $n$-code if the numbers in every row and column form an arithmetic progression. If it is sufficient to know the numbers in certain squares of an $n$-code to obtain the numbers in the entire grid, call these squares a key.
[b]a.) [/b]Find the smallest $s \in \mathbb{N}$ such that any $s$ squares in an $n-$code $(n \geq 4)$ form a key.
[b]b.)[/b] Find the smallest $t \in \mathbb{N}$ such that any $t$ squares along the diagonals of an $n$-code $(n \geq 4)$ form a key.
1970 Putnam, A1
Show that the power series for the function
$$e^{ax} \cos bx,$$
where $a,b >0$, has either no zero coefficients or infinitely many zero coefficients.
2002 Romania National Olympiad, 4
Let $f:[0,1]\rightarrow [0,1]$ be a continuous and bijective function.
Describe the set:
\[A=\{f(x)-f(y)\mid x,y\in[0,1]\backslash\mathbb{Q}\}\]
[hide="Note"]
You are given the result that [i]there is no one-to-one function between the irrational numbers and $\mathbb{Q}$.[/i][/hide]
2010 Greece Team Selection Test, 4
Find all functions $ f:\mathbb{R^{\ast }}\rightarrow \mathbb{ R^{\ast }}$ satisfying $f(\frac{f(x)}{f(y)})=\frac{1}{y}f(f(x))$ for all $x,y\in \mathbb{R^{\ast }}$
and are strictly monotone in $(0,+\infty )$
2011 Mediterranean Mathematics Olympiad, 2
Let $A$ be a finite set of positive reals, let $B = \{x/y\mid x,y\in A\}$ and let $C = \{xy\mid x,y\in A\}$.
Show that $|A|\cdot|B|\le|C|^2$.
[i](Proposed by Gerhard Woeginger, Austria)[/i]
1965 Swedish Mathematical Competition, 4
Find constants $A > B$ such that $\frac{f\left( \frac{1}{1+2x}\right) }{f(x)}$ is independent of $x$, where $f(x) = \frac{1 + Ax}{1 + Bx}$ for all real $x \ne - \frac{1}{B}$. Put $a_0 = 1$, $a_{n+1} = \frac{1}{1 + 2a_n}$. Find an expression for an by considering $f(a_0), f(a_1), ...$.
2011 Iran MO (3rd Round), 5
Suppose that $n$ is a natural number. we call the sequence $(x_1,y_1,z_1,t_1),(x_2,y_2,z_2,t_2),.....,(x_s,y_s,z_s,t_s)$ of $\mathbb Z^4$ [b]good[/b] if it satisfies these three conditions:
[b]i)[/b] $x_1=y_1=z_1=t_1=0$.
[b]ii)[/b] the sequences $x_i,y_i,z_i,t_i$ be strictly increasing.
[b]iii)[/b] $x_s+y_s+z_s+t_s=n$. (note that $s$ may vary).
Find the number of good sequences.
[i]proposed by Mohammad Ghiasi[/i]
2006 Victor Vâlcovici, 3
Let be four functions $ f,g,s,i:\mathbb{N}\longrightarrow\mathbb{N} $ such that $ s(x)=\max (f(x),g(x)) $ and $ i(x)=\min (f(x),g(x)) , $ for any natural number $ x. $ Prove that $ f=g $ if $ s $ is surjective and $ i $ injective.
2010 Contests, 2
Let $n$ be a positive integer number and let $a_1, a_2, \ldots, a_n$ be $n$ positive real numbers. Prove that $f : [0, \infty) \rightarrow \mathbb{R}$, defined by
\[f(x) = \dfrac{a_1 + x}{a_2 + x} + \dfrac{a_2 + x}{a_3 + x} + \cdots + \dfrac{a_{n-1} + x}{a_n + x} + \dfrac{a_n + x}{a_1 + x}, \]
is a decreasing function.
[i]Dan Marinescu et al.[/i]
2004 IMO Shortlist, 3
Does there exist a function $s\colon \mathbb{Q} \rightarrow \{-1,1\}$ such that if $x$ and $y$ are distinct rational numbers satisfying ${xy=1}$ or ${x+y\in \{0,1\}}$, then ${s(x)s(y)=-1}$? Justify your answer.
[i]Proposed by Dan Brown, Canada[/i]
2009 IMO, 3
Suppose that $ s_1,s_2,s_3, \ldots$ is a strictly increasing sequence of positive integers such that the sub-sequences \[s_{s_1},\, s_{s_2},\, s_{s_3},\, \ldots\qquad\text{and}\qquad s_{s_1+1},\, s_{s_2+1},\, s_{s_3+1},\, \ldots\] are both arithmetic progressions. Prove that the sequence $ s_1, s_2, s_3, \ldots$ is itself an arithmetic progression.
[i]Proposed by Gabriel Carroll, USA[/i]
1968 IMO Shortlist, 1
Two ships sail on the sea with constant speeds and fixed directions. It is known that at $9:00$ the distance between them was $20$ miles; at $9:35$, $15$ miles; and at $9:55$, $13$ miles. At what moment were the ships the smallest distance from each other, and what was that distance ?
2011 Today's Calculation Of Integral, 715
Find the differentiable function $f(x)$ with $f(0)\neq 0$ satisfying $f(x+y)=f(x)f'(y)+f'(x)f(y)$ for all real numbers $x,\ y$.
2015 Canada National Olympiad, 1
Let $\mathbb{N} = \{1, 2, 3, \ldots\}$ be the set of positive integers. Find all functions $f$, defined on $\mathbb{N}$ and taking values in $\mathbb{N}$, such that $(n-1)^2< f(n)f(f(n)) < n^2+n$ for every positive integer $n$.
2001 IMO Shortlist, 4
Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$, satisfying \[
f(xy)(f(x) - f(y)) = (x-y)f(x)f(y)
\] for all $x,y$.
2006 Macedonia National Olympiad, 2
Determine all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that for all $x, y, z,$
\[f(x+y^2+z)=f(f(x))+yf(y)+f(z). \]
2019 CIIM, Problem 6
Determine all the injective functions $f : \mathbb{Z}_+ \to \mathbb{Z}_+$, such that for each pair of integers $(m, n)$ the following conditions hold:
$a)$ $f(mn) = f(m)f(n)$
$b)$ $f(m^2 + n^2) \mid f(m^2) + f(n^2).$
2007 USA Team Selection Test, 2
Let $n$ be a positive integer and let $a_1 \le a_2 \le \dots \le a_n$ and $b_1 \le b_2 \le \dots \le b_n$ be two nondecreasing sequences of real numbers such that
\[ a_1 + \dots + a_i \le b_1 + \dots + b_i \text{ for every } i = 1, \dots, n \]
and
\[ a_1 + \dots + a_n = b_1 + \dots + b_n. \]
Suppose that for every real number $m$, the number of pairs $(i,j)$ with $a_i-a_j=m$ equals the numbers of pairs $(k,\ell)$ with $b_k-b_\ell = m$. Prove that $a_i = b_i$ for $i=1,\dots,n$.
2019 AMC 10, 9
The function $f$ is defined by $$f(x) = \Big\lfloor \lvert x \rvert \Big\rfloor - \Big\lvert \lfloor x \rfloor \Big\rvert$$for all real numbers $x$, where $\lfloor r \rfloor$ denotes the greatest integer less than or equal to the real number $r$. What is the range of $f$?
$\textbf{(A) } \{-1, 0\} \qquad\textbf{(B) } \text{The set of nonpositive integers} \qquad\textbf{(C) } \{-1, 0, 1\}$
$\textbf{(D) } \{0\} \qquad\textbf{(E) } \text{The set of nonnegative integers} $
1966 Miklós Schweitzer, 6
A sentence of the following type if often heard in Hungarian weather reports: "Last night's minimum temperatures took all values between $ \minus{}3$ degrees and $ \plus{}5$ degrees." Show that it would suffice to say, "Both $ \minus{}3$ degrees and $ \plus{}5$ degrees occurred among last night's minimum temperatures." (Assume that temperature as a two-variable function of place and time is continuous.)
[i]A.Csaszar[/i]
1997 Brazil National Olympiad, 3
a) Show that there are no functions $f, g: \mathbb R \to \mathbb R$ such that $g(f(x)) = x^3$ and $f(g(x)) = x^2$ for all $x \in \mathbb R$.
b) Let $S$ be the set of all real numbers greater than 1. Show that there are functions $f, g : S \to S$ satsfying the condition above.
2020 March Advanced Contest, 4
Let \(\mathbb{Z}^2\) denote the set of points in the Euclidean plane with integer coordinates. Find all functions \(f : \mathbb{Z}^2 \to [0,1]\) such that for any point \(P\), the value assigned to \(P\) is the average of all the values assigned to points in \(\mathbb{Z}^2\) whose Euclidean distance from \(P\) is exactly 2020.