Olympiad problems

1991 IberoAmerican, 3

Tags: algebra , function

Let $f: \ [0,\ 1] \rightarrow \mathbb{R}$ be an increasing function satisfying the following conditions: a) $f(0)=0$; b) $f\left(\frac{x}{3}\right)=\frac{f(x)}{2}$; c) $f(1-x)=1-f(x)$. Determine $f\left(\frac{18}{1991}\right)$.

2014 PUMaC Individual Finals A, 2

Tags: algebra , function , hmmt , inequalities , polynomial

Given $a,b,c \in\mathbb{R}^+$, and that $a^2+b^2+c^2=3$. Prove that \[ \frac{1}{a^3+2}+\frac{1}{b^3+2}+\frac{1}{c^3+2}\ge 1 \]

2001 Junior Balkan Team Selection Tests - Romania, 1

Tags: logarithm , function , geometry

Let $ABCD$ be a rectangle. We consider the points $E\in CA,F\in AB,G\in BC$ such that $DC\perp CA,EF\perp AB$ and $EG\perp BC$. Solve in the set of rational numbers the equation $AC^x=EF^x+EG^x$.

2012 Romania National Olympiad, 1

Tags: real analysis , function , integration

[color=darkred]Let $f\colon [0,\infty)\to\mathbb{R}$ be a continuous function such that $\int_0^nf(x)f(n-x)\ \text{d}x=\int_0^nf^2(x)\ \text{d}x$ , for any natural number $n\ge 1$ . Prove that $f$ is a periodic function.[/color]

2011 Romanian Masters In Mathematics, 2

Tags: number theory , greatest common divisor , polynomial , modular arithmetic , algebra , function , system of equations

Determine all positive integers $n$ for which there exists a polynomial $f(x)$ with real coefficients, with the following properties: (1) for each integer $k$, the number $f(k)$ is an integer if and only if $k$ is not divisible by $n$; (2) the degree of $f$ is less than $n$. [i](Hungary) Géza Kós[/i]

2025 Vietnam Team Selection Test, 1

Tags: algebra , fe , functional equation , function

Find all functions $f: \mathbb{Q}^+ \to \mathbb{Q}^+$ such that $$\dfrac{f(x)f(y)}{f(xy)} = \dfrac{\left( \sqrt{f(x)} + \sqrt{f(y)} \right)^2}{f(x+y)}$$ holds for all positive rational numbers $x, y$.

2008 Grigore Moisil Intercounty, 3

Tags: inequalities , integration , calculus , function

Let $ f[0,\infty )\longrightarrow\mathbb{R} $ be a convex and differentiable function with $ f(0)=0. $ [b]a)[/b] Prove that $ \int_0^x f(t)dt\le \frac{x^2}{2}f'(x) , $ for any nonnegative $ x. $ [b]b)[/b] Determine $ f $ if the above inequality is actually an equality. [i]Dorin Andrica[/i] and [i]Mihai Piticari[/i]

2016 Mathematical Talent Reward Programme, SAQ: P 5

Tags: injective function , surjective function , function

Let $\mathbb{N}$ be the set of all positive integers. $f,g:\mathbb{N} \to \mathbb{N}$ be funtions such that $f$ is onto and $g$ is one-one and $f(n)\geq g(n)$ for all positive integers $n$. Prove that $f=g$.

2007 Romania Team Selection Test, 3

Tags: ratio , polynomial , induction , function , algebra

The problem is about real polynomial functions, denoted by $f$, of degree $\deg f$. a) Prove that a polynomial function $f$ can`t be wrriten as sum of at most $\deg f$ periodic functions. b) Show that if a polynomial function of degree $1$ is written as sum of two periodic functions, then they are unbounded on every interval (thus, they are "wild"). c) Show that every polynomial function of degree $1$ can be written as sum of two periodic functions. d) Show that every polynomial function $f$ can be written as sum of $\deg f+1$ periodic functions. e) Give an example of a function that can`t be written as a finite sum of periodic functions. [i]Dan Schwarz[/i]

2013 Stanford Mathematics Tournament, 7

Tags: function , derivative , calculus , integration

The function $f(x)$ has the property that, for some real positive constant $C$, the expression \[\frac{f^{(n)}(x)}{n+x+C}\] is independent of $n$ for all nonnegative integers $n$, provided that $n+x+C\neq 0$. Given that $f'(0)=1$ and $\int_{0}^{1}f(x) \, dx = C+(e-2)$, determine the value of $C$. Note: $f^{(n)}(x)$ is the $n$-th derivative of $f(x)$, and $f^{(0)}(x)$ is defined to be $f(x)$.

2005 Harvard-MIT Mathematics Tournament, 8

Tags: function

Compute \[ \displaystyle\sum_{n=0}^{\infty} \dfrac {n}{n^4 + n^2 + 1}. \]

2004 National High School Mathematics League, 8

Tags: algebra , function , functional equation

Function $f:\mathbb{R}\to\mathbb{R}$, satisfies that $f(0)=1$, and $f(xy+1)=f(x)f(y)-f(y)-x+2$, then $f(x)=$________.

1999 Bosnia and Herzegovina Team Selection Test, 3

Tags: algebra , injective , function

Let $f : [0,1] \rightarrow \mathbb{R}$ be injective function such that $f(0)+f(1)=1$. Prove that exists $x_1$, $x_2 \in [0,1]$, $x_1 \neq x_2$ such that $2f(x_1)<f(x_2)+\frac{1}{2}$. After that state at least one generalization of this result

