Olympiad problems

2018 Korea Winter Program Practice Test, 1

Find all functions $f : \mathbb{R} \rightarrow \mathbb{R}$ satisfying the following conditions : 1) $f(x+y)-f(x)-f(y) \in \{0,1\} $ for all $x,y \in \mathbb{R}$ 2) $\lfloor f(x) \rfloor = \lfloor x \rfloor $ for all real $x$.

1984 AIME Problems, 12

Tags: function , modular arithmetic , floor function , geometry , geometric transformation , reflection

A function $f$ is defined for all real numbers and satisfies \[f(2 + x) = f(2 - x)\qquad\text{and}\qquad f(7 + x) = f(7 - x)\] for all real $x$. If $x = 0$ is a root of $f(x) = 0$, what is the least number of roots $f(x) = 0$ must have in the interval $-1000 \le x \le 1000$?

1976 IMO Longlists, 29

Tags: floor function , function , algebra , iteration , interval

Let $I = (0, 1]$ be the unit interval of the real line. For a given number $a \in (0, 1)$ we define a map $T : I \to I$ by the formula if \[ T (x, y) = \begin{cases} x + (1 - a),&\mbox{ if } 0< x \leq a,\\ \text{ } \\ x - a, & \mbox{ if } a < x \leq 1.\end{cases} \] Show that for every interval $J \subset I$ there exists an integer $n > 0$ such that $T^n(J) \cap J \neq \emptyset.$

2000 IMO Shortlist, 1

Tags: function , arithmetic sequence , combinatorics , set partition

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?

1974 Miklós Schweitzer, 6

Tags: induction , function , integration , limit , logarithm , real analysis

Let $ f(x)\equal{}\sum_{n\equal{}1}^{\infty} a_n/(x\plus{}n^2), \;(x \geq 0)\ ,$ where $ \sum_{n\equal{}1}^{\infty} |a_n|n^{\minus{} \alpha} < \infty$ for some $ \alpha > 2$. Let us assume that for some $ \beta > 1/{\alpha}$, we have $ f(x)\equal{}O(e^{\minus{}x^{\beta}})$ as $ x \rightarrow \infty$. Prove that $ a_n$ is identically $ 0$. [i]G. Halasz[/i]

1955 AMC 12/AHSME, 10

Tags: calculus , function , analytic geometry , graphing lines , slope

How many hours does it take a train traveling at an average rate of $ 40$ mph between stops to travel $ a$ miles it makes $ n$ stops of $ m$ minutes each? $ \textbf{(A)}\ \frac{3a\plus{}2mn}{120} \qquad \textbf{(B)}\ 3a\plus{}2mn \qquad \textbf{(C)}\ \frac{3a\plus{}2mn}{12} \qquad \textbf{(D)}\ \frac{a\plus{}mn}{40} \qquad \textbf{(E)}\ \frac{a\plus{}40mn}{40}$

2012 India IMO Training Camp, 3

Tags: function , inequalities , induction , algebra

Let $\mathbb{R}^{+}$ denote the set of all positive real numbers. Find all functions $f:\mathbb{R}^{+}\longrightarrow \mathbb{R}$ satisfying \[f(x)+f(y)\le \frac{f(x+y)}{2}, \frac{f(x)}{x}+\frac{f(y)}{y}\ge \frac{f(x+y)}{x+y},\] for all $x, y\in \mathbb{R}^{+}$.

1995 Brazil National Olympiad, 2

Tags: function , group theory , abstract algebra , number theory

Find all real-valued functions on the positive integers such that $f(x + 1019) = f(x)$ for all $x$, and $f(xy) = f(x) f(y)$ for all $x,y$.

2013 ELMO Shortlist, 9

Tags: function , logarithm , inequalities

Let $a, b, c$ be positive reals, and let $\sqrt[2013]{\frac{3}{a^{2013}+b^{2013}+c^{2013}}}=P$. Prove that \[\prod_{\text{cyc}}\left(\frac{(2P+\frac{1}{2a+b})(2P+\frac{1}{a+2b})}{(2P+\frac{1}{a+b+c})^2}\right)\ge \prod_{\text{cyc}}\left(\frac{(P+\frac{1}{4a+b+c})(P+\frac{1}{3b+3c})}{(P+\frac{1}{3a+2b+c})(P+\frac{1}{3a+b+2c})}\right).\][i]Proposed by David Stoner[/i]

1979 Austrian-Polish Competition, 4

Tags: functional equation , function , algebra

Determine all functions $f : N_0 \to R$ satisfying $f (x+y)+ f (x-y)= f (3x)$ for all $x,y$.

2012 China Second Round Olympiad, 9

Tags: function , trigonometry , inequalities , algebra

