Let $A_1A_2A_3 \cdots A_{13}$ be a regular $13$-gon, and let lines $A_6A_7$ and $A_8A_9$ intersect at $B$. Show that the shaded area below is half the area of the entire polygon (including triangle $A_7A_8B$) [asy] size(2inch); pair get_point(int ind) { return dir(90 + (ind + 12) * 360 / 13); } void fill_pts(int[] points) { path p = get_point(points[0]); for (int i = 1; i < points.length; ++i) { p = p -- get_point(points[i]); } p = p -- cycle; filldraw(p, RGB(160, 160, 160), black); } fill_pts(new int[]{12, 13, 2, 3}); fill_pts(new int[]{10, 11, 4, 5}); fill_pts(new int[]{8, 9, 6, 7}); draw(polygon(13)); for (int i = 1; i <= 13; ++i) { label(get_point(i), "$A_{" + (string)(i) + "}$", get_point(i)); dot(get_point(i)); } pair B = intersectionpoint(get_point(8) -- 3 * (get_point(8) - get_point(9)) + get_point(9), get_point(7) -- 3 * (get_point(7) - get_point(6)) + get_point(6)); draw(get_point(7) -- B -- get_point(8)); label("$B$", B, S); dot(B); [/asy]

Evaluate \[\int_0^1 \frac{(x^2+x+1)^3\{\ln (x^2+x+1)+2\}}{(x^2+x+1)^3}(2x+1)e^{x^2+x+1}dx.\]

[b]p1.[/b] $4$ balls are distributed uniformly at random among $6$ bins. What is the expected number of empty bins? [b]p2.[/b] Compute ${150 \choose 20 }$ (mod $221$). [b]p3.[/b] On the right triangle $ABC$, with right angle at$ B$, the altitude $BD$ is drawn. $E$ is drawn on $BC$ such that AE bisects angle $BAC$ and F is drawn on $AC$ such that $BF$ bisects angle $CBD$. Let the intersection of $AE$ and $BF$ be $G$. Given that $AB = 15$,$ BC = 20$, $AC = 25$, find $\frac{BG}{GF}$ . [b]p4.[/b] What is the largest integer $n$ so that $\frac{n^2-2012}{n+7}$ is also an integer? [b]p5.[/b] What is the side length of the largest equilateral triangle that can be inscribed in a regular pentagon with side length $1$? [b]p6.[/b] Inside a LilacBall, you can find one of $7$ different notes, each equally likely. Delcatty must collect all $7$ notes in order to restore harmony and save Kanto from eternal darkness. What is the expected number of LilacBalls she must open in order to do so? PS. You had better use hide for answers.

The graph of the polynomial \[P(x) \equal{} x^5 \plus{} ax^4 \plus{} bx^3 \plus{} cx^2 \plus{} dx \plus{} e\] has five distinct $ x$-intercepts, one of which is at $ (0,0)$. Which of the following coefficients cannot be zero? $ \textbf{(A)}\ a \qquad \textbf{(B)}\ b \qquad \textbf{(C)}\ c \qquad \textbf{(D)}\ d \qquad \textbf{(E)}\ e$

A $10 \times 10$ table consists of $100$ unit cells. A [i]block[/i] is a $2 \times 2$ square consisting of $4$ unit cells of the table. A set $C$ of $n$ blocks covers the table (i.e. each cell of the table is covered by some block of $C$ ) but no $n -1$ blocks of $C$ cover the table. Find the largest possible value of $n$.

Triangle $ABC$ is inscribed into circle $k$. Points $A_1,B_1, C_1$ on its sides were marked, after this the triangle was erased. Prove that it can be restored uniquely if and only if $AA_1, BB_1$ and $CC_1$ concur.

Let $\mathbb N$ be the set of positive integers. Find all functions $f\colon\mathbb N\to\mathbb N$ such that $$\frac{f(x)-f(y)+x+y}{x-y+1}$$ is an integer, for all positive integers $x,y$ with $x>y$.

There are $n$ cities in a country, one of which is the capital. An airline operates bi-directional flights between some pairs of cities such that one can reach any city from any other city. The airline wants to close down some (possibly zero) number of flights, such that the number of flights needed to reach any particular city from the capital does not increase. Suppose that there are an odd number of ways that the airline can do this. Prove that the set of cities can be divided into two groups, such that there is no flight between two cities of the same group. [i]Proposed by Pranjal Srivastava[/i]

Every month a forester Ermolay has planted 2000 trees along a fence. On every tree, he has written how many oaks there are among itself and trees at his right and left. This way a sequence of 2000 numbers was created. How many distinct sequences could the forester Ermolay get? (oak is a certain type of tree) [I]Proposed by A. Khrabrov, D.Rostovski[/i]

Define a sequence of integers by $a_0=1$ , and $a_n=\sum_{k=0}^{n-1} \binom{n}{k}a_k$ , $n \geq 1$ . Let $m$ be a positive integer , let $p$ be a prime , and let $q$ and $r$ be non-negative integers . Prove that : $$a_{p^mq+r} \equiv a_{p^{m-1}q+r} \pmod{p^m}$$

The quadrilateral $ ABCD$ inscribed in a circle wich has diameter $ BD$. Let $ A',B'$ are symmetric to $ A,B$ with respect to the line $ BD$ and $ AC$ respectively. If $ A'C \cap BD \equal{} P$ and $ AC\cap B'D \equal{} Q$ then prove that $ PQ \perp AC$

