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 $ 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]
Find all functions $ f : \mathbb{R}\to\mathbb{R}$ satisfying following conditions. (a) $ f(x) \ge 0 $ for all $ x \in \mathbb{R} $. (b) For $ a, b, c, d \in \mathbb{R} $ with $ ab + bc + cd = 0 $, equality $ f(a-b) + f(c-d) = f(a) + f(b+c) + f(d) $ holds.
Find all functions $f:\mathbb{Q}\rightarrow\mathbb{Q}$ such that\[f(x)+f(t)=f(y)+f(z)\]for all rational numbers $x<y<z<t$ that form an arithmetic progression. ($\mathbb{Q}$ is the set of all rational numbers.)
For every natural number $n$ we define $f(n)$ by the following rule: $f(1) = 1$ and for $n>1$ then $f(n) = 1 + a_1 \cdot p_1 + \ldots + a_k \cdot p_k$, where $n = p_1^{a_1} \cdots p_k^{a_k}$ is the canonical prime factorisation of $n$ ($p_1, \ldots, p_k$ are distinct primes and $a_1, \ldots, a_k$ are positive integers). For every positive integer $s$, let $f_s(n) = f(f(\ldots f(n))\ldots)$, where on the right hand side there are exactly $s$ symbols $f$. Show that for every given natural number $a$, there is a natural number $s_0$ such that for all $s > s_0$, the sum $f_s(a) + f_{s-1}(a)$ does not depend on $s$.
Prove that for any positive integer $ n$, there exists only $ n$ degree polynomial $ f(x),$ satisfying $ f(0) \equal{} 1$ and $ (x \plus{} 1)[f(x)]^2 \minus{} 1$ is an odd function.
Given positive integers $m$ and $n$, prove that there is a positive integer $c$ such that the numbers $cm$ and $cn$ have the same number of occurrences of each non-zero digit when written in base ten.
Find the Green's function of the operator $d^2/dx^2-1$ and solve the equation \[\int_{-\infty}^{+\infty}e^{-|x-y|}u(y)dy=e^{-x^2}\]
Find the distance of the centre of gravity of a uniform $100$-dimensional solid hemisphere of radius $1$ from the centre of the sphere with $10\%$ relative error.
Find all functions $f$ defined for all $x$ that satisfy the condition $xf(y) + yf(x) = (x + y)f(x)f(y),$ for all $x$ and $y.$ Prove that exactly two of them are continuous.
Let $f$ be a polynomial function with integer coefficients and $p$ be a prime number. Suppose there are at least four distinct integers satisfying $f(x) = p$. Show that $f$ does not have integer zeros.
Find all functions $f:\mathbb{Z}_{>0}\mapsto\mathbb{Z}_{>0}$ such that $$xf(x)+(f(y))^2+2xf(y)$$ is perfect square for all positive integers $x,y$. **This problem was proposed by me for the BMO 2017 and it was shortlisted. We then used it in our TST.
Find the minimum value of \[|\sin{x} + \cos{x} + \tan{x} + \cot{x} + \sec{x} + \csc{x}|\] for real numbers $x$.
For integers $a,b$ we define $f((a,b))=(2a,b-a)$ if $a<b$ and $f((a,b))=(a-b,2b)$ if $a\geq b$. Given a natural number $n>1$ show that there exist natural numbers $m,k$ with $m<n$ such that $f^{k}((n,m))=(m,n)$,where $f^{k}(x)=f(f(f(...f(x))))$,$f$ being composed with itself $k$ times.
Consider the polynomials $P\left(x\right)=16x^4+40x^3+41x^2+20x+16$ and $Q\left(x\right)=4x^2+5x+2$. If $a$ is a real number, what is the smallest possible value of $\frac{P\left(a\right)}{Q\left(a\right)}$? [i]2016 CCA Math Bonanza Team #6[/i]
Let $f (n)$ be a function satisfying the following three conditions for all positive integers $n$: (a) $f (n)$ is a positive integer, (b) $f (n + 1) > f (n)$, (c) $f ( f (n)) = 3n$. Find $f (2001)$.
Let $f(x)=1+\dfrac{x}{2}+\dfrac{x^2}{4}+\dfrac{x^3}{8}+\cdots,$ for $-1\leq x \leq 1$. Find $\sqrt{e^{\int\limits_0^1 f(x)dx}}$.
The function $ x^2 \plus{} px \plus{} q$ with $ p$ and $ q$ greater than zero has its minimum value when: $ \textbf{(A)}\ x \equal{} \minus{} p \qquad\textbf{(B)}\ x \equal{} \frac {p}{2} \qquad\textbf{(C)}\ x \equal{} \minus{} 2p \qquad\textbf{(D)}\ x \equal{} \frac {p^2}{4q} \qquad\textbf{(E)}\ x \equal{} \frac { \minus{} p}{2}$
Find all $a\in\mathbb{R}$ for which there exists a non-constant function $f: (0,1]\rightarrow\mathbb{R}$ such that \[a+f(x+y-xy)+f(x)f(y)\leq f(x)+f(y)\] for all $x,y\in(0,1].$
An angle $x$ is chosen at random from the interval $0^\circ < x < 90^\circ$. Let $p$ be the probability that the numbers $\sin^2 x$, $\cos^2 x$, and $\sin x \cos x$ are not the lengths of the sides of a triangle. Given that $p = d/n$, where $d$ is the number of degrees in $\arctan m$ and $m$ and $n$ are positive integers with $m + n < 1000$, find $m + n$.
The smallest value of $x^2+8x$ for real values of $x$ is: $\textbf{(A) }-16.25\qquad\textbf{(B) }-16\qquad\textbf{(C) }-15\qquad\textbf{(D) }-8\qquad \textbf{(E) }\text{None of these}$
Let \(\mathcal{F}\) be a family of functions from \(\mathbb{R}^+ \to \mathbb{R}^+\). It is known that for all \( f, g \in \mathcal{F} \), there exists \( h \in \mathcal{F} \) such that for all \( x, y \in \mathbb{R}^+ \), the following equation holds: \[ y^2 \cdot f\left(\frac{g(x)}{y}\right) = h(xy) \] Prove that for all \( f \in \mathcal{F} \) and all \( x \in \mathbb{R}^+ \), the following identity is satisfied: \[ f\left(\frac{x}{f(x)}\right) = 1. \]
The function $f$ is defined on the set $\mathbb{Q}$ of all rational numbers and has values in $\mathbb{Q}$. It satisfies the conditions $f(1) = 2$ and $f(xy) = f(x)f(y) - f(x+y) + 1$ for all $x,y \in \mathbb{Q}$. Determine $f$.
Cozy the Cat and Dash the Dog are going up a staircase with a certain number of steps. However, instead of walking up the steps one at a time, both Cozy and Dash jump. Cozy goes two steps up with each jump (though if necessary, he will just jump the last step). Dash goes five steps up with each jump (though if necessary, he will just jump the last steps if there are fewer than 5 steps left). Suppose the Dash takes 19 fewer jumps than Cozy to reach the top of the staircase. Let $s$ denote the sum of all possible numbers of steps this staircase can have. What is the sum of the digits of $s$? $\textbf{(A) } 9 \qquad\textbf{(B) } 11 \qquad\textbf{(C) } 12 \qquad\textbf{(D) } 13 \qquad\textbf{(E) } 15 $
Let \( n \) be a positive integer. Determine the largest possible value of \( k \) with the following property: there exists a bijective function \( \phi: [0, 1] \to [0, 1]^k \) and a constant \( C > 0 \) such that, for all \( x, y \in [0, 1] \), \[ \| \phi(x) - \phi(y) \| \leq C \| x - y \|^k. \] Note: \( \| \cdot \| \) denotes the Euclidean norm, that is, \( \| (a_1, \ldots, a_n) \| = \sqrt{a_1^2 + \cdots + a_n^2} \).
For $n\in\mathbb N$, let $x$ be the solution of $x^x=n$. Find the asymptotics of $x$, i.e., express $x=\Theta(f(n))$ for some suitable explicit function of $n$.