What is the value of $[\log_{10}(5\log_{10}100)]^2$? ${{ \textbf{(A)}\ \log_{10}50 \qquad\textbf{(B)}\ 25\qquad\textbf{(C)}\ 10 \qquad\textbf{(D)}\ 2}\qquad\textbf{(E)}\ 1 } $

2008 persons take part in a programming contest. In one round, the 2008 programmers are divided into two groups. Find the minimum number of groups such that every two programmers ever be in the same group.

Prove that $1980^{1981^{1982}} + 1982^{1981^{1980}}$ is divisible by $1981^{1981}$.

Let $f(x) = (x^2+3x+2)^{\cos(\pi x)}$. Find the sum of all positive integers $n$ for which \[\left| \sum_{k=1}^n \log_{10} f(k) \right| = 1.\]

Let $a\in \mathbb{R}_+$ and define the sequence of real numbers $(x_n)_n$ by $x_1=a$ and $x_{n+1}=\left|x_n-\frac{1}{n}\right|,\ n\ge 1$. Prove that the sequence is convergent and find it's limit.

Prove that the inequality $ (x^{k}\minus{}y^{k})^{n}<(x^{n}\minus{}y^{n})^{k}$ holds forall reals $ x>y>0$ and positive integers $ n>k$.

$ \lim_{n\to\infty }\frac{1}{\sqrt[n]{n!}}\left\lfloor \log_5 \sum_{k=2}^{1+5^n} \sqrt[5^n]{k} \right\rfloor $ [i]Taclit Daniela Nadia[/i]

For a non negative integer $n$, set t $I_n=\int_0^{\frac{\pi}{4}} \tan ^ n x\ dx$ to answer the following questions: (1) Calculate $I_{n+2}+I_n.$ (2) Evaluate the values of $I_1,\ I_2$ and $I_3.$ 1978 Niigata university entrance exam

Prove that : $\ln \frac{11}{27}<\int_{\frac 14}^{\frac 34} \frac{1}{\ln (1-x)}\ dx<\ln \frac{7}{15}.$

Let $\displaystyle a,b,c,d \in \mathbb R$ such that $\displaystyle a>c>d>b>1$ and $\displaystyle ab>cd$. Prove that $\displaystyle f : \left[ 0,\infty \right) \to \mathbb R$, defined through \[ \displaystyle f(x) = a^x+b^x-c^x-d^x, \, \forall x \geq 0 , \] is strictly increasing.

Let $P_k$ be a point whose $x$-coordinate is $1+\frac{k}{n}\ (k=1,\ 2,\ \cdots,\ n)$ on the curve $y=\ln x$. For $A(1,\ 0)$, find the limit $\lim_{n\to\infty} \frac{1}{n}\sum_{k=1}^{n} \overline{AP_k}^2.$

In the universe of Pi Zone, points are labeled with $2 \times 2$ arrays of positive reals. One can teleport from point $M$ to point $M'$ if $M$ can be obtained from $M'$ by multiplying either a row or column by some positive real. For example, one can teleport from $\left( \begin{array}{cc} 1 & 2 \\ 3 & 4 \end{array} \right)$ to $\left( \begin{array}{cc} 1 & 20 \\ 3 & 40 \end{array} \right)$ and then to $\left( \begin{array}{cc} 1 & 20 \\ 6 & 80 \end{array} \right)$. A [i]tourist attraction[/i] is a point where each of the entries of the associated array is either $1$, $2$, $4$, $8$ or $16$. A company wishes to build a hotel on each of several points so that at least one hotel is accessible from every tourist attraction by teleporting, possibly multiple times. What is the minimum number of hotels necessary? [i]Proposed by Michael Kural[/i]

Of the following (1) $ a(x\minus{}y)\equal{}ax\minus{}ay$ (2) $ a^{x\minus{}y}\equal{}a^x\minus{}a^y$ (3) $ \log (x\minus{}y)\equal{}\log x\minus{}\log y$ (4) $ \frac {\log x}{\log y}\equal{} \log{x}\minus{} \log{y}$ (5) $ a(xy)\equal{}ax\times ay$ $\textbf{(A)}\ \text{Only 1 and 4 are true} \qquad\\ \textbf{(B)}\ \text{Only 1 and 5 are true} \qquad\\ \textbf{(C)}\ \text{Only 1 and 3 are true} \qquad\\ \textbf{(D)}\ \text{Only 1 and 2 are true} \qquad\\ \textbf{(E)}\ \text{Only 1 is true}$

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$

Show that for all integers $n>1$, \[ \dfrac {1}{2ne} < \dfrac {1}{e} - \left( 1 - \dfrac {1}{n} \right)^n < \dfrac {1}{ne}. \]

