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: 125

Suppose that $x$ is measured in radians. Find the maximum value of \[\frac{\sin2x+\sin4x+\sin6x}{\cos2x+\cos4x+\cos6x}\] for $0\le x\le \frac{\pi}{16}$
$f$ is a function whose domain is the set of nonnegative integers and whose range is contained in the set of nonnegative integers. $f$ satisfies the condition that $f(f(n))+f(n)=2n+3$ for all nonnegative integers $n$. Find $f(2014)$.
Does there exist a function $f:\mathbb{Z}\to\mathbb{Z}$ such that $f(x+f(y))=f(x)-y$ for all integers $x$ and $y$?
Let $ a$, $ b$, $ c$ be three integers. Prove that there exist six integers $ x$, $ y$, $ z$, $ x^{\prime}$, $ y^{\prime}$, $ z^{\prime}$ such that $ a\equal{}yz^{\prime}\minus{}zy^{\prime};\ \ \ \ \ \ \ \ \ \ b\equal{}zx^{\prime}\minus{}xz^{\prime};\ \ \ \ \ \ \ \ \ \ c\equal{}xy^{\prime}\minus{}yx^{\prime}$.
A man can commute either by train or by bus. If he goes to work on the train in the morning, he comes home on the bus in the afternoon; and if he comes home in the afternoon on the train, he took the bus in the morning. During a total of $ x$ working days, the man took the bus to work in the morning 8 times, came home by bus in the afternoon 15 times, and commuted by train (either morning or afternoon) 9 times. Find $ x$. $ \textbf{(A)}\ 19 \qquad \textbf{(B)}\ 18 \qquad \textbf{(C)}\ 17 \qquad \textbf{(D)}\ 16 \qquad$ $ \textbf{(E)}\ \text{not enough information given to solve the problem}$
For how many positive integers $x$ is $\log_{10}{(x-40)} + \log_{10}{(60-x)} < 2$? ${ \textbf{(A)}\ 10\qquad\textbf{(B)}\ 18\qquad\textbf{(C)}\ 19\qquad\textbf{(D)}}\ 20\qquad\textbf{(E)}\ \text{infinitely many} $
The numbers from 1 to 1996 are written down ------ 12345678910111213.... How many zeros are written? A. 489 B. 699 C. 796 D. 996 E. None of these
Let $f(x)=\frac{ax+b}{cx+d}$ $F_n(x)=f(f(f...f(x)...))$ (with $n\ f's$) Suppose that $f(0) \not =0$, $f(f(0)) \not = 0$, and for some $n$ we have $F_n(0)=0$, show that $F_n(x)=x$ (for any valid x).
Consider the graphs of $y=2\log{x}$ and $y=\log{2x}$. We may say that: $ \textbf{(A)}\ \text{They do not intersect}$ $ \qquad\textbf{(B)}\ \text{They intersect at 1 point only}$ $\qquad\textbf{(C)}\ \text{They intersect at 2 points only}$ $\qquad\textbf{(D)}\ \text{They intersect at a finite number of points but greater than 2 }$ ${\qquad\textbf{(E)}\ \text{They coincide} } $
Let $f:[0,1)\to (0,1)$ a continous onto (surjective) function. a) Prove that, for all $a\in(0,1)$, the function $f_a:(a,1)\to (0,1)$, given by $f_a(x) = f(x)$, for all $x\in(a,1)$ is onto; b) Give an example of such a function.
[color=darkred]Find all functions $f:\mathbb{R}\to\mathbb{R}$ with the following property: for any open bounded interval $I$, the set $f(I)$ is an open interval having the same length with $I$ .[/color]
Determine the (real) domain of a function $$y=\sqrt{1-\frac{x}{4}|x|+\sqrt{1-\frac{x}{2}|x|\,}\,}-\sqrt{1-\frac{x}{4}|x|-\sqrt{1-\frac{x}{2}|x|\,}\,}$$ and draw its graph.
Find all the continuous functions $f : \mathbb{R} \mapsto\mathbb{R}$ such that $\forall x,y \in \mathbb{R}$, $(1+f(x)f(y))f(x+y)=f(x)+f(y)$.
Find all pairs of real numbers $a, b$ for which the equation in the domain of the real numbers \[\frac{ax^2-24x+b}{x^2-1}=x\] has two solutions and the sum of them equals $12$.
Let $\mathcal{F}$ be the set of all the functions $f : \mathcal{P}(S) \longrightarrow \mathbb{R}$ such that for all $X, Y \subseteq S$, we have $f(X \cap Y) = \min (f(X), f(Y))$, where $S$ is a finite set (and $\mathcal{P}(S)$ is the set of its subsets). Find \[\max_{f \in \mathcal{F}}| \textrm{Im}(f) |. \]
Find the sum of the roots of $\tan^2x-9\tan x+1=0$ that are between $x=0$ and $x=2\pi$ radians. $ \textbf{(A)}\ \frac{\pi}{2} \qquad\textbf{(B)}\ \pi \qquad\textbf{(C)}\ \frac{3\pi}{2} \qquad\textbf{(D)}\ 3\pi \qquad\textbf{(E)}\ 4\pi $
Find all the functions $f:\mathbb{N}\to\mathbb{R}$ that satisfy \[ f(x+y)=f(x)+f(y) \] for all $x,y\in\mathbb{N}$ satisfying $10^6-\frac{1}{10^6} < \frac{x}{y} < 10^6+\frac{1}{10^6}$. Note: $\mathbb{N}$ denotes the set of positive integers and $\mathbb{R}$ denotes the set of real numbers.
Consider a regular $n$-gon with $n$ odd. Given two adjacent vertices $A_{1}$ and $A_{2},$ define the sequence $(A_{k})$ of vertices of the $n$-gon as follows: For $k\ge 3,\, A_{k}$ is the vertex lying on the perpendicular bisector of $A_{k-2}A_{k-1}.$ Find all $n$ for which each vertex of the $n$-gon occurs in this sequence.
Let $R$ be a square region and $n\ge4$ an integer. A point $X$ in the interior of $R$ is called $n\text{-}ray$ partitional if there are $n$ rays emanating from $X$ that divide $R$ into $n$ triangles of equal area. How many points are 100-ray partitional but not 60-ray partitional? $\textbf{(A)}\,1500 \qquad\textbf{(B)}\,1560 \qquad\textbf{(C)}\,2320 \qquad\textbf{(D)}\,2480 \qquad\textbf{(E)}\,2500$
Let $a$, $b$, $c$, $d$ be real numbers such that $b-d \ge 5$ and all zeros $x_1, x_2, x_3,$ and $x_4$ of the polynomial $P(x)=x^4+ax^3+bx^2+cx+d$ are real. Find the smallest value the product $(x_1^2+1)(x_2^2+1)(x_3^2+1)(x_4^2+1)$ can take.
Let $A=\{1,2,3,4\}$, and $f$ and $g$ be randomly chosen (not necessarily distinct) functions from $A$ to $A$. The probability that the range of $f$ and the range of $g$ are disjoint is $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m$.
For every real number $x$, let $\lfloor x\rfloor$ denote the greatest integer not exceeding $x$, and let \[f(x)=\lfloor x\rfloor(2014^{x-\lfloor x\rfloor}-1).\] The set of all numbers $x$ such that $1\leq x<2014$ and $f(x)\leq 1$ is a union of disjoint intervals. What is the sum of the lengths of those intervals? $\textbf{(A) }1\qquad \textbf{(B) }\dfrac{\log 2015}{\log 2014}\qquad \textbf{(C) }\dfrac{\log 2014}{\log 2013}\qquad \textbf{(D) }\dfrac{2014}{2013}\qquad \textbf{(E) }2014^{\frac1{2014}}\qquad$
Given $5n$ real numbers $r_i, s_i, t_i, u_i, v_i \geq 1 (1 \leq i \leq n)$, let $R = \frac {1}{n} \sum_{i=1}^{n} r_i$, $S = \frac {1}{n} \sum_{i=1}^{n} s_i$, $T = \frac {1}{n} \sum_{i=1}^{n} t_i$, $U = \frac {1}{n} \sum_{i=1}^{n} u_i$, $V = \frac {1}{n} \sum_{i=1}^{n} v_i$. Prove that $\prod_{i=1}^{n}\frac {r_i s_i t_i u_i v_i + 1}{r_i s_i t_i u_i v_i - 1} \geq \left(\frac {RSTUV +1}{RSTUV - 1}\right)^n$.
A function $f$ has its domain equal to the set of integers $0$, $1$, $\ldots$, $11$, and $f(n)\geq 0$ for all such $n$, and $f$ satisfies [list] [*]$f(0)=0$ [*]$f(6)=1$ [*]If $x\geq 0$, $y\geq 0$, and $x+y\leq 11$, then $f(x+y)=\tfrac{f(x)+f(y)}{1-f(x)f(y)}$.[/list] Find $f(2)^2+f(10)^2$.
Let $\mathbb{F}_p$ denote the field of integers modulo a prime $p,$ and let $n$ be a positive integer. Let $v$ be a fixed vector in $\mathbb{F}_p^n,$ let $M$ be an $n\times n$ matrix with entries in $\mathbb{F}_p,$ and define $G:\mathbb{F}_p^n\to \mathbb{F}_p^n$ by $G(x)=v+Mx.$ Let $G^{(k)}$ denote the $k$-fold composition of $G$ with itself, that is, $G^{(1)}(x)=G(x)$ and $G^{(k+1)}(x)=G(G^{(k)}(x)).$ Determine all pairs $p,n$ for which there exist $v$ and $M$ such that the $p^n$ vectors $G^{(k)}(0),$ $k=1,2,\dots,p^n$ are distinct.