2000 Korea - Final Round, 2

Tags: algebra , function

Determine all function $f$ from the set of real numbers to itself such that for every $x$ and $y$, \[f(x^2-y^2)=(x-y)(f(x)+f(y))\]

2009 Princeton University Math Competition, 8

Tags: function

Find the number of functions $f:\mathbb{Z}\mapsto\mathbb{Z}$ for which $f(h+k)+f(hk)=f(h)f(k)+1$, for all integers $h$ and $k$.

2024 Kazakhstan National Olympiad, 3

Tags: function , algebra , functional equation

Find all functions $f: \mathbb R^+ \to \mathbb R^+$ such that \[ f \left( x+\frac{f(xy)}{x} \right) = f(xy) f \left( y + \frac 1y \right) \] holds for all $x,y\in\mathbb R^+.$

1991 Arnold's Trivium, 98

Tags: probability , function

In the game of "Fingers", $N$ players stand in a circle and simultaneously thrust out their right hands, each with a certain number of fingers showing. The total number of fingers shown is counted out round the circle from the leader, and the player on whom the count stops is the winner. How large must $N$ be for a suitably chosen group of $N/10$ players to contain a winner with probability at least $0.9$? How does the probability that the leader wins behave as $N\to\infty$?

1994 Putnam, 6

Tags: function

Let $f_1,f_2,\cdots ,f_{10}$ be bijections on $\mathbb{Z}$ such that for each integer $n$, there is some composition $f_{\ell_1}\circ f_{\ell_2}\circ \cdots \circ f_{\ell_m}$ (allowing repetitions) which maps $0$ to $n$. Consider the set of $1024$ functions \[ \mathcal{F}=\{f_1^{\epsilon_1}\circ f_2^{\epsilon_2}\circ \cdots \circ f_{10}^{\epsilon_{10}}\} \] where $\epsilon _i=0$ or $1$ for $1\le i\le 10.\; (f_i^{0}$ is the identity function and $f_i^1=f_i)$. Show that if $A$ is a finite set of integers then at most $512$ of the functions in $\mathcal{F}$ map $A$ into itself.

2012 Today's Calculation Of Integral, 830

Tags: calculus computations , calculus , logarithm , limit , function , integration

Find $\lim_{n\to\infty} \frac{1}{(\ln n)^2}\sum_{k=3}^n \frac{\ln k}{k}.$

PEN K Problems, 29

Tags: function , functional equation , induction

Find all functions $ f: \mathbb{Z}\setminus\{0\}\to \mathbb{Q}$ such that for all $ x,y \in \mathbb{Z}\setminus\{0\}$: \[ f \left( \frac{x+y}{3}\right) =\frac{f(x)+f(y)}{2}, \; \; x, y \in \mathbb{Z}\setminus\{0\}\]

2014 South africa National Olympiad, 4

Tags: function , least common multiple , number theory

(a) Let $a,x,y$ be positive integers. Prove: if $x\ne y$, the also \[ax+\gcd(a,x)+\text{lcm}(a,x)\ne ay+\gcd(a,y)+\text{lcm}(a,y).\] (b) Show that there are no two positive integers $a$ and $b$ such that \[ab+\gcd(a,b)+\text{lcm}(a,b)=2014.\]

2005 Taiwan TST Round 3, 3

Tags: combinatorics , function

The set $\{1,2,\dots\>,n\}$ is called $P$. The function $f: P \to \{1,2,\dots\>,m\}$ satisfies \[f(A\cap B)=\min (f(A), f(B)).\] What is the relationship between the number of possible functions $f$ with the sum $\displaystyle \sum_{j=1}^m j^n$? There is a nice and easy solution to this. Too bad I did not think of it...

2016 Romania National Olympiad, 1

Tags: algebra , calculus , function

Let be a natural number $ n\ge 2 $ and $ n $ positive real numbers $ a_1,a_2,\ldots ,a_n $ whose product is $ 1. $ Prove that the function $ f:\mathbb{R}_{>0}\longrightarrow\mathbb{R} ,\quad f(x)=\prod_{i=1}^n \left( 1+a_i^x \right) , $ is nondecreasing.

1977 Miklós Schweitzer, 9

Tags: function , real analysis , vector , integration

Suppose that the components of he vector $ \textbf{u}=(u_0,\ldots,u_n)$ are real functions defined on the closed interval $ [a,b]$ with the property that every nontrivial linear combination of them has at most $ n$ zeros in $ [a,b]$. Prove that if $ \sigma$ is an increasing function on $ [a,b]$ and the rank of the operator \[ A(f)= \int_{a}^b \textbf{u}(x)f(x)d\sigma(x), \;f \in C[a,b]\ ,\] is $ r \leq n$, then $ \sigma$ has exactly $ r$ points of increase. [i]E. Gesztelyi[/i]

2015 AMC 12/AHSME, 18

Tags: function , prime factorization , number theory

For every composite positive integer $n$, define $r(n)$ to be the sum of the factors in the prime factorization of $n$. For example, $r(50)=12$ because the prime factorization of $50$ is $ 2 \cdot 5^2 $, and $ 2 + 5 + 5 = 12 $. What is the range of the function $r$, $ \{ r(n) : n \ \text{is a composite positive integer} \} $? [b](A)[/b] the set of positive integers [b](B)[/b] the set of composite positive integers [b](C)[/b] the set of even positive integers [b](D)[/b] the set of integers greater than 3 [b](E)[/b] the set of integers greater than 4