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

Solve \[ \left\{ \begin{array}{l} \log_2 x\plus{}\log_4 y\plus{}\log_4 z\equal{}2 \\ \log_3 y\plus{}\log_9 z\plus{}\log_9 x\equal{}2 \\ \log_4 z\plus{}\log_{16} x\plus{}\log_{16} y\equal{}2 \\ \end{array} \right.\]
Prove that $ 7^{2^{20}} + 7^{2^{19}} + 1 $ has at least $ 21 $ distinct prime divisors.
Source: 1976 Euclid Part A Problem 5 ----- If $\log_8 m+\log_8 \frac{1}{6}=\frac{2}{3}$, then $m$ equals $\textbf{(A) } \frac{1}{2} \qquad \textbf{(B) } \frac{2}{3} \qquad \textbf{(C) } \frac{23}{6} \qquad \textbf{(D) } 4 \qquad \textbf{(E) } 24$
Prove there exists a constant $c$ (independent of $n$) such that for any graph $G$ with $n>2$ vertices, we can split $G$ into a forest and at most $cf(n)$ disjoint cycles, where a) $f(n)=n\ln{n}$; b) $f(n)=n$. [i]David Yang.[/i]
Let $ F_0\equal{}\ln x.$ For $ n\ge 0$ and $ x>0,$ let $ \displaystyle F_{n\plus{}1}(x)\equal{}\int_0^xF_n(t)\,dt.$ Evaluate $ \displaystyle\lim_{n\to\infty}\frac{n!F_n(1)}{\ln n}.$
Solve the equation $$\log_{10} (x^3+x)=\log_2 x.$$
Let $ f(x)\equal{}\frac{1}{\sin x\sqrt{1\minus{}\cos x}}\ (0<x<\pi)$. (1) Find the local minimum value of $ f(x)$. (2) Evaluate $ \int_{\frac{\pi}{2}}^{\frac{2\pi}{3}} f(x)\ dx$.
For integer $ n,\ a_n$ is difined by $ a_n\equal{}\int_0^{\frac{\pi}{4}} (\cos x)^ndx$. (1) Find $ a_{\minus{}2},\ a_{\minus{}1}$. (2) Find the relation of $ a_n$ and $ a_{n\minus{}2}$. (3) Prove that $ a_{2n}\equal{}b_n\plus{}\pi c_n$ for some rational number $ b_n,\ c_n$, then find $ c_n$ for $ n<0$.
If $b>1$, $\sin x>0$, $\cos x>0$, and $\log_b \sin x = a$, then $\log_b \cos x$ equals $\text{(A)} \ 2\log_b(1-b^{a/2}) ~~\text{(B)} \ \sqrt{1-a^2} ~~\text{(C)} \ b^{a^2} ~~\text{(D)} \ \frac 12 \log_b(1-b^{2a}) ~~\text{(E)} \ \text{none of these}$
Let $P(n)$ be the number of functions $f: \mathbb{R} \to \mathbb{R}$, $f(x)=a x^2 + b x + c$, with $a,b,c \in \{1,2,\ldots,n\}$ and that have the property that $f(x)=0$ has only integer solutions. Prove that $n<P(n)<n^2$, for all $n \geq 4$. [i]Laurentiu Panaitopol[/i]
Prove for real $x_1$, $x_2$, ....., $x_n$, $0 < x_k \leq {1\over 2}$, the inequality \[ \left( {n \over x_1 + \dots + x_n} - 1 \right)^n \leq \left( {1 \over x_1} - 1 \right) \dots \left( {1 \over x_n} - 1 \right). \]
If $60^a = 3$ and $60^b = 5$, then $12^{[(1-a-b)/2(1-b)]}$ is $\text{(A)} \ \sqrt{3} \qquad \text{(B)} \ 2 \qquad \text{(C)} \ \sqrt{5} \qquad \text{(D)} \ 3 \qquad \text{(E)} \ \sqrt{12}$
Evaluate $ \int_0^{\sqrt{2}\minus{}1} \frac{1\plus{}x^2}{1\minus{}x^2}\ln \left(\frac{1\plus{}x}{1\minus{}x}\right)\ dx$.
Answer the following questions: (1) Evaluate $\int_{-1}^1 (1-x^2)e^{-2x}dx.$ (2) Find $\lim_{n\to\infty} \left\{\frac{(2n)!}{n!n^n}\right\}^{\frac{1}{n}}.$
What is the value of $(625^{\log_{5}{2015}})^{\frac{1}{4}}$? $\textbf{(A) }5\qquad\textbf{(B) }\sqrt[4]{2015}\qquad\textbf{(C) }625\qquad\textbf{(D) }2015\qquad\textbf{(E) }\sqrt[4]{5^{2015}}$
Let $ T \equal{} \int_0^{\ln2} \frac {2e^{3x} \plus{} e^{2x} \minus{} 1} {e^{3x} \plus{} e^{2x} \minus{} e^x \plus{} 1}dx$. Evaluate $ e^T$.
For real numer $ c$ for which $ cx^2\geq \ln (1\plus{}x^2)$ for all real numbers $ x$, find the value of $ c$ such that the area of the figure bounded by two curves $ y\equal{}cx^2$ and $ y\equal{}\ln (1\plus{}x^2)$ and two lines $ x\equal{}1,\ x\equal{}\minus{}1$ is 4.
For real numbers $b>a>0$, let $f : [0,\ \infty)\rightarrow \mathbb{R}$ be a continuous function. Prove that : (i) $\lim_{\epsilon\rightarrow +0} \int_{a\epsilon}^{b\epsilon} \frac{f(x)}{x}dx=f(0)\ln \frac{b}{a}.$ (ii) If $\int_1^{\infty} \frac{f(x)}{x}dx$ converges, then $\int_0^{\infty} \frac{f(bx)-f(ax)}{x}dx=f(0)\ln \frac{a}{b}.$
Let $a$ be non zero real number. Find the area of the figure enclosed by the line $y=ax$, the curve $y=x\ln (x+1).$
Alice and Bob play a game in which they take turns removing stones from a heap that initially has $n$ stones. The number of stones removed at each turn must be one less than a prime number. The winner is the player who takes the last stone. Alice plays first. Prove that there are infinitely many such $n$ such that Bob has a winning strategy. (For example, if $n=17,$ then Alice might take $6$ leaving $11;$ then Bob might take $1$ leaving $10;$ then Alice can take the remaining stones to win.)
Prove that there do not exist polynomials $ P$ and $ Q$ such that \[ \pi(x)\equal{}\frac{P(x)}{Q(x)}\] for all $ x\in\mathbb{N}$.
The sum of the base-$ 10$ logarithms of the divisors of $ 10^n$ is $ 792$. What is $ n$? $ \textbf{(A)}\ 11\qquad \textbf{(B)}\ 12\qquad \textbf{(C)}\ 13\qquad \textbf{(D)}\ 14\qquad \textbf{(E)}\ 15$
If numbers $x_1$, $x_2$,...,$x_n$ are from interval $\left( \frac{1}{4},1 \right)$ prove the inequality: $\log _{x_1} {\left(x_2-\frac{1}{4} \right)} + \log _{x_2} {\left(x_3-\frac{1}{4} \right)}+ ... + \log _{x_{n-1}} {\left(x_n-\frac{1}{4} \right)} + \log _{x_n} {\left(x_1-\frac{1}{4} \right)} \geq 2n$
Let $ A$, $ B$ be the number of digits of $ 2^{1998}$ and $ 5^{1998}$ in decimal system. $ A \plus{} B \equal{} ?$ $\textbf{(A)}\ 1998 \qquad\textbf{(B)}\ 1999 \qquad\textbf{(C)}\ 2000 \qquad\textbf{(D)}\ 3996 \qquad\textbf{(E)}\ 3998$