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

How many zeros does $ f(x) \equal{} \cos(\log(x)))$ have on the interval $ 0 < x < 1$? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 10 \qquad \textbf{(E)}\ \text{infinitely many}$
It is known that for quadratic polynomials $P(x)=x^2+ax+b$ and $Q(x)=x^2+cx+d$ the equation $P(Q(x))=Q(P(x))$ does not have real roots. Prove that $b \neq d$.
Suppose that $n \ge 2$. Prove that \[\sum_{k=2}^{n}\left\lfloor \frac{n^{2}}{k}\right\rfloor = \sum_{k=n+1}^{n^{2}}\left\lfloor \frac{n^{2}}{k}\right\rfloor.\]
Determine all functions $f\colon\mathbb{Z}_{>0}\to\mathbb{Z}_{>0}$ such that, for all positive integers $m$ and $n$, $$ m^{\phi(n)}+n^{\phi(m)} \mid f(m)^n + f(n)^m$$
Let $S$ be the set of all non-increasing sequences of numbers $a_1 \geq a_2 \geq \ldots \geq a_{101}$ such that $a_i \in \{ 0,1,\ldots ,101 \}$ for all $1 \leq i \leq 101$ For every sequence $s \in S$ let $$f(s)=\lceil \frac{a_1}{2} \rceil+\lfloor \frac{a_2}{2} \rfloor + \lceil \frac{a_3}{2} \rceil + \ldots + \lfloor \frac{a_{100}}{2} \rfloor + \lceil \frac{a_{101}}{2} \rceil$$ where $\lfloor x \rfloor$ is the greatest integer, not exceeding $x$, and $\lceil x \rceil$ is the least integer at least $x$. Prove that the number of sequences $s \in S$ for which $f(s)$ is even is the same, as the number of sequences $s$ for which $f(s)$ is odd [i]M. Zorka[/i]
Prove that the set of all the points with both coordinates begin rational numbers can be written as a reunion of two disjoint sets $ A$ and $ B$ such that any line that that is parallel with $ Ox$, and respectively $ Oy$ intersects $ A$, and respectively $ B$ in a finite number of points.
For any set $ A $ we say that two functions $ f,g:A\longrightarrow A $ are [i]similar,[/i] if there exists a bijection $ h:A\longrightarrow A $ such that $ f\circ h=h\circ g. $ [b]a)[/b] If $ A $ has three elements, construct a finite, arbitrary number functions, having as domain and codomain $ A, $ that are two by two similar, and every other function with the same domain and codomain as the ones determined is similar to, at least, one of them. [b]b)[/b] For $ A=\mathbb{R} , $ show that the functions $ \sin $ and $ -\sin $ are similar.
A sextic funtion $ y \equal{} ax^6 \plus{} bx^5 \plus{} cx^4 \plus{} dx^3 \plus{} ex^2 \plus{} fx \plus{} g\ (a\neq 0)$ touches the line $ y \equal{} px \plus{} q$ at $ x \equal{} \alpha ,\ \beta ,\ \gamma \ (\alpha < \beta < \gamma ).$ Find the area of the region bounded by these graphs in terms of $ a,\ \alpha ,\ \beta ,\gamma .$ created by kunny
Suppose that the function $f:\mathbb{R}\to\mathbb{R}$ satisfies \[f(x^3 + y^3)=(x+y)(f(x)^2-f(x)f(y)+f(y)^2)\] for all $x,y\in\mathbb{R}$. Prove that $f(1996x)=1996f(x)$ for all $x\in\mathbb{R}$.
Consider a $ 7\times 7$ numbers table $ a_{ij} \equal{} (i^2 \plus{} j)(i \plus{} j^2), 1\le i,j\le 7.$ When we add arbitrarily each term of an arithmetical progression consisting of $ 7$ integers to corresponding to term of certain row (or column) in turn, call it an operation. Determine whether such that each row of numbers table is an arithmetical progression, after a finite number of operations.
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).$
$a,b,c$ are positive numbers such that $a+b+c=3$, show that: \[\frac{a^{2}+9}{2a^{2}+(b+c)^{2}}+\frac{b^{2}+9}{2b^{2}+(a+c)^{2}}+\frac{c^{2}+9}{2c^{2}+(a+b)^{2}}\leq 5\]
Find the greatest positive real number $ k$ such that the inequality below holds for any positive real numbers $ a,b,c$: \[ \frac ab \plus{} \frac bc \plus{} \frac ca \minus{} 3 \geq k \left( \frac a{b \plus{} c} \plus{} \frac b{c \plus{} a} \plus{} \frac c{a \plus{} b} \minus{} \frac 32 \right). \]
Find the range of $ k$ for which the following inequality holds for $ 0\leq x\leq 1$. \[ \int_0^x \frac {dt}{\sqrt {(3 \plus{} t^2)^3}}\geq k\int _0^x \frac {dt}{\sqrt {3 \plus{} t^2}}\] If necessary, you may use $ \ln 3 \equal{} 1.10$.
Function $f: [a,b]\to\mathbb{R}$, $0<a<b$ is continuous on $[a,b]$ and differentiable on $(a,b)$. Prove that there exists $c\in(a,b)$ such that \[ f'(c)=\frac1{a-c}+\frac1{b-c}+\frac1{a+b}. \]
Let $a_0,a_1,\cdots ,a_n$ be numbers from the interval $(0,\pi/2)$ such that \[ \tan (a_0-\frac{\pi}{4})+ \tan (a_1-\frac{\pi}{4})+\cdots +\tan (a_n-\frac{\pi}{4})\geq n-1. \] Prove that \[ \tan a_0\tan a_1 \cdots \tan a_n\geq n^{n+1}. \]
Let $\alpha$ be a root of $x^6-x-1$, and call two polynomials $p$ and $q$ with integer coefficients $\textit{equivalent}$ if $p(\alpha)\equiv q(\alpha)\pmod3$. It is known that every such polynomial is equivalent to exactly one of $0,1,x,x^2,\ldots,x^{727}$. Find the largest integer $n<728$ for which there exists a polynomial $p$ such that $p^3-p-x^n$ is equivalent to $0$.
Let $c$ be a positive real number. Find all functions $f:\mathbb{R}^+\to\mathbb{R}^+$ that satisfy $$x^2f(xf(y))f(x)f(y)=c$$ for all positive reals $x$ and $y$.
Let $I \subset \mathbb{R}$ be a nonempty open interval and let $f: I \cap \mathbb{Q} \to \mathbb{R}$ be a function such that for all $x, y \in I \cap \mathbb{Q}$, \[ 4f\left(\frac{3x + y}{4}\right)+ 4f\left(\frac{x + 3y}{4}\right) \le f(x) + 6f\left(\frac{x + y}{2}\right)+ f(y). \] Show that $f$ can be continuously extended to $I$.
In a triangle $ABC$, points $X$ and $Y$ are on $BC$ and $CA$ respectively such that $CX=CY$,$AX$ is not perpendicular to $BC$ and $BY$ is not perpendicular to $CA$.Let $\Gamma$ be the circle with $C$ as centre and $CX$ as its radius.Find the angles of triangle $ABC$ given that the orthocentres of triangles $AXB$ and $AYB$ lie on $\Gamma$.
Let $f(x)$ and $g(x)$ be strictly increasing linear functions from $\mathbb R $ to $\mathbb R $ such that $f(x)$ is an integer if and only if $g(x)$ is an integer. Prove that for any real number $x$, $f(x)-g(x)$ is an integer.
For some positive integer $n$, consider the usual prime factorization \[n = \displaystyle \prod_{i=1}^{k} p_{i}^{e_{i}}=p_1^{e_1}p_2^{e_2}\ldots p_k^{e_k},\] where $k$ is the number of primes factors of $n$ and $p_{i}$ are the prime factors of $n$. Define $Q(n), R(n)$ by \[ Q(n) = \prod_{i=1}^{k} p_{i}^{p_{i}} \text{ and } R(n) = \prod_{i=1}^{k} e_{i}^{e_{i}}. \] For how many $1 \leq n \leq 70$ does $R(n)$ divide $Q(n)$?
Let $ f: \mathbb{R}^2 \rightarrow \mathbb{R} $ be a function such that for every regular $ n $-gon $ A_1A_2 \ldots A_n $ we have $ f(A_1)+f(A_2)+\cdots +f(A_n)=0 $. Prove that $ f(x)=0 $ for all reals $ x $.
For any positive integer $k$, let $f_1(k)$ denote the square of the sum of the digits of $k$. For $n \ge 2$, let $f_n(k) = f_1(f_{n - 1}(k))$. Find $f_{1988}(11)$.
A game involves jumping to the right on the real number line. If $ a$ and $ b$ are real numbers and $ b>a,$ the cost of jumping from $ a$ to $ b$ is $ b^3\minus{}ab^2.$ For what real numbers $ c$ can one travel from $ 0$ to $ 1$ in a finite number of jumps with total cost exactly $ c?$