Find all increasing functions $f$ from the nonnegative integers to the integers satisfying $f(2)=7$ and \[ f(mn) = f(m) + f(n) + f(m)f(n) \] for all nonnegative integers $m$ and $n$.

Throw $ n$ balls in to $ 2n$ boxes.　Suppose each ball comes into each box with equal probability of entering in any boxes. Let $ p_n$ be the probability such that any box has ball less than or equal to one. Find the limit $ \lim_{n\to\infty} \frac{\ln p_n}{n}$

The product \[\prod^{63}_{k=4} \frac{\log_k (5^{k^2 - 1})}{\log_{k + 1} (5^{k^2 - 4})} = \frac{\log_4 (5^{15})}{\log_5 (5^{12})} \cdot \frac{\log_5 (5^{24})}{\log_6 (5^{21})}\cdot \frac{\log_6 (5^{35})}{\log_7 (5^{32})} \cdots \frac{\log_{63} (5^{3968})}{\log_{64} (5^{3965})}\] is equal to $\tfrac mn,$ where $m$ and $n$ are relatively prime positive integers. Find $m + n.$

Evaluate $ \int_{\frac{\pi}{3}}^{\frac{\pi}{2}} \frac{1}{1\plus{}\sin \theta \minus{}\cos \theta}\ d\theta$

The value of $x$ that satisfies $\log_{2^x} 3^{20} = \log_{2^{x+3}} 3^{2020}$ can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Hi guys, I was just reading over old posts that I made last year ( :P ) and saw how much the level of Getting Started became harder. To encourage more people from posting, I decided to start a Problem of the Day. This is how I'll conduct this: 1. In each post (not including this one since it has rules, etc) everyday, I'll post the problem. I may post another thread after it to give hints though. 2. Level of problem.. This is VERY important. All problems in this thread will be all AHSME or problems similar to this level. No AIME. Some AHSME problems, however, that involve tough insight or skills will not be posted. The chosen problems will be usually ones that everyone can solve after working. Calculators are allowed when you solve problems but it is NOT necessary. 3. Response.. All you have to do is simply solve the problem and post the solution. There is no credit given or taken away if you get the problem wrong. This isn't like other threads where the number of problems you get right or not matters. As for posting, post your solutions here in this thread. Do NOT PM me. Also, here are some more restrictions when posting solutions: A. No single answer post. It doesn't matter if you put hide and say "Answer is ###..." If you don't put explanation, it simply means you cheated off from some other people. I've seen several posts that went like "I know the answer" and simply post the letter. What is the purpose of even posting then? Huh? B. Do NOT go back to the previous problem(s). This causes too much confusion. C. You're FREE to give hints and post different idea, way or answer in some cases in problems. If you see someone did wrong or you don't understand what they did, post here. That's what this thread is for. 4. Main purpose.. This is for anyone who visits this forum to enjoy math. I rememeber when I first came into this forum, I was poor at math compared to other people. But I kindly got help from many people such as JBL, joml88, tokenadult, and many other people that would take too much time to type. Perhaps without them, I wouldn't be even a moderator in this forum now. This site clearly made me to enjoy math more and more and I'd like to do the same thing. That's about the rule.. Have fun problem solving! Next post will contain the Day 1 Problem. You can post the solutions until I post one. :D

Let $ H$ denote the set of those natural numbers for which $ \tau(n)$ divides $ n$, where $ \tau(n)$ is the number of divisors of $ n$. Show that a) $ n! \in H$ for all sufficiently large $ n$, b)$ H$ has density $ 0$. [i]P. Erdos[/i]

Find the infinite integrals as follows. (1) 2013 Hiroshima City University entrance exam/Informatic Science $\int \frac{x^2}{2-x^2}dx$ (2) 2013 Kanseigakuin University entrance exam/Science and Technology $\int x^4\ln x\ dx$ (3) 2013 Shinsyu University entrance exam/Textile Science and Technology, Second-exam $\int \frac{\cos ^ 3 x}{\sin ^ 2 x}\ dx$

Let $a_1,a_2,a_3,\ldots,a_n$ be a sequence of non-negative integers, where $n$ is a positive integer. Let \[ A_n={a_1+a_2+\cdots+a_n\over n}\ . \] Prove that \[ a_1!a_2!\ldots a_n!\ge\left(\lfloor A_n\rfloor !\right)^n \] where $\lfloor A_n\rfloor$ is the greatest integer less than or equal to $A_n$, and $a!=1\times 2\times\cdots\times a$ for $a\ge 1$(and $0!=1$). When does equality hold?

Let $ f$ be a function given by $ f(x) = \lg(x+1)-\frac{1}{2}\cdot\log_{3}x$. a) Solve the equation $ f(x) = 0$. b) Find the number of the subsets of the set \[ \{n | f(n^{2}-214n-1998) \geq 0,\ n \in\mathbb{Z}\}.\]