What is the value of \[(\log 5)^{3}+(\log 20)^{3}+(\log 8)(\log 0.25)\] where $\log$ denotes the base-ten logarithm? $\textbf{(A)}~\displaystyle\frac{3}{2}\qquad\textbf{(B)}~\displaystyle\frac{7}{4}\qquad\textbf{(C)}~2\qquad\textbf{(D)}~\displaystyle\frac{9}{4}\qquad\textbf{(E)}~3$

Alex has one-pound red bricks and two-pound blue bricks, and has 360 total pounds of brick. He observes that it is impossible to rearrange the bricks into piles that all weigh three pounds, but he can put them in piles that each weigh five pounds. Finally, when he tries to put them into piles that all have three bricks, he has one left over. If Alex has $r$ red bricks, find the number of values $r$ could take on.

Let be a finite group $ G $ having an endomorphism $ \eta $ that has exactly one fixed point. [b]a)[/b] Demonstrate that the function $ f:G\longrightarrow G $ defined as $ f(x)=x^{-1}\cdot\eta (x) $ is bijective. [b]b)[/b] Show that $ G $ is commutative if the composition of the function $ f $ from [b]a)[/b] with itself is the identity function.

In regular tetrahedron $ABCD$, $E,F,G$ are midpoints of $AB,BC,CD$. Dihedral angle $C-FG-E$ is equal to $\text{(A)}\arcsin\frac{\sqrt6}{3}\qquad\text{(B)}\frac{\pi}{2}+\arccos\frac{\sqrt3}{3}\qquad\text{(C)}\frac{\pi}{2}-\arctan{\sqrt2}\qquad\text{(D)}\pi-\text{arccot}\frac{\sqrt2}{2}$

Let $x,y,z$ be non-negative numbers such that $x+y+z \leq 3$. Prove that $$\frac{2}{1+x}+\frac{2}{1+y}+\frac{2}{1+z} \geq 3$$

A positive integer is [i]dapper[/i] if at least one of its multiples begins with $ 2008$. For example, $ 7$ is dapper because $ 200858$ is a multiple of $ 7$ and begins with $ 2008$. Observe that $ 200858 \equal{} 28694\times 7$. Prove that every positive integer is dapper.

How many integers $ x $ satisfy $ x^2 - 9x + 18 < 0 $?

Let $S$ be the set of positive integers $n$ such that \[3\cdot \varphi (n)=n,\] where $\varphi (n)$ is the number of positive integers $k\leq n$ such that $\gcd (k, n)=1$. Find \[\sum_{n\in S} \, \frac{1}{n}.\] [i]Proposed by Nathan Ramesh

Let $[ABC]$ be a triangle and $D$ a point between $A$ and $B$. If the triangles $[ABC], [ACD]$ and $[BCD]$ are all isosceles, what are the possible values of $\angle ABC$?

What is the $100th$ number in the arithmetic sequence: $ 1,5,9,13,17,21,25,... $ $ \text{(A)}\ 397\qquad\text{(B)}\ 399\qquad\text{(C)}\ 401\qquad\text{(D)}\ 403\qquad\text{(E)}\ 405 $

Prove that for any $a;b;c\in\mathbb{R^+}$, we have $$(a+b)^2+(a+b+4c)^2\geq \frac{100abc}{a+b+c}$$ When does the equality hold?

There are $1000$ rooms in a row along a long corridor. Initially the first room contains $1000$ people and the remaining rooms are empty. Each minute, the following happens: for each room containing more than one person, someone in that room decides it is too crowded and moves to the next room. All these movements are simultaneous (so nobody moves more than once within a minute). After one hour, how many different rooms will have people in them?

A permutation of the integers $1, 2, \ldots, m$ is called [i]fresh[/i] if there exists no positive integer $k < m$ such that the first $k$ numbers in the permutation are $1, 2, \ldots, k$ in some order. Let $f_m$ be the number of fresh permutations of the integers $1, 2, \ldots, m$. Prove that $f_n \ge n \cdot f_{n - 1}$ for all $n \ge 3$. [i]For example, if $m = 4$, then the permutation $(3, 1, 4, 2)$ is fresh, whereas the permutation $(2, 3, 1, 4)$ is not.[/i]

How many positive integers $n$ are there such that the equation $\left \lfloor \sqrt[3] {7n + 2} \right \rfloor = \left \lfloor \sqrt[3] {7n + 3} \right \rfloor $ does not hold? $ \textbf{a)}\ 0 \qquad\textbf{b)}\ 1 \qquad\textbf{c)}\ 7 \qquad\textbf{d)}\ \text{Infinitely many} \qquad\textbf{e)}\ \text{None of above} $

Positive real numbers $a$ and $b$ have the property that \[ \sqrt{\log{a}} + \sqrt{\log{b}} + \log \sqrt{a} + \log \sqrt{b} = 100 \] and all four terms on the left are positive integers, where $\text{log}$ denotes the base 10 logarithm. What is $ab$? $\textbf{(A) } 10^{52} \qquad \textbf{(B) } 10^{100} \qquad \textbf{(C) } 10^{144} \qquad \textbf{(D) } 10^{164} \qquad \textbf{(E) } 10^{200} $

Let $ABCDEF$ be a convex hexagon whose vertices lie on a circle. Suppose that $AB\cdot CD\cdot EF = BC\cdot DE\cdot FA$. Show that the diagonals $AD, BE$ and $CF$ are concurrent.

