The set of all real numbers $ x$ for which \[ \log_{2004}(\log_{2003}(\log_{2002}(\log_{2001}{x}))) \]is defined is $ \{x|x > c\}$. What is the value of $ c$? $ \textbf{(A)}\ 0\qquad \textbf{(B)}\ 2001^{2002} \qquad \textbf{(C)}\ 2002^{2003} \qquad \textbf{(D)}\ 2003^{2004} \qquad \textbf{(E)}\ 2001^{2002^{2003}}$

Show that $$\log_2\pi+\log_4\pi<\frac52.$$

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$.

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

An increasing function $f : N \to R$ satisfies $$f(kl) = f(k)+ f(l)\,\,\, for \,\,\, all \,\,\, k,l \in N.$$ Show that there is a real number $p > 1$ such that $f(n) =\ log_pn$ for all $n$.

Find $\lim_{n\to\infty} \frac{1}{n}\sqrt[n]{\frac{(4n)!}{(3n)!}}.$

For every positive integer $ n$, let $ \phi(n)$ denotes the number of positive integers less than $ n$ that is relatively prime to $ n$ and $ \tau(n)$ denote the sum of all positive divisors of $ n$. Let $ n$ be a positive integer such that $ \phi(n)|n\minus{}1$ and that $ n$ is not a prime number. Prove that $ \tau(n)>2009$.

Let $N_0=\{0, 1, 2 \cdots \}$. Find all functions: $N_0 \to N_0$ such that: (1) $f(n) < f(n+1)$, all $n \in N_0$; (2) $f(2)=2$; (3) $f(mn)=f(m)f(n)$, all $m, n \in N_0$.

Positive numbers $x$ and $y$ satisfy $xy=2^{15}$ and $\log_2{x} \cdot \log_2{y} = 60$. Find $\sqrt[3]{(\log_2{x})^3+(\log_2{y})^3}$

Real number $C > 1$ is given. Sequence of positive real numbers $a_1, a_2, a_3, \ldots$, in which $a_1=1$ and $a_2=2$, satisfy the conditions \[a_{mn}=a_ma_n, \] \[a_{m+n} \leq C(a_m + a_n),\] for $m, n = 1, 2, 3, \ldots$. Prove that $a_n = n$ for $n=1, 2, 3, \ldots$.

[b]p10 [/b]Kathy has two positive real numbers, $a$ and $b$. She mistakenly writes $$\log (a + b) = \log (a) + \log( b),$$ but miraculously, she finds that for her combination of $a$ and $b$, the equality holds. If $a = 2022b$, then $b = \frac{p}{q}$ , for positive integers $p, q$ where $gcd(p, q) = 1$. Find $p + q$. [b]p11[/b] Points $X$ and $Y$ lie on sides $AB$ and $BC$ of triangle $ABC$, respectively. Ray $\overrightarrow{XY}$ is extended to point $Z$ such that $A, C$, and $Z$ are collinear, in that order. If triangle$ ABZ$ is isosceles and triangle $CYZ$ is equilateral, then the possible values of $\angle ZXB$ lie in the interval $I = (a^o, b^o)$, such that $0 \le a, b \le 360$ and such that $a$ is as large as possible and $b$ is as small as possible. Find $a + b$. [b]p12[/b] Let $S = \{(a, b) | 0 \le a, b \le 3, a$ and $b$ are integers $\}$. In other words, $S$ is the set of points in the coordinate plane with integer coordinates between $0$ and $3$, inclusive. Prair selects four distinct points in $S$, for each selected point, she draws lines with slope $1$ and slope $-1$ passing through that point. Given that each point in $S$ lies on at least one line Prair drew, how many ways could she have selected those four points?

Prove that if $ a,x,y$ are $ p$-adic integers different from $ 0$ and $ p | x, pa | xy$, then \[ \frac 1y \frac{(1\plus{}x)^y\minus{}1}{x} \equiv \frac{\log (1\plus{}x)}{x} \;\;\;\; ( \textrm{mod} \; a\ ) \\\\ .\] [i]L. Redei[/i]

Let $a_n\ (n\geq 1)$ be the value for which $\int_x^{2x} e^{-t^n}dt\ (x\geq 0)$ is maximal. Find $\lim_{n\to\infty} \ln a_n.$

