Find at least one root of the equation$$\sin(2 \log_2 x) + tg(3\log_2 x) = \sin6+tg9$$less than $0.01$.

Let $a>1,\ 0\leq x\leq \frac{\pi}{4}$. Find the volume of the solid generated by a rotation of the part bounded by two curves $y=\frac{\sqrt{2}\sin x}{\sqrt{\sin 2x+a}},\ y=\frac{1}{\sqrt{\sin 2x+a}}$ about the $x$-axis. [i]1993 Hiroshima Un iversity entrance exam/Science[/i]

Evaluate $\int_0^1 \frac{\ln (x+2)}{x+1}dx.$

Evaluate $\int_{-\frac{\pi}{3}}^{\frac{\pi}{6}} \left|\frac{4\sin x}{\sqrt{3}\cos x-\sin x}\right|dx.$ 2009 Kumamoto University entrance exam/Medicine

Let $g(t)$ be the minimum value of $f(x)=x2^{-x}$ in $t\leq x\leq t+1$. Evaluate $\int_0^2 g(t)dt$. [i]2010 Kumamoto University entrance exam/Science[/i]

Suppose $x$ is in the interval $[0,\pi/2]$ and $\log_{24\sin{x}}(24\cos{x})=\frac{3}{2}$. Find $24\cot^2{x}$.

Let $a_n$ be the local maximum of $f_n(x)=\frac{x^ne^{-x+n\pi}}{n!}\ (n=1,\ 2,\ \cdots)$ for $x>0$. Find $\lim_{n\to\infty} \ln \left(\frac{a_{2n}}{a_n}\right)^{\frac{1}{n}}$.

([b]7[/b]) Evaluate the limit $ \lim_{n\rightarrow\infty} n^{\minus{}\frac{1}{2}\left(1\plus{}\frac{1}{n}\right)} \left(1^1\cdot2^2\cdot\cdots\cdot n^n\right)^{\frac{1}{n^2}}$.

Let $n$ be largest number such that \[ \frac{2014^{100!}-2011^{100!}}{3^n} \] is still an integer. Compute the remainder when $3^n$ is divided by $1000$.

Are there such $x,y$ that $\lg{(x+y)}=\lg x \lg y$ and $\lg{(x-y)}=\frac{\lg x}{\lg y}$ ?

(1) A function is defined $ f(x) \equal{} \ln (x \plus{} \sqrt {1 \plus{} x^2})$ for $ x\geq 0$. Find $ f'(x)$. (2) Find the arc length of the part $ 0\leq \theta \leq \pi$ for the curve defined by the polar equation: $ r \equal{} \theta\ (\theta \geq 0)$. Remark: [color=blue]You may not directly use the integral formula of[/color] $ \frac {1}{\sqrt {1 \plus{} x^2}},\ \sqrt{1 \plus{} x^2}$ here.

Let $n$ be a fixed natural number. [b]a)[/b] Find all solutions to the following equation : \[ \sum_{k=1}^n [\frac x{2^k}]=x-1 \] [b]b)[/b] Find the number of solutions to the following equation ($m$ is a fixed natural) : \[ \sum_{k=1}^n [\frac x{2^k}]=x-m \]

Evaluate $ \int_1^e \frac {(1 \plus{} 2x^2)\ln x}{\sqrt {1 \plus{} x^2}}\ dx$.

Find the maximum possible value of $8\cdot 27^{\log_6 x}+27\cdot 8^{\log_6 x}-x^3$ as $x$ varies over the positive real numbers.

There are ${n}$ tokens in a pack. Some of them (at least one, but not all) are white and the rest are black. All tokens are extracted randomly from the pack, one by one, without putting them back. Let ${X_i}$ be the ratio of white tokens in the pack before the ${i^{\text{th}}}$ extraction and let \[ \displaystyle T =\max \{ |X_i-X_j| : 1 \leq i \leq j \leq n\}.\] Prove that ${\Bbb{E}(T) \leq H(\Bbb{E}(X_1))},$ where ${H(x)=-x\ln x -(1-x)\ln(1-x)}.$ [i]Proposed by Tamás Móri[/i]