Assume that $x, y \ge 0$. Show that $x^2 + y^2 + 1 \le \sqrt{(x^3 + y + 1)(y^3 + x + 1)}$.

Suppose that $n$ consecutive positive integers were written on the board, where $n > 6$. Then some $5$ of the written numbers were erased, and it turned out that any two of the remaining numbers are coprime. Find the largest possible value of $n$.

For each letter in the English alphabet, William assigns an English word which contains that letter. His first document consists only of the word assigned to the letter $A$. In each subsequent document, he replaces each letter of the preceding document by its assigned word. The fortieth document begins with “Till whatsoever star that guides my moving.” Prove that this sentence reappears later in this document.

Let the sequence $(a_n)$ be defined as $a_1=\frac 13$ and $a_{n+1}=\frac{a_n}{\sqrt{1+13a_n^2}}$ for every $n\geq 1$. If $a_k$ is the largest term of the sequence satisfying $a_k < \frac 1{50}$, what is $k$? $ \textbf{(A)}\ 194 \qquad\textbf{(B)}\ 193 \qquad\textbf{(C)}\ 192 \qquad\textbf{(D)}\ 191 \qquad\textbf{(E)}\ \text{None of the above} $

By a partition $\pi$ of an integer $n\ge 1$, we mean here a representation of $n$ as a sum of one or more positive integers where the summands must be put in nondecreasing order. (E.g., if $n=4$, then the partitions $\pi$ are $1+1+1+1$, $1+1+2$, $1+3, 2+2$, and $4$). For any partition $\pi$, define $A(\pi)$ to be the number of $1$'s which appear in $\pi$, and define $B(\pi)$ to be the number of distinct integers which appear in $\pi$. (E.g., if $n=13$ and $\pi$ is the partition $1+1+2+2+2+5$, then $A(\pi)=2$ and $B(\pi) = 3$). Prove that, for any fixed $n$, the sum of $A(\pi)$ over all partitions of $\pi$ of $n$ is equal to the sum of $B(\pi)$ over all partitions of $\pi$ of $n$.

Prove that there exist infinitely many natural numbers $n$, for which there $\exists \, f:\{0,1…n-1\}\rightarrow \{0,1…n-1\}$, satisfying the following conditions: 1) $f(x)\neq x$; 2) $f(f(x))=x$; 3) $f(f(f(x+1)+1)+1)=x$ for $\forall x\in \{0,1…n-1\}$.

[b]p1.[/b] We say that integers $a$ and $b$ are [i]friends [/i] if their product is a perfect square. Prove that if $a$ is a friend of $b$, then $a$ is a friend of $gcd (a, b)$. [b]p2.[/b] On the island of knights and liars, a traveler visited his friend, a knight, and saw him sitting at a round table with five guests. "I wonder how many knights are among you?" he asked. " Ask everyone a question and find out yourself" advised him one of the guests. "Okay. Tell me one: Who are your neighbors?" asked the traveler. This question was answered the same way by all the guests. "This information is not enough!" said the traveler. "But today is my birthday, do not forget it!" said one of the guests. "Yes, today is his birthday!" said his neighbor. Now the traveler was able to find out how many knights were at the table. Indeed, how many of them were there if [i]knights always tell the truth and liars always lie[/i]? [b]p3.[/b] A rope is folded in half, then in half again, then in half yet again. Then all the layers of the rope were cut in the same place. What is the length of the rope if you know that one of the pieces obtained has length of $9$ meters and another has length $4$ meters? [b]p4.[/b] The floor plan of the palace of the Shah is a square of dimensions $6 \times 6$, divided into rooms of dimensions $1 \times 1$. In the middle of each wall between rooms is a door. The Shah orders his architect to eliminate some of the walls so that all rooms have dimensions $2 \times 1$, no new doors are created, and a path between any two rooms has no more than $N$ doors. What is the smallest value of $N$ such that the order could be executed? [b]p5.[/b] There are $10$ consecutive positive integers written on a blackboard. One number is erased. The sum of remaining nine integers is $2011$. Which number was erased? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $f: [0,1]\rightarrow(0,+\infty)$ be a continuous function. a) Show that for any integer $n\geq 1$, there is a unique division $0=a_{0}<a_{1}<\ldots<a_{n}=1$ such that $\int_{a_{k}}^{a_{k+1}}f(x)\, dx=\frac{1}{n}\int_{0}^{1}f(x)\, dx$ holds for all $k=0,1,\ldots,n-1$. b) For each $n$, consider the $a_{i}$ above (that depend on $n$) and define $b_{n}=\frac{a_{1}+a_{2}+\ldots+a_{n}}{n}$. Show that the sequence $(b_{n})$ is convergent and compute it's limit.

Let $ABCD$ be a unit square, and suppose that $E$ and $F$ are on $\overline{AD}$ and $\overline{AB}$ such that $AE = AF = \tfrac23$. Let $\overline{CE}$ and $\overline{DF}$ intersect at $G$. If the area of $\triangle CFG$ can be expressed as simplified fraction $\frac{p}{q}$, find $p + q$. Let $T = TNYWR$. A total of $2T$ students go on a road trip. They take two cars, each of which seats $T$ people. Call two students \textit{friendly} if they sat together in the same car going to the trip and in the same car going back home. What is the smallest possible number of friendly pairs of students on the trip?