Prove that : \[\pi (e-1)<\int_0^{\pi} e^{|\cos 4x|}dx<2(e^{\frac{\pi}{2}}-1)\]

A deck of eight cards has cards numbered $1, 2, 3, 4, 5, 6, 7, 8$, in that order, and a deck of five cards has cards numbered $1, 2, 3, 4, 5$, in that order. The two decks are riffle-shuffled together to form a deck with $13$ cards with the cards from each deck in the same order as they were originally. Thus, numbers on the cards might end up in the order $1122334455678$ or $1234512345678$ but not $1223144553678$. Find the number of possible sequences of the $13$ numbers.

A net for a polyhedron is cut along an edge to give two [b]pieces[/b]. For example, we may cut a cube net along the red edge to form two pieces as shown. [asy] size(5.5cm); draw((1,0)--(1,4)--(2,4)--(2,0)--cycle); draw((1,1)--(2,1)); draw((1,2)--(2,2)); draw((1,3)--(2,3)); draw((0,1)--(3,1)--(3,2)--(0,2)--cycle); draw((2,1)--(2,2),red+linewidth(1.5)); draw((3.5,2)--(5,2)); filldraw((4.25,2.2)--(5,2)--(4.25,1.8)--cycle,black); draw((6,1.5)--(10,1.5)--(10,2.5)--(6,2.5)--cycle); draw((7,1.5)--(7,2.5)); draw((8,1.5)--(8,2.5)); draw((9,1.5)--(9,2.5)); draw((7,2.5)--(7,3.5)--(8,3.5)--(8,2.5)--cycle); draw((11,1.5)--(11,2.5)--(12,2.5)--(12,1.5)--cycle); [/asy] Are there two distinct polyhedra for which this process may result in the same two pairs of pieces? If you think the answer is no, prove that no pair of polyhedra can result in the same two pairs of pieces. If you think the answer is yes, provide an example; a clear example will suffice as a proof.

Find all functions $ f: \mathbb{Q} \rightarrow \mathbb{Q}$ such that: $ f(x\plus{}f(y))\equal{}y\plus{}f(x)$ for all $ x,y \in \mathbb{Q}$.

Let $\pi$ be a permutation of the numbers from $ 2$ through $2012$. Find the largest possible value of $$\log_2 \pi(2) \cdot \log_3 \pi(3) ...\log_{2012} \pi(2012).$$

Find all pairs of primes $(p, q)$ for which $p-q$ and $pq-q$ are both perfect squares.

Maria Ivanovna drew on the blackboard a right triangle $ABC$ with a right angle $B$. Three students looked at her and said: $\bullet$ Yura said: "The hypotenuse of this triangle is $10$ cm." $\bullet$ Roma said: "The altitude drawn from the vertex $B$ on the side $AC$ is $6$ cm." $\bullet$ Seva said: "The area of the triangle $ABC$ is $25$ cm$^2$." Determine which of the students was mistaken if it is known that there is exactly one such person.

Let $P(x)=x^3-\tfrac{3}{2}x^2+x+\tfrac{1}{4}$. Let $P^{[1]}(x)=P(x)$, and for $n\ge1$, let $P^{n+1}(x)=P^{[n]}(P(x))$. Evaluate: \[ \displaystyle\int_{0}^{1} P^{[2004]} (x) \ \mathrm{d}x. \]

Given that \[ \frac{\cos(x) \plus{} \cos(y) \plus{} \cos(z)}{\cos(x\plus{}y\plus{}z)} \equal{} \frac{\sin(x)\plus{} \sin(y) \plus{} \sin(z)}{\sin(x \plus{} y \plus{} z)} \equal{} a,\] show that \[ \cos(y\plus{}z) \plus{} \cos(z\plus{}x) \plus{} \cos(x\plus{}y) \equal{} a.\]

$300$ couples (one man, one woman) are invited to a party. Everyone at the party either always tells the truth or always lies. Exactly $2/3$ of the men say their partner always tells the truth and the remaining $1/3$ say their partner always lies. Exactly $2/3$ of the women say their partner is the same type as themselves and the remaining $1/3$ say their partner is different. Find $a$, the maximum possible number of people who tell the truth, and $b$, the minimum possible number of people who tell the truth. Express your answer as $(a,b)$.

Quadrilateral $ABCD$ is inscribed inside a circle with $\angle BAC= 70^{\circ}, \angle ADB= 40^{\circ}, AD=4$, and $BC=6$. What is $AC$? $\textbf{(A) }3+\sqrt{5}\qquad\textbf{(B) }6\qquad\textbf{(C) }\frac{9}{2}\sqrt{2}\qquad\textbf{(D) }8-\sqrt{2}\qquad\textbf{(E) }7$

If $ (a,b)$ and $ (c,d)$ are two points on the line whose equation is $ y\equal{}mx\plus{}k$, then the distance between $ (a,b)$ and $ (c,d)$, in terms of $ a$, $ c$, and $ m$, is $ \textbf{(A)}\ |a\minus{}c|\sqrt{1\plus{}m^2} \qquad \textbf{(B)}\ |a\plus{}c|\sqrt{1\plus{}m^2} \qquad \textbf{(C)}\ \frac{|a\minus{}c|}{\sqrt{1\plus{}m^2}} \qquad$ $ \textbf{(D)}\ |a\minus{}c|(1\plus{}m^2) \qquad \textbf{(E)}\ |a\minus{}c|$ $ |m|$

$1$ cow can produce $3$ gallons of milk each day. How many cows would it take to produce $210$ gallons of milk in a week? $\textbf{(A) } 3\qquad\textbf{(B) } 7\qquad\textbf{(C) } 10\qquad\textbf{(D) } 30\qquad\textbf{(E) } 70$