Points $A$ and $B$ lie on the graph of $y=\log_{2}x$. The midpoint of $\overline{AB}$ is $(6, 2)$. What is the positive difference between the $x$-coordinates of $A$ and $B$? $\textbf{(A)}~2\sqrt{11}\qquad\textbf{(B)}~4\sqrt{3}\qquad\textbf{(C)}~8\qquad\textbf{(D)}~4\sqrt{5}\qquad\textbf{(E)}~9$

It is possible to choose $ x > \frac {2}{3}$ in such a way that the value of $ \log_{10}(x^2 \plus{} 3) \minus{} 2 \log_{10}x$ is $ \textbf{(A)}\ \text{negative} \qquad \textbf{(B)}\ \text{zero} \qquad \textbf{(C)}\ \text{one}$ $ \textbf{(D)}\ \text{smaller than any positive number that might be specified}$ $ \textbf{(E)}\ \text{greater than any positive number that might be specified}$

For the function $f(x)=\int_0^x \frac{dt}{1+t^2}$, answer the questions as follows. Note : Please solve the problems without using directly the formula $\int \frac{1}{1+x^2}\ dx=\tan^{-1}x +C$ for Japanese High School students those who don't study arc sin x, arc cos x, arc tanx. (1) Find $f(\sqrt{3})$ (2) Find $\int_0^{\sqrt{3}} xf(x)\ dx$ (3) Prove that for $x>0$. $f(x)+f\left(\frac{1}{x}\right)$ is constant, then find the value.

Find the volume of the solid defined by the inequality $ x^2 \plus{} y^2 \plus{} \ln (1 \plus{} z^2)\leq \ln 2$. Note that you may not directively use double integral here for Japanese high school students who don't study it.

If $y=(\log_23)(\log_34)\cdots(\log_n[n+1])\cdots(\log_{31}32)$ then $\textbf{(A) }4<y<5\qquad\textbf{(B) }y=5\qquad\textbf{(C) }5<y<6\qquad$ $\textbf{(D) }y=6\qquad \textbf{(E) }6<y<7$

Let $n$ be a positive integer. Let $P_n=\{2^n,2^{n-1}\cdot 3, 2^{n-2}\cdot 3^2, \dots, 3^n \}.$ For each subset $X$ of $P_n$, we write $S_X$ for the sum of all elements of $X$, with the convention that $S_{\emptyset}=0$ where $\emptyset$ is the empty set. Suppose that $y$ is a real number with $0 \leq y \leq 3^{n+1}-2^{n+1}.$ Prove that there is a subset $Y$ of $P_n$ such that $0 \leq y-S_Y < 2^n$

Show that $\sum^{\infty}_{n=1}\frac{(-1)^{n-1}\sin(\log n)}{n^\alpha}$ converges iff $\alpha>0$.

If $b>1$, $x>0$ and $(2x)^{\log_b 2}-(3x)^{\log_b 3}=0$, then $x$ is $\text{(A)}\ \frac{1}{216} \qquad \text{(B)}\ \frac{1}{6} \qquad \text{(C)}\ 1 \qquad \text{(D)}\ 6 \qquad \text{(E)}\ \text{not uniquely determined}$

If $ \log_{k}{x}\cdot \log_{5}{k} \equal{} 3$, then $ x$ equals: $ \textbf{(A)}\ k^6\qquad \textbf{(B)}\ 5k^3\qquad \textbf{(C)}\ k^3\qquad \textbf{(D)}\ 243\qquad \textbf{(E)}\ 125$

Let $n$ be a positive integer. Let $\mathcal{F}$ be a family of sets that contains more than half of all subsets of an $n$-element set $X$. Prove that from $\mathcal{F}$ we can select $\lceil \log_2 n \rceil + 1$ sets that form a separating family on $X$, i.e., for any two distinct elements of $X$ there is a selected set containing exactly one of the two elements. Moderator says: http://www.artofproblemsolving.com/Forum/viewtopic.php?f=41&t=614827&hilit=Schweitzer+2014+separating

Show that $\log_{10} 2$ is irrational.

Evaluate \[\lim_{n\to\infty} \sum_{k=1}^n \frac{1}{n+k\sqrt{-1}}\]