Let $ ABCD $ be a convex quadrilateral. Let angle bisectors of $ \angle B $ and $ \angle C $ intersect at $ E $. Let $ AB $ intersect $ CD $ at $ F $. Prove that if $ AB+CD=BC $, then $A,D,E,F$ is cyclic.

How many ways can you color a necklace of $7$ beads with $4$ colors so that no two adjacent beads have the same color?

Point $E$ is on side $CD$ of rectangle $ABCD$ such that $\frac{CE}{DE} =\frac{2}{5}.$ If the area of triangle $BCE$ is $30$, what is the area of rectangle $ABCD$?

Circles with centers $ O$ and $ P$ have radii 2 and 4, respectively, and are externally tangent. Points $ A$ and $ B$ are on the circle centered at $ O$, and points $ C$ and $ D$ are on the circle centered at $ P$, such that $ \overline{AD}$ and $ \overline{BC}$ are common external tangents to the circles. What is the area of hexagon $ AOBCPD$? [asy] unitsize(0.4 cm); defaultpen(linewidth(0.7) + fontsize(11)); pair A, B, C, D; pair[] O; O[1] = (6,0); O[2] = (12,0); A = (32/6,8*sqrt(2)/6); B = (32/6,-8*sqrt(2)/6); C = 2*B; D = 2*A; draw(Circle(O[1],2)); draw(Circle(O[2],4)); draw((0.7*A)--(1.2*D)); draw((0.7*B)--(1.2*C)); draw(O[1]--O[2]); draw(A--O[1]); draw(B--O[1]); draw(C--O[2]); draw(D--O[2]); label("$A$", A, NW); label("$B$", B, SW); label("$C$", C, SW); label("$D$", D, NW); dot("$O$", O[1], SE); dot("$P$", O[2], SE); label("$2$", (A + O[1])/2, E); label("$4$", (D + O[2])/2, E);[/asy] $ \textbf{(A) } 18\sqrt {3} \qquad \textbf{(B) } 24\sqrt {2} \qquad \textbf{(C) } 36 \qquad \textbf{(D) } 24\sqrt {3} \qquad \textbf{(E) } 32\sqrt {2}$

The Fort Worth Zoo has a number of two-legged birds and a number of four-legged mammals. On one visit to the zoo, Margie counted 200 heads and 522 legs. How many of the animals that Margie counted were two-legged birds? $\textbf{(A)}\hspace{.05in}61 \qquad \textbf{(B)}\hspace{.05in}122 \qquad \textbf{(C)}\hspace{.05in}139 \qquad \textbf{(D)}\hspace{.05in}150 \qquad \textbf{(E)}\hspace{.05in}161 $

Prove that however we choose the majority of numbers among an even number of the first consecutive natural numbers, there will be two numbers among this choosing whose sum is a prime.

Let $N$ be the number of tuples $(a_1, a_2,..., a_{150})$ satisfying: $\bullet$ $a_i \in \{2, 3, 5, 7, 11\}$ for all $1 \le i \le 99$. $\bullet$ $a_i \in \{2, 4, 6, 8\}$ for all $100 \le i \le 150$. $\bullet$ $\sum^{150}_{i=1}a_i$ is divisible by $8$. Compute the last three digits of $N$.

Do there exist natural numbers $a, b$ and $c$ such that $a^2+b^2+c^2$ is divisible by $2013(ab+bc+ca)$? [i]Proposed by Mahan Malihi[/i]

Calamitous Clod deceives the math beasts by changing a clock at Beast Academy. First, he removes both the minute and hour hands, then places each of them back in a random position, chosen uniformly along the circle. Professor Grok notices that the clock is not displaying a valid time. That is, the hour and minute hands are pointing in an orientation that a real clock would never display. One such example is the hour hand pointed at $6$ and the minute hand pointed at $3$. [center] [asy] import olympiad; size(4cm); defaultpen(fontsize(8pt)); draw(circle(origin, 4)); dot(origin); for(int i = 1; i <= 12; ++i){ label("$"+string(i)+"$", (3.6*sin(i * pi/6), 3.6*cos(i * pi/6))); } draw(origin -- (3.2, 0), EndArrow(5)); draw(origin -- (0, -2.2), EndArrow(5)); [/asy] [/center] The math beasts can fix this, though. They can turn both hands by the same number of degrees clockwise. On average, what is the minimal number of degrees they must turn the hands so that they display a valid time?

Find the number of positive integers $m$ for which there exist nonnegative integers $x_0,x_1,\ldots,x_{2011}$ such that \[ m^{x_0}=\sum_{k=1}^{2011}m^{x_k}. \]

Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the sequence $1$, $2$, $\dots$ , $n$ satisfying $$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$. Proposed by United Kingdom

Determine if there is a power of 5 that begins with 2022.