Let $ABC$ be a triangle with $AB=26$, $AC=28$, $BC=30$. Let $X$, $Y$, $Z$ be the midpoints of arcs $BC$, $CA$, $AB$ (not containing the opposite vertices) respectively on the circumcircle of $ABC$. Let $P$ be the midpoint of arc $BC$ containing point $A$. Suppose lines $BP$ and $XZ$ meet at $M$ , while lines $CP$ and $XY$ meet at $N$. Find the square of the distance from $X$ to $MN$. [i]Proposed by Michael Kural[/i]

In maths class Albrecht had to compute $(a+2b-3)^2$ . His result was $a^2 +4b^2-9$ . ‘This is not correct’ said his teacher, ‘try substituting positive integers for $a$ and $b$.’ Albrecht did so, but his result proved to be correct. What numbers could he substitute? a) Show a good substitution. b) Give all the pairs that Albrecht could substitute and prove that there are no more.

The incircle of the triangle $ABC$ is tangent to sides $AC$ and $BC$ at $M$ and $N$, respectively. The bisectors of the angles at $A$ and $B$ intersect $MN$ at points $P$ and $Q$, respectively. Let $O$ be the incentre of $\triangle ABC$. Prove that $MP\cdot OA=BC\cdot OQ$.

No two of $20$ students in a class have the same scores on both written and oral examinations in mathematics. We say that student $A$ is better than $B$ if his two scores are greater than or equal to the corresponding scores of $B$. The scores are integers between $1$ and $10$. (a) Show that there exist three students $A,B,C$ such that $A$ is better than $B$ and $B$ is better than $C$. (b) Would the same be true for a class of $19$ students?

Let $n$ be a positive integer with $d$ digits, all different from zero. For $k = 0,. . . , d - 1$, we define $n_k$ as the number obtained by moving the last $k$ digits of $n$ to the beginning. For example, if $n = 2184$ then $n_0 = 2184, n_1 = 4218, n_2 = 8421, n_3 = 1842$. For $m$ a positive integer, define $s_m(n)$ as the number of values $k$ ​​such that $n_k$ is a multiple of $m.$ Finally, define $a_d$ as the number of integers $n$ with $d$ digits all nonzero, for which $s_2 (n) + s_3 (n) + s_5 (n) = 2d.$ Find \[\lim_{d \to \infty} \frac{a_d}{5^d}.\]

Let $P(x)=a_nx^n+a_{n-1}x^{n-1}+\cdots+a_0$ and $Q(x)=b_nx^n+b_{n-1}x^{n-1}+\cdots+b_0$ be two polynomials with integral coefficients such that $a_n-b_n$ is a prime and $a_nb_0-a_0b_n\neq 0,$ and $a_{n-1}=b_{n-1}.$ Suppose that there exists a rational number $r$ such that $P(r)=Q(r)=0.$ Prove that $r\in\mathbb Z.$

A function $f(x)$ is such that for any integer $x$, $f(x)+xf(2-x)=6$. Compute $-2019f(2020)$.

A cat is tied to one corner of the base of a tower. The base forms an equilateral triangle of side length $4$ m, and the cat is tied with a leash of length $8$ m. Let $A$ be the area of the region accessible to the cat. If we write $A = \frac{m}{n} k - \sqrt{\ell}$, where $m,n, k, \ell$ are positive integers such that $m$ and $n$ are relatively prime, and $\ell$ is squarefree, what is the value of $m + n + k + \ell$ ?

Find the largest $r$ such that $4$ balls each of radius $r$ can be packed into a regular tetrahedron with side length $1$. In a packing, each ball lies outside every other ball, and every ball lies inside the boundaries of the tetrahedron. If $r$ can be expressed in the form $\frac{\sqrt{a}+b}{c}$ where $a, b, c$ are integers such that $\gcd(b, c) = 1$, what is $a + b + c$?

Determine if there is an infinite sequence $a_1,a_2,a_3,...,a_n$ of positive integers such that for all $n\ge 1$ the sum $a_1^2+a_2^2+a_3^2+...^2+a_n^2$ is a perfect square

Let $a, b, c, d$ be four positive real numbers. Prove that $$\frac{(a + b + c)^2}{a^2+b^2+c^2}+\frac{(b + c + d)^3}{b^3+c^3+d^3}+\frac{(c+d+a)^4}{c^4+d^4+a^4}+\frac{(d+a+b)^5}{d^5+a^5+b^5}\le 120$$

A hunter and an invisible rabbit play a game in the Euclidean plane. The rabbit's starting point, $A_0,$ and the hunter's starting point, $B_0$ are the same. After $n-1$ rounds of the game, the rabbit is at point $A_{n-1}$ and the hunter is at point $B_{n-1}.$ In the $n^{\text{th}}$ round of the game, three things occur in order: [list=i] [*]The rabbit moves invisibly to a point $A_n$ such that the distance between $A_{n-1}$ and $A_n$ is exactly $1.$ [*]A tracking device reports a point $P_n$ to the hunter. The only guarantee provided by the tracking device to the hunter is that the distance between $P_n$ and $A_n$ is at most $1.$ [*]The hunter moves visibly to a point $B_n$ such that the distance between $B_{n-1}$ and $B_n$ is exactly $1.$ [/list] Is it always possible, no matter how the rabbit moves, and no matter what points are reported by the tracking device, for the hunter to choose her moves so that after $10^9$ rounds, she can ensure that the distance between her and the rabbit is at most $100?$ [i]Proposed by Gerhard Woeginger, Austria[/i]