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

Let $ S$ be the set of ordered triples $ (x,y,z)$ of real numbers for which \[ \log_{10} (x \plus{} y) \equal{} z\text{ and }\log_{10} (x^2 \plus{} y^2) \equal{} z \plus{} 1. \]There are real numbers $ a$ and $ b$ such that for all ordered triples $ (x,y,z)$ in $ S$ we have $ x^3 \plus{} y^3 \equal{} a \cdot 10^{3z} \plus{} b \cdot 10^{2z}$. What is the value of $ a \plus{} b$? $ \textbf{(A)}\ \frac {15}{2}\qquad \textbf{(B)}\ \frac {29}{2}\qquad \textbf{(C)}\ 15\qquad \textbf{(D)}\ \frac {39}{2}\qquad \textbf{(E)}\ 24$
Evaluate $\int_0^{\frac {\pi}{4}} \frac {\sin \theta -2\ln \frac{1-\sin \theta}{\cos \theta}}{(1+\cos 2\theta)\sqrt{\ln \frac{1+\sin \theta}{\cos \theta}}}d\theta .$
Find the unique integer $a > 1$ that satisfies \[ \int_{a}^{a^2} \left(\frac{1}{\ln x} - \frac{2}{(\ln x)^3}\right) dx = \frac{a}{\ln a}. \]
A graph $G$ with $n$ vertices is called [i]cool[/i] if we can label each vertex with a different positive integer not greater than $\frac{n^2}{4}$ and find a set of non-negative integers $D$ so that there is an edge between two vertices iff the difference between their labels is in $D$. Show that if $n$ is sufficiently large we can always find a graph with $n$ vertices which is not cool.
Prove that there is a constant $c>0$ with the following property: If $a, b, n$ are positive integers such that $\gcd(a+i, b+j)>1$ for all $i, j\in\{0, 1, \ldots n\}$, then\[\min\{a, b\}>c^n\cdot n^{\frac{n}{2}}.\]
Let \[ A = \frac{1}{6}((\log_2(3))^3-(\log_2(6))^3-(\log_2(12))^3+(\log_2(24))^3) \]. Compute $2^A$.
Let $a, b, c$ be positive reals, and let $\sqrt[2013]{\frac{3}{a^{2013}+b^{2013}+c^{2013}}}=P$. Prove that \[\prod_{\text{cyc}}\left(\frac{(2P+\frac{1}{2a+b})(2P+\frac{1}{a+2b})}{(2P+\frac{1}{a+b+c})^2}\right)\ge \prod_{\text{cyc}}\left(\frac{(P+\frac{1}{4a+b+c})(P+\frac{1}{3b+3c})}{(P+\frac{1}{3a+2b+c})(P+\frac{1}{3a+b+2c})}\right).\][i]Proposed by David Stoner[/i]
The number of digits in $4^{16} 5^{25}$ (when written in the usual base 10 form) is A. 31 B. 30 C. 29 D. 28 E. 27
Calculate $ \lfloor \log_3 5 +\log_5 7 +\log_7 3 \rfloor .$ [i]Petre Rău[/i]
Given a real number $a> 0$. How many positive real solutions of the equation is $ a^{x}=x^{a} $
Evaluate $\int_{\frac{\pi}{4}}^{\frac{\pi}{3}} \frac{(2\sin \theta +1)\cos ^ 3 \theta}{(\sin ^ 2 \theta +1)^2}d\theta .$ [i]Proposed by kunny[/i]
Prove that for every positive integer $ n$, $ n^n \le (n!)^2 \le \left( \frac{(n\plus{}1)(n\plus{}2)}{6} \right) ^n.$
The number $5^{867}$ is between $2^{2013}$ and $2^{2014}$. How many pairs of integers $(m,n)$ are there such that $1\leq m\leq 2012$ and \[5^n<2^m<2^{m+2}<5^{n+1}?\] $\textbf{(A) }278\qquad \textbf{(B) }279\qquad \textbf{(C) }280\qquad \textbf{(D) }281\qquad \textbf{(E) }282\qquad$
Calculate $\displaystyle \sum_{n=1}^\infty \ln \left(1+\frac{1}{n}\right) \ln\left( 1+\frac{1}{2n}\right)\ln\left( 1+\frac{1}{2n+1}\right)$.
Consider a charged capacitor made with two square plates of side length $L$, uniformly charged, and separated by a very small distance $d$. The EMF across the capacitor is $\xi$. One of the plates is now rotated by a very small angle $\theta$ to the original axis of the capacitor. Find an expression for the difference in charge between the two plates of the capacitor, in terms of (if necessary) $d$, $\theta$, $\xi$, and $L$. Also, approximate your expression by transforming it to algebraic form: i.e. without any non-algebraic functions. For example, logarithms and trigonometric functions are considered non-algebraic. Assume $ d << L $ and $ \theta \approx 0 $. $\emph{Hint}$: You may assume that $ \frac {\theta L}{d} $ is also very small. [i]Problem proposed by Trung Phan[/i] [hide="Clarification"] There are two possible ways to rotate the capacitor. Both were equally scored but this is what was meant: [asy]size(6cm); real h = 7; real w = 2; draw((-w,0)--(-w,h)); draw((0,0)--(0,h), dashed); draw((0,0)--h*dir(64)); draw(arc((0,0),2,64,90)); label("$\theta$", 2*dir(77), dir(77)); [/asy] [/hide]
Among all eight-digit multiples of four, are there more numbers with the digit $1$ or without the digit $1$ in their decimal representation?
Let $n$ be a positive integer. Prove that \[-1<\sum_{k=1}^{n}\frac{k}{k^2+1}-\ln n\le\frac{1}{2}\]
Let $\{a,b,c\}\in \mathbb{R}^{+}$. Prove that $a^a b^b c^c \ge (abc)^{\frac{a+b+c}{3}}$.
Let $ a,\ b$ be postive real numbers. Find $ \lim_{n\to\infty} \sum_{k\equal{}1}^n \frac{n}{(k\plus{}an)(k\plus{}bn)}.$
For $m$ a positive integer, let $s(m)$ be the sum of the digits of $m$. For $n\ge 2$, let $f(n)$ be the minimal $k$ for which there exists a set $S$ of $n$ positive integers such that $s\left(\sum_{x\in X} x\right)=k$ for any nonempty subset $X\subset S$. Prove that there are constants $0<C_1<C_2$ with \[C_1 \log_{10} n \le f(n) \le C_2 \log_{10} n.\]
In the coordinate plane with $ O(0,\ 0)$, consider the function $ C: \ y \equal{} \frac 12x \plus{} \sqrt {\frac 14x^2 \plus{} 2}$ and two distinct points $ P_1(x_1,\ y_1),\ P_2(x_2,\ y_2)$ on $ C$. (1) Let $ H_i\ (i \equal{} 1,\ 2)$ be the intersection points of the line passing through $ P_i\ (i \equal{} 1,\ 2)$, parallel to $ x$ axis and the line $ y \equal{} x$. Show that the area of $ \triangle{OP_1H_1}$ and $ \triangle{OP_2H_2}$ are equal. (2) Let $ x_1 < x_2$. Express the area of the figure bounded by the part of $ x_1\leq x\leq x_2$ for $ C$ and line segments $ P_1O,\ P_2O$ in terms of $ y_1,\ y_2$.
Let $f\left(x\right)=10^{10x}, g\left(x\right)=\log_{10}\left(\frac{x}{10}\right), h_1\left(x\right)=g\left(f\left(x\right)\right),$ and $h_n\left(x\right)=h_1\left(h_{n-1}\left(x\right)\right)$ for integers $n \ge 2$. What is the sum of the digits of $h_{2011}\left(1\right)$? $ \textbf{(A)}\ 16,081 \qquad \textbf{(B)}\ 16,089 \qquad \textbf{(C)}\ 18,089 \qquad \textbf{(D)}\ 18,098 \qquad \textbf{(E)}\ 18,099 $
Find all bases of logarithms in which a real positive number can be equal to its logarithm or prove that none exist.
Define binary operations $\diamondsuit$ and $\heartsuit$ by $$a \, \diamondsuit \, b = a^{\log_{7}(b)} \qquad \text{and} \qquad a \, \heartsuit \, b = a^{\frac{1}{\log_{7}(b)}}$$ for all real numbers $a$ and $b$ for which these expressions are defined. The sequence $(a_n)$ is defined recursively by $a_3 = 3\, \heartsuit\, 2$ and $$a_n = (n\, \heartsuit\, (n-1)) \,\diamondsuit\, a_{n-1}$$ for all integers $n \geq 4$. To the nearest integer, what is $\log_{7}(a_{2019})$? $\textbf{(A) } 8 \qquad \textbf{(B) } 9 \qquad \textbf{(C) } 10 \qquad \textbf{(D) } 11 \qquad \textbf{(E) } 12$
Let $a,b,c$ be real number greater than $1$. Let \[S=\log_a {bc}+\log_b {ca}+\log_c {ab}\] Find the minimum possible value of $S$.