Find all positive integers $n$ satisfying the following conditions simultaneously: (a) the number of positive divisors of $n$ is not a multiple of $8$; (b) for all integers $x$, we have \[x^n \equiv x \mod n.\] [i] Proposed by usjl[/i]

Let $ ABCD$ be a convex quadrilateral and let $ P$ and $ Q$ be points in $ ABCD$ such that $ PQDA$ and $ QPBC$ are cyclic quadrilaterals. Suppose that there exists a point $ E$ on the line segment $ PQ$ such that $ \angle PAE \equal{} \angle QDE$ and $ \angle PBE \equal{} \angle QCE$. Show that the quadrilateral $ ABCD$ is cyclic. [i]Proposed by John Cuya, Peru[/i]

Prove that for $\forall$ $a,b,c\in [\frac{1}{3},3]$ the following inequality is true: $\frac{a}{a+b}+\frac{b}{b+c}+\frac{c}{c+a}\geq \frac{7}{5}$.

Positive real numbers $ x$, $ y$ satisfy the equations $ x^2 \plus{} y^2 \equal{} 1$ and $ x^4 \plus{} y^4 \equal{} \frac {17}{18}$. Find $ xy$.

Let $A_1A_2A_3 \cdots A_{2013}$ be a cyclic $2013$-gon. Prove that for every point $P$ not the circumcenter of the $2013$-gon, there exists a point $Q\neq P$ such that $\frac{A_iP}{A_iQ}$ is constant for $i \in \{1, 2, 3, \cdots, 2013\}$. [i]Proposed by Robin Park[/i]

Let $m,n$ be positive integers with $m \ge n$. Let $S$ be the set of pairs $(a,b)$ of relatively prime positive integers such that $a,b \le m$ and $a+b > m$. For each pair $(a,b)\in S$, consider the nonnegative integer solution $(u,v)$ to the equation $au - bv = n$ chosen with $v \ge 0$ minimal, and let $I(a,b)$ denote the (open) interval $(v/a, u/b)$. Prove that $I(a,b) \subseteq (0,1)$ for every $(a,b)\in S$, and that any fixed irrational number $\alpha\in(0,1)$ lies in $I(a,b)$ for exactly $n$ distinct pairs $(a,b)\in S$. [i]Victor Wang, inspired by 2013 ISL N7[/i]

Find the area $S$ of the region enclosed by the curve $y=\left|x-\frac{1}{x}\right|\ (x>0)$ and the line $y=2$.

Juan chooses a five-digit positive integer. Maria erases the ones digit and gets a four-digit number. The sum of this four-digit number and the original five-digit number is $52,713$. What can the sum of the five digits of the original number be?

prove the third sylow theorem: suppose that $G$ is a group and $|G|=p^em$ which $p$ is a prime number and $(p,m)=1$. suppose that $a$ is the number of $p$-sylow subgroups of $G$ ($H<G$ that $|H|=p^e$). prove that $a|m$ and $p|a-1$.(Hint: you can use this: every two $p$-sylow subgroups are conjugate.)(20 points)

For each positive integer $ n$, let $ f(n)$ denote the number of ways of representing $ n$ as a sum of powers of 2 with nonnegative integer exponents. Representations which differ only in the ordering of their summands are considered to be the same. For instance, $ f(4) \equal{} 4$, because the number 4 can be represented in the following four ways: 4; 2+2; 2+1+1; 1+1+1+1. Prove that, for any integer $ n \geq 3$ we have $ 2^{\frac {n^2}{4}} < f(2^n) < 2^{\frac {n^2}2}$.

A triangle $ABC$ is given. Find all the pairs of points $X,Y$ so that $X$ is on the sides of the triangle, $Y$ is inside the triangle, and four non-intersecting segments from the set $\{XY, AX, AY, BX,BY, CX, CY\}$ divide the triangle $ABC$ into four triangles with equal areas.

Determine all non empty sets $C_1, C_2, C_3, \cdots $ such that each one of them has a finite number of elements, all their elements are positive integers, and they satisfy the following property: For any positive integers $n$ and $m$, the number of elements in the set $C_n$ plus the number of elements in the set $C_m$ equals the sum of the elements in the set $C_{m + n}$. [i]Note:[/i] We denote $\lvert C_n \lvert$ the number of elements in the set $C_n$, and $S_k$ as the sum of the elements in the set $C_n$ so the problem's condition is that for every $n$ and $m$: \[\lvert C_n \lvert + \lvert C_m \lvert = S_{n + m}\] is satisfied.

Consider the property that each a element of a group $G$ satisfies $a ^ 2 = e$, where e is the identity element of the group. Which of the following statements is not always valid for a group $G$ with this property? (a) $G$ is commutative (b) $G$ has infinite or even order (c) $G$ is Noetherian (d) $G$ is vector space over $\mathbb{Z}_2$

Let the tangent line passing through a point $A$ outside the circle with center $O$ touches the circle at $B$ and $C$. Let $[BD]$ be the diameter of the circle. Let the lines $CD$ and $AB$ meet at $E$. If the lines $AD$ and $OE$ meet at $F$, find $|AF|/|FD|$.