Given a function $f(x)=a\sin x-\frac{1}{2}\cos 2x+a-\frac{3}{a}+\frac{1}{2}$, where $a\in\mathbb{R}, a\ne 0$. [b](1)[/b] If for any $x\in\mathbb{R}$, inequality $f(x)\le 0$ holds, find all possible value of $a$. [b](2)[/b] If $a\ge 2$, and there exists $x\in\mathbb{R}$, such that $f(x)\le 0$. Find all possible value of $a$.

2022 Taiwan Mathematics Olympiad, 3

Tags: function , algebra

Find all functions $f,g:\mathbb{R}^2\to\mathbb{R}$ satisfying that \[|f(a,b)-f(c,d)|+|g(a,b)-g(c,d)|=|a-c|+|b-d|\] for all real numbers $a,b,c,d$. [i]Proposed by usjl[/i]

2009 Turkey Team Selection Test, 1

Tags: function , algorithm , number theory , euclidean algorithm , continued fraction , algebra , functional equation

Find all $ f: Q^ \plus{} \to\ Z$ functions that satisfy $ f \left(\frac {1}{x} \right) \equal{} f(x)$ and $ (x \plus{} 1)f(x \minus{} 1) \equal{} xf(x)$ for all rational numbers that are bigger than 1.

VII Soros Olympiad 2000 - 01, 11.1

Tags: function , periodic function , periodicity

Prove that for any $a$ the function $y (x) = \cos (\cos x) + a \cdot \sin (\sin x)$ is periodic. Find its smallest period in terms of $a$.

1990 IMO Longlists, 93

Tags: function , algebra , functional equation , number theory

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{}$.

2006 District Olympiad, 4

Tags: inequalities , integration , function , real analysis

Let $\mathcal F = \{ f: [0,1] \to [0,\infty) \mid f$ continuous $\}$ and $n$ an integer, $n\geq 2$. Find the smallest real constant $c$ such that for any $f\in \mathcal F$ the following inequality takes place \[ \int^1_0 f \left( \sqrt [n] x \right) dx \leq c \int^1_0 f(x) dx. \]

2010 ELMO Shortlist, 1

Tags: function , induction , algebra

Determine all strictly increasing functions $f: \mathbb{N}\to\mathbb{N}$ satisfying $nf(f(n))=f(n)^2$ for all positive integers $n$. [i]Carl Lian and Brian Hamrick.[/i]

1983 Iran MO (2nd round), 1

Tags: function , algebra

Let $f, g : \mathbb R \to \mathbb R$ be two functions such that $g\circ f : \mathbb R \to \mathbb R$ is an injective function. Prove that $f$ is also injective.

1964 Miklós Schweitzer, 6

Tags: function , integration , real analysis

Let $ y_1(x)$ be an arbitrary, continuous, positive function on $ [0,A]$, where $ A$ is an arbitrary positive number. Let \[ y_{n+1}=2 \int_0^x \sqrt{y_n(t)}dt \;(n=1,2,...)\ .\] Prove that the functions $ y_n(x)$ converge to the function $ y=x^2$ uniformly on $ [0,A]$.

2016 Bundeswettbewerb Mathematik, 3

Tags: function , algebra , functional equation

Find all functions $f$ that is defined on all reals but $\tfrac13$ and $- \tfrac13$ and satisfies \[ f \left(\frac{x+1}{1-3x} \right) + f(x) = x \] for all $x \in \mathbb{R} \setminus \{ \pm \tfrac13 \}$.

1998 Slovenia National Olympiad, Problem 2

Tags: function , algebra

find all functions $f(x)$ satisfying: $(\forall x\in R) f(x)+xf(1-x)=x^2+1$

2010 Contests, 1

Tags: vector , analytic geometry , function , combinatorics

There are ten coins a line, which are indistinguishable. It is known that two of them are false and have consecutive positions on the line. For each set of positions, you may ask how many false coins it contains. Is it possible to identify the false coins by making only two of those questions, without knowing the answer to the first question before making the second?

2024 Middle European Mathematical Olympiad, 2

Tags: function , algebra , functional equation

Find all functions $f:\mathbb{R} \to \mathbb{R}$ such that \[yf(x+1)=f(x+y-f(x))+f(x)f(f(y))\] for all $x,y \in \mathbb{R}$.

2003 China Team Selection Test, 3

Tags: function , combinatorics

Let $A= \{a_1,a_2, \cdots, a_n \}$ and $B=\{b_1,b_2 \cdots, b_n \}$ be two positive integer sets and $|A \cap B|=1$. $C= \{ \text{all the 2-element subsets of A} \} \cup \{ \text{all the 2-element subsets of B} \}$. Function $f: A \cup B \to \{ 0, 1, 2, \cdots 2 C_n^2 \}$ is injective. For any $\{x,y\} \in C$, denote $|f(x)-f(y)|$ as the $\textsl{mark}$ of $\{x,y\}$. If $n \geq 6$, prove that at least two elements in $C$ have the same $\textsl{mark}$.

2010 China Team Selection Test, 1

Tags: inequalities , induction , function , combinatorics

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!$.