we have an isogonal triangle $ABC$ such that $BC=AB$. take a random $P$ on the altitude from $B$ to $AC$. The circle $(ABP)$ intersects $AC$ second time in $M$. Take $N$ such that it's on the segment $AC$ and $AM=NC$ and $M \neq N$.The second intersection of $NP$ and circle $(APB)$ is $X$ , ($X \neq P$) and the second intersection of $AB$ and circle $(APN)$ is $Y$ ,($Y \neq A$).The tangent from $A$ to the circle $(APN)$ intersects the altitude from $B$ at $Z$. Prove that $CZ$ is tangent to circle $(PXY)$.

In a unit cube $ABCD - EFGH$, an equilateral triangle $BDG$ cuts out a circle from the circumsphere of the cube. Find the area of the circle.

Determine all non-constant polynomials $X^n+a_{n-1}X^{n-1}+\cdots +a_1X+a_0$ with integer coefficients for which the roots are exactly the numbers $a_0,a_1,\ldots ,a_{n-1}$ (with multiplicity).

Let $N$ be a positive integer with $2k$ digits. Its chunks are defined by the two numbers formed by the digits from $1$ to $k$ and $k+1$ to $2k$ (e.g. the chunks of 142856 are 142 and 856). We define the $N$-[i]reverse[/i] as the number formed by switching its chunks (e.g. the reverse of 142856 is 856142 and for 1401 it is 114). We call a number [i]cearense[/i] is it satisfies the following conditions: [list=i] [*] Has an even number of digits [*] Its chunks are relatively prime [*]Divides its reverse [/list] Find the two smallest cearense integer.

A finite set $S$ of positive integers has the property that, for each $s \in S,$ and each positive integer divisor $d$ of $s$, there exists a unique element $t \in S$ satisfying $\text{gcd}(s, t) = d$. (The elements $s$ and $t$ could be equal.) Given this information, find all possible values for the number of elements of $S$.

Let $p$ be a prime number, $p \ge 5$, and $k$ be a digit in the $p$-adic representation of positive integers. Find the maximal length of a non constant arithmetic progression whose terms do not contain the digit $k$ in their $p$-adic representation.

What is the sum of all $k\leq25$ such that one can completely cover a $k\times k$ square with $T$ tetrominos (shown in the diagram below) without any overlap? [asy] size(2cm); draw((0,0)--(3,0)); draw((0,1)--(3,1)); draw((1,2)--(2,2)); draw((0,0)--(0,1)); draw((1,0)--(1,2)); draw((2,0)--(2,2)); draw((3,0)--(3,1)); [/asy] $\text{(A) }20\qquad\text{(B) }24\qquad\text{(C) }84\qquad\text{(D) }108\qquad\text{(E) }154$

On account of the annual fluctuation of temperature the ground at the town of Ν freezes to a depth of 2 metres. To what depth would it freeze on account of a daily fluctuation of the same amplitude?

Adam has a circle of radius $1$ centered at the origin. - First, he draws $6$ segments from the origin to the boundary of the circle, which splits the upper (positive $y$) semicircle into $7$ equal pieces. - Next, starting from each point where a segment hit the circle, he draws an altitude to the $x$-axis. - Finally, starting from each point where an altitude hit the $x$-axis, he draws a segment directly away from the bottommost point of the circle $(0,-1)$, stopping when he reaches the boundary of the circle. What is the product of the lengths of all $18$ segments Adam drew? [img]https://cdn.discordapp.com/attachments/813077401265242143/816190774257516594/circle2.png[/img] [i]Proposed by Adam Bertelli[/i]

In triangle $ABC$, $AD$ is angle bisector ($D$ is on $BC$) if $AB+AD=CD$ and $AC+AD=BC$, what are the angles of $ABC$?

A Haiku is a Japanese poem of seventeen syllables, in three lines of five, seven, and five. In how many ways Can you add three integers Summing seventeen? Order matters here. For example, eight, three, six Is not eight, six, three. All nonnegative, Do not need to be distinct. What is your answer? [i]Proposed by Derek Gao[/i]

Chandler the Octopus is making a concoction to create the perfect ink. He adds $1.2$ grams of melanin, $4.2$ grams of enzymes, and $6.6$ grams of polysaccharides. But Chandler accidentally added n grams of an extra ingredient to the concoction, Chemical $X$, to create glue. Given that Chemical $X$ contains none of the three aforementioned ingredients, and the percentages of melanin, enzymes, and polysaccharides in the final concoction are all integers, find the sum of all possible positive integer values of $n$. [i]Proposed by Taiki Aiba[/i]

For a positive integer $k\ge 2$ define $\mathcal{T}_k=\{(x,y)\mid x,y=0,1,\ldots, k-1\}$ to be a collection of $k^2$ lattice points on the cartesian coordinate plane. Let $d_1(k)>d_2(k)>\cdots$ be the decreasing sequence of the distinct distances between any two points in $T_k$. Suppose $S_i(k)$ be the number of distances equal to $d_i(k)$. Prove that for any three positive integers $m>n>i$ we have $S_i(m)=S_i(n)$.