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 $ ABC$ be an acute-angled triangle. Let $ L$ be any line in the plane of the triangle $ ABC$. Denote by $ u$, $ v$, $ w$ the lengths of the perpendiculars to $ L$ from $ A$, $ B$, $ C$ respectively. Prove the inequality $ u^2\cdot\tan A \plus{} v^2\cdot\tan B \plus{} w^2\cdot\tan C\geq 2\cdot S$, where $ S$ is the area of the triangle $ ABC$. Determine the lines $ L$ for which equality holds.
Determine all functions $f$ from the real numbers to the real numbers, different from the zero function, such that $f(x)f(y)=f(x-y)$ for all real numbers $x$ and $y$.
Solve the following system of equations in rational numbers: \[ (x^2+1)^3=y+1,\\ (y^2+1)^3=z+1,\\ (z^2+1)^3=x+1.\]
Show that if $\lambda > \frac{1}{2}$ there does not exist a real-valued function $u(x)$ such that for all $x$ in the closed interval $[0,1]$ the following holds: $$u(x)= 1+ \lambda \int_{x}^{1} u(y) u(y-x) \; dy.$$
A function $ f$ has domain $ [0,2]$ and range $ [0,1]$. (The notation $ [a,b]$ denotes $ \{x: a\le x\le b\}$.) What are the domain and range, respectively, of the function $ g$ defined by $ g(x)\equal{}1\minus{}f(x\plus{}1)$? $ \textbf{(A)}\ [\minus{}1,1],[\minus{}1,0] \qquad \textbf{(B)}\ [\minus{}1,1],[0,1] \qquad \textbf{(C)}\ [0,2],[\minus{}1,0] \qquad \textbf{(D)}\ [1,3],[\minus{}1,0] \qquad \textbf{(E)}\ [1,3],[0,1]$
Let $a_{1}, a_{2}, \dots, a_{n}$ ($n > 3$) be real numbers such that \[ a_{1} + a_{2} + \cdots + a_{n} \geq n \qquad \mbox{and} \qquad a_{1}^{2} + a_{2}^{2} + \cdots + a_{n}^{2} \geq n^{2}. \] Prove that $\max(a_{1}, a_{2}, \dots, a_{n}) \geq 2$.
Let be two natural numbers $ b>a>0 $ and a function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ having the following property. $$ f\left( x^2+ay\right)\ge f\left( x^2+by\right) ,\quad\forall x,y\in\mathbb{R} $$ [b]a)[/b] Show that $ f(s)\le f(0)\le f(t) , $ for any real numbers $ s<0<t. $ [b]b)[/b] Prove that $ f $ is constant on the interval $ (0,\infty ) . $ [b]c)[/b] Give an example of a non-monotone such function.
Let $f: N \to N$ be a function satisfying (a) $1\le f(x)-x \le 2019$ $\forall x \in N$ (b) $f(f(x))\equiv x$ (mod $2019$) $\forall x \in N$ Show that $\exists x \in N$ such that $f^k(x)=x+2019 k, \forall k \in N$
Determine all $ f:R\rightarrow R $ such that $$ f(xf(y)+y^3)=yf(x)+f(y)^3 $$
Let $ABCD$ be a convex quadrilateral with $\angle{DAC}= \angle{BDC}= 36^\circ$ , $\angle{CBD}= 18^\circ$ and $\angle{BAC}= 72^\circ$. The diagonals and intersect at point $P$ . Determine the measure of $\angle{APD}$.
Find the number of values of $x$ such that the number of square units in the area of the isosceles triangle with sides $x$, $65$, and $65$ is a positive integer.
Consider an $n$-by-$n$ board of unit squares for some odd positive integer $n$. We say that a collection $C$ of identical dominoes is a [i]maximal grid-aligned configuration[/i] on the board if $C$ consists of $(n^2-1)/2$ dominoes where each domino covers exactly two neighboring squares and the dominoes don't overlap: $C$ then covers all but one square on the board. We are allowed to slide (but not rotate) a domino on the board to cover the uncovered square, resulting in a new maximal grid-aligned configuration with another square uncovered. Let $k(C)$ be the number of distinct maximal grid-aligned configurations obtainable from $C$ by repeatedly sliding dominoes. Find the maximum value of $k(C)$ as a function of $n$. [i]Proposed by Holden Mui[/i]
Find all functions $f:\mathbb{N}\rightarrow \mathbb{N}$ such that for all $m,n\in\mathbb{N}$, \[(2^m+1)f(n)f(2^mn)=2^mf(n)^2+f(2^mn)^2+(2^m-1)^2n. \]
For a natural number $n$, with $v_2(n)$ we denote the largest integer $k\geq0$ such that $2^k|n$. Let us assume that the function $f\colon\mathbb{N}\to\mathbb{N}$ meets the conditions: $(i)$ $f(x)\leq3x$ for all natural numbers $x\in\mathbb{N}$. $(ii)$ $v_2(f(x)+f(y))=v_2(x+y)$ for all natural numbers $x,y\in\mathbb{N}$. Prove that for every natural number $a$ there exists exactly one natural number $x$ such that $f(x)=3a$.
We are given the finite sets $ X$, $ A_1$, $ A_2$, $ \dots$, $ A_{n \minus{} 1}$ and the functions $ f_i: \ X\rightarrow A_i$. A vector $ (x_1,x_2,\dots,x_n)\in X^n$ is called [i]nice[/i], if $ f_i(x_i) \equal{} f_i(x_{i \plus{} 1})$, for each $ i \equal{} 1,2,\dots,n \minus{} 1$. Prove that the number of nice vectors is at least \[ \frac {|X|^n}{\prod\limits_{i \equal{} 1}^{n \minus{} 1} |A_i|}. \]
[color=darkred]Let $ m,n\in \mathbb{N}$, $ n\ge 2$ and numbers $ a_i > 0$, $ i \equal{} \overline{1,n}$, such that $ \sum a_i \equal{} 1$. Prove that $ \small{\dfrac{a_1^{2 \minus{} m} \plus{} a_2 \plus{} ... \plus{} a_{n \minus{} 1}}{1 \minus{} a_1} \plus{} \dfrac{a_2^{2 \minus{} m} \plus{} a_3 \plus{} ... \plus{} a_n}{1 \minus{} a_1} \plus{} ... \plus{} \dfrac{a_n^{2 \minus{} m} \plus{} a_1 \plus{} ... \plus{} a_{n \minus{} 2}}{1 \minus{} a_1}\ge n \plus{} \dfrac{n^m \minus{} n}{n \minus{} 1}}$[/color]
Let $f:\mathbb{R}^+\to \mathbb{R}^+$ be a function such that for all $x,y \in \mathbb{R}+,\, f(x)f(y)=f(xy)+f\left(\frac{x}{y}\right)$, where $\mathbb{R}^+$ represents the positive real numbers. Given that $f(2)=3$, compute the last two digits of $f\left(2^{2^{2020}}\right)$.
The sequence $ \{a_n \} $ is defined as follows: $ a_0 = 1 $ and $ {a_n} = \sum \limits_ {k = 1} ^ {[\sqrt n]} {{a_ {n - {k ^ 2 }}}} $ for $ n \ge 1. $ Prove that among $ a_1, a_2, \ldots, a_ {10 ^ 6} $ there are at least $500$ even numbers. (Here, $ [x] $ is the largest integer not exceeding $ x $.)
Let $A(x)=\lfloor\frac{x^2-20x+16}{4}\rfloor$, $B(x)=\sin\left(e^{\cos\sqrt{x^2+2x+2}}\right)$, $C(x)=x^3-6x^2+5x+15$, $H(x)=x^4+2x^3+3x^2+4x+5$, $M(x)=\frac{x}{2}-2\lfloor\frac{x}{2}\rfloor+\frac{x}{2^2}+\frac{x}{2^3}+\frac{x}{2^4}+\ldots$, $N(x)=\textrm{the number of integers that divide }\left\lfloor x\right\rfloor$, $O(x)=|x|\log |x|\log\log |x|$, $T(x)=\sum_{n=1}^{\infty}\frac{n^x}{\left(n!\right)^3}$, and $Z(x)=\frac{x^{21}}{2016+20x^{16}+16x^{20}}$ for any real number $x$ such that the functions are defined. Determine $$C(C(A(M(A(T(H(B(O(N(A(N(Z(A(2016)))))))))))))).$$ [i]2016 CCA Math Bonanza Lightning #5.3[/i]
Find all primes $ p,q $ such that $ \alpha^{3pq} -\alpha \equiv 0 \pmod {3pq} $ for all integers $ \alpha $.
$|3 - \pi| =$ $ \textbf{(A)}\ \frac{1}{7}\qquad\textbf{(B)}\ 0.14\qquad\textbf{(C)}\ 3 - \pi\qquad\textbf{(D)}\ 3 + \pi\qquad\textbf{(E)}\ \pi - 3 $
Compute the value of $$\sin^2\left(\frac{\pi}{7}\right) + \sin^2\left(\frac{3\pi}{7}\right) + \sin^2\left(\frac{5\pi}{7}\right).$$ Your answer should not involve any trigonometric functions. [i]Proposed by Howard Halim[/i]
Find all functions $ f:\mathbb R \to \mathbb R$ such that $xf(y)+yf(x)=(x+y)f(x)f(y)$ for all reals $x$ and $y$.
Determine all injective functions defined on the set of positive integers into itself satisfying the following condition: If $S$ is a finite set of positive integers such that $\sum\limits_{s\in S}\frac{1}{s}$ is an integer, then $\sum\limits_{s\in S}\frac{1}{f\left( s\right) }$ is also an integer.
Let $f$ be a function on a set $X$. Prove that $$f(X-f(X))=f(X)-f(f(X)),$$ where for a set $S$, the notation $f(S)$ means $\{f(a) | a \in S\}$.