There are $ n$ websites $ 1,2,\ldots,n$ ($ n \geq 2$). If there is a link from website $ i$ to $ j$, we can use this link so we can move website $ i$ to $ j$. For all $ i \in \left\{1,2,\ldots,n - 1 \right\}$, there is a link from website $ i$ to $ i+1$. Prove that we can add less or equal than $ 3(n - 1)\log_{2}(\log_{2} n)$ links so that for all integers $ 1 \leq i < j \leq n$, starting with website $ i$, and using at most three links to website $ j$. (If we use a link, website's number should increase. For example, No.7 to 4 is impossible). Sorry for my bad English.

Powers of $2$ in base $10$ start with $3$ or $4$ more frequently? What is their state in base $3$? First write down an exact form of the question.

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$

Compute \[\int_1^2\dfrac{9x+4}{x^5+3x^2+x}dx.\] (No, your TI-89 doesn’t know how to do this one. Yes, the end is near.)

A triangle in the coordinate plane has vertices $A(\log_21,\log_22)$, $B(\log_23,\log_24)$, and $C(\log_27,\log_28)$. What is the area of $\triangle ABC$? $ \textbf{(A) }\log_2\frac{\sqrt3}7\qquad \textbf{(B) }\log_2\frac3{\sqrt7}\qquad \textbf{(C) }\log_2\frac7{\sqrt3}\qquad \textbf{(D) }\log_2\frac{11}{\sqrt7}\qquad \textbf{(E) }\log_2\frac{11}{\sqrt3}\qquad $

How many positive integers $ b$ have the property that $ \log_b729$ is a positive integer? $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$

Let $S$ be a planar region. A $\emph{domino-tiling}$ of $S$ is a partition of $S$ into $1\times2$ rectangles. (For example, a $2\times3$ rectangle has exactly $3$ domino-tilings, as shown below.) [asy] import graph; size(7cm); pen dps = linewidth(0.7); defaultpen(dps); draw((0,0)--(3,0)--(3,2)--(0,2)--cycle, linewidth(2)); draw((4,0)--(4,2)--(7,2)--(7,0)--cycle, linewidth(2)); draw((8,0)--(8,2)--(11,2)--(11,0)--cycle, linewidth(2)); draw((1,0)--(1,2)); draw((2,1)--(3,1)); draw((0,1)--(2,1), linewidth(2)); draw((2,0)--(2,2), linewidth(2)); draw((4,1)--(7,1)); draw((5,0)--(5,2), linewidth(2)); draw((6,0)--(6,2), linewidth(2)); draw((8,1)--(9,1)); draw((10,0)--(10,2)); draw((9,0)--(9,2), linewidth(2)); draw((9,1)--(11,1), linewidth(2)); [/asy] The rectangles in the partition of $S$ are called $\emph{dominoes}$. (a) For any given positive integer $n$, find a region $S_n$ with area at most $2n$ that has exactly $n$ domino-tilings. (b) Find a region $T$ with area less than $50000$ that has exactly $100002013$ domino-tilings.

Prove that \[ \int^1_0 \int^1_0 \frac { dx \ dy }{ \frac 1x + |\log y| -1 } \leq 1 . \]

Evaluate $\displaystyle\lim_{x\to 1}x^{\dfrac{x}{\sin(1-x)}}$.

For a positive integer $n$, an [i]$n$-branch[/i] $B$ is an ordered tuple $(S_1, S_2, \dots, S_m)$ of nonempty sets (where $m$ is any positive integer) satisfying $S_1 \subset S_2 \subset \dots \subset S_m \subseteq \{1,2,\dots,n\}$. An integer $x$ is said to [i]appear[/i] in $B$ if it is an element of the last set $S_m$. Define an [i]$n$-plant[/i] to be an (unordered) set of $n$-branches $\{ B_1, B_2, \dots, B_k\}$, and call it [i]perfect[/i] if each of $1$, $2$, \dots, $n$ appears in exactly one of its branches. Let $T_n$ be the number of distinct perfect $n$-plants (where $T_0=1$), and suppose that for some positive real number $x$ we have the convergence \[ \ln \left( \sum_{n \ge 0} T_n \cdot \frac{\left( \ln x \right)^n}{n!} \right) = \frac{6}{29}. \] If $x = \tfrac mn$ for relatively prime positive integers $m$ and $n$, compute $m+n$. [i]Proposed by Yang Liu[/i]