Ten square cardboards of $3$ centimeters on a side are cut by a line, as indicated in the figure. After the cuts, there are $20$ pieces: $10$ triangles and $10$ trapezoids. Assemble a square that uses all $20$ pieces without overlaps or gaps. [img]https://cdn.artofproblemsolving.com/attachments/7/9/ec2242cca617305b02eef7a5409e6a6b482d66.gif[/img]

Let $ABC$ be a triangle with interior angle bisectors $AA_1, BB_1, CC_1$ and incenter $I$. If $\sigma[IA_1B] + \sigma[IB_1C] + \sigma[IC_1A] = \frac{1}{2}\sigma[ABC]$, where $\sigma[ABC]$ denotes the area of $ABC$, show that $ABC$ is isosceles.

The $[A_0A_5]$ diameter divides a circumference with the $O$ centre onto two hemicircumferences. One of them is divided onto five equal arcs $A_0A_1, A_1A_2, A_2A_3, A_3A_4, A_4A_5$. The $(A_1A_4)$ line crosses $(OA_2)$ and $(OA_3)$ lines in $M$ and $N$ points. Prove that $(|A_2A_3| + |MN|)$ equals to the circumference radius.

For all nonempty finite sets of point $S$ on the plane satisfying: $|S|$ is even and for all partitions of $S$ into two subsets $A,B$ of equal size, there is a reflection that maps $A$ to $B$.

Let $\zeta = \cos \frac {2pi}{13} + i \sin \frac {2pi}{13}$ . Suppose $a > b > c > d$ are positive integers satisfying $$|\zeta^a + \zeta^b + \zeta^c +\zeta^d| =\sqrt3.$$ Compute the smallest possible value of $1000a + 100b + 10c + d$.

In the figure below, $N$ congruent semicircles lie on the diameter of a large semicircle, with their diameters covering the diameter of the large semicircle with no overlap. Let $A$ be the combined area of the small semicircles and $B$ be the area of the region inside the large semicircle but outside the semicircles. The ratio $A:B$ is $1:18$. What is $N$? [asy] draw((0,0)--(18,0)); draw(arc((9,0),9,0,180)); filldraw(arc((1,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((3,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((5,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((7,0),1,0,180)--cycle,gray(0.8)); label("...",(9,0.5)); filldraw(arc((11,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((13,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((15,0),1,0,180)--cycle,gray(0.8)); filldraw(arc((17,0),1,0,180)--cycle,gray(0.8)); [/asy] $\textbf{(A) } 16 \qquad \textbf{(B) } 17 \qquad \textbf{(C) } 18 \qquad \textbf{(D) } 19 \qquad \textbf{(E) } 36$

Let $n$ be a positive integer. Suppose we are given $2^n+1$ distinct sets, each containing finitely many objects. Place each set into one of two categories, the red sets and the blue sets, so that there is at least one set in each category. We define the [i]symmetric difference[/i] of two sets as the set of objects belonging to exactly one of the two sets. Prove that there are at least $2^n$ different sets which can be obtained as the symmetric difference of a red set and a blue set.

Given a positive real number $t$ , determine the sets $A$ of real numbers containing $t$ , for which there exists a set $B$ of real numbers depending on $A$ , $|B| \geq 4$ , such that the elements of the set $AB =\{ ab \mid a\in A , b \in B \}$ form a finite arithmetic progression .

For each of the $9$ positive integers $n,2n,3n,\dots , 9n$ Alice take the first decimal digit (from the left) and writes it onto a blackboard. She selected $n$ so that among the nine digits on the blackboard there is the least possible number of different digits. What is this number of different digits equals to?

Let the angles of a triangle be $\alpha, \beta$, and $\gamma$, the perimeter $2p$ and the radius of the circumcircle $R$. Prove the inequality $\cot^2 \alpha + \cot^2 \beta + \cot^2 \gamma \ge 3 \left(\frac{9R^2}{p^2}-1\right)$. When is the equality achieved?

[b]p1.[/b] Catherine's teacher thinks of a number and asks her to subtract $5$ and then multiply the result by $6$. Catherine accidentally switches the numbers by subtracting 6 and multiplying by $5$ to get $30$. If Catherine had not swapped the numbers, what would the correct answer be? [b]p2.[/b] At Acton Boxborough Regional High School, desks are arranged in a rectangular grid-like configuration. In order to maintain proper social distancing, desks are required to be at least 6 feet away from all other desks. Assuming that the size of the desks is negligible, what is the maximum number of desks that can fit in a $25$ feet by $25$ feet classroom? [b]p3.[/b] Joshua hates writing essays for homework, but his teacher Mr. Meesh assigns two essays every $3$ weeks. However, Mr. Meesh favors Joshua, so he allows Joshua to skip one essay out of every $4$ that are assigned. How many essays does Joshua have to write in a $24$-week school year? [b]p4.[/b] Libra likes to read, but she is easily distracted. If a page number is even, she reads the page twice. If a page number is an odd multiple of three, she skips it. Otherwise, she reads the page exactly once. If Libra's book is $405$ pages long, how many pages in total does she read if she starts on page $1$? (Reading the same page twice counts as two pages.) [b]p5.[/b] Let the GDP of an integer be its Greatest Divisor that is Prime. For example, the GDP of $14$ is $7$. Find the largest integer less than $100$ that has a GDP of $3$. [b]p6.[/b] As has been proven by countless scientific papers, the Earth is a flat circle. Bob stands at a point on the Earth such that if he walks in a straight line, the maximum possible distance he can travel before he falls off is $7$ miles, and the minimum possible distance he can travel before he falls off is $3$ miles. Then the Earth's area in square miles is $k\pi$ for some integer $k$. Compute $k$. [b]p7.[/b] Edward has $2$ magical eggs. Every minute, each magical egg that Edward has will double itself. But there's a catch. At the end of every minute, Edward's brother Eliot will come outside and smash one egg on his forehead, causing Edward to lose that egg permanently. For example, starting with $2$ eggs, after one minute there will be $3$ eggs, then $5$, $9$, and so on. After $1$ hour, the number of eggs can be expressed as $a^b + c$ for positive integers $a$, $b$, $c$ where $a > 1$, and $a$ and $c$ are as small as possible. Find $a + b + c$. [b]p8.[/b] Define a sequence of real numbers $a_1$, $a_2$, $a_3$, $..$, $a_{2019}$, $a_{2020}$ with the property that $a_n =\frac{a_{n-1} + a_n + a_{n+1}}{3}$ for all $n = 2$, $3$, $4$, $5$,$...$, $2018$, $2019$. Given that $a_1 = 1$ and $a_{1000} = 1999$, find $a_{2020}$. [b]p9.[/b] In $\vartriangle ABC$ with $AB = 10$ and $AC = 12$, points $D$ and $E$ lie on sides $\overline{AB}$ and $\overline{AC}$, respectively, such that $AD = 4$ and $AE = 5$. If the area of quadrilateral $BCED$ is $40$, find the area of $\vartriangle ADE$. [b]p10.[/b] A positive integer is called powerful if every prime in its prime factorization is raised to a power greater than or equal to $2$. How many positive integers less than 100 are powerful? [b]p11.[/b] Let integers $A,B < 10, 000$ be the populations of Acton and Boxborough, respectively. When $A$ is divided by $B$, the remainder is $1$. When $B$ is divided by $A$, the remainder is $2020$. If the sum of the digits of $A$ is $17$, find the total combined population of Acton and Boxborough. [b]p12.[/b] Let $a_1$, $a_2$, $...$, $a_n$ be an increasing arithmetic sequence of positive integers. Given $a_n - a_1 = 20$ and $a^2_n - a^2_{n-1} = 63$, find the sum of the terms in the arithmetic sequence. [b]p13.[/b] Bob rolls a cubical, an octahedral and a dodecahedral die ($6$, $8$ and $12$ sides respectively) numbered with the integers from $1$ to $6$, $1$ to $8$ and $1$ to $12$ respectively. If the probability that the sum of the numbers on the cubical and octahedral dice equals the number on the dodecahedral die can be written as $\frac{m}{n}$ , where $m, n$ are relatively prime positive integers, compute $n - m$. [b]p14.[/b] Let $\vartriangle ABC$ be inscribed in a circle with center $O$ with $AB = 13$, $BC = 14$, $AC = 15$. Let the foot of the perpendicular from $A$ to BC be $D$ and let $AO$ intersect $BC$ at $E$. Given the length of $DE$ can be expressed as $\frac{m}{n}$ where $m$, $n$ are relatively prime positive integers, find $m + n$. [b]p15.[/b] The set $S$ consists of the first $10$ positive integers. A collection of $10$ not necessarily distinct integers is chosen from $S$ at random. If a particular number is chosen more than once, all but one of its occurrences are removed. Call the set of remaining numbers $A$. Let $\frac{a}{b}$ be the expected value of the number of the elements in $A$, where $a, b$ are relatively prime positive integers. Find the reminder when $a + b$ is divided by $1000$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Positive numbers $x, y, z$ satisfy $x^2+y^2+z^2+xy+yz+zy \le 1$. Prove that $\big( \frac{1}{x}-1\big) \big( \frac{1}{y}-1\big)\big( \frac{1}{z}-1\big) \ge 9 \sqrt6 -19$.

Find all polynomials $P(x)$ with integer coefficients such that for all real numbers $s$ and $t$, if $P(s)$ and $P(t)$ are both integers, then $P(st)$ is also an integer.

How many numbers $n$ have the property that both $\frac{n}{2}$ and $2n$ are four digits whole numbers?

Let $k\ge 2$ be an integer and let $a_1 ,a_2 ,\cdots ,a_n,b_1 ,b_2 ,\cdots ,b_n$ be non-negative real numbers. Prove that\[\left(\frac{n}{n-1}\right)^{n-1}\left(\frac{1}{n} \sum_{i\equal{}1}^{n} a_i^2\right)+\left(\frac{1}{n} \sum_{i\equal{}1}^{n} b_i\right)^2\ge\prod_{i=1}^{n}(a_i^{2}+b_i^{2})^{\frac{1}{n}}.\]

Let $ K_n(n=1,2,\ldots)$ be periodical continuous functions of period $ 2 \pi$, and write \[ k_n(f;x)= \int_0^{2\pi}f(t)K_n(x-t)dt .\] Prove that the following statements are equivalent: (i) $ \int_0^{2\pi}|k_n(f;x)-f(x)|dx \rightarrow 0 \;(n \rightarrow \infty)$ for all $ f \in \mathcal{L}_1[0,2 \pi]$. (ii) $ k_n(f;0) \rightarrow f(0)$ for all continuous, $ 2 \pi$-periodic functions $ f$. [i]V. Totik[/i]

Let $S$ be a string of $99$ characters, $66$ of which are $A$ and $33$ are $B$. We call $S$ [i]good[/i] if, for each $n$ such that $1\le n \le 99$, the sub-string made from the first $n$ characters of $S$ has an odd number of distinct permutations. How many good strings are there? Which strings are good?

For $n \ge 3$, let $S=a_1+a_2+\cdots+a_n$ and $T=b_1b_2\cdots b_n$ for positive real numbers $a_1,a_2,\ldots,a_n, b_1,b_2 ,\ldots,b_n$, where the numbers $b_i$ are pairwise distinct. (a) Find the number of distinct real zeroes of the polynomial \[f(x)=(x-b_1)(x-b_2)\cdots(x-b_n)\sum_{j=1}^n \frac{a_j}{x-b_j}\] (b) Prove the inequality \[\frac1{n-1}\sum_{j=1}^n \left(1-\frac{a_j}{S}\right)b_j > \left(\frac{T}{S}\sum_{j=1}^{n} \frac{a_j}{b_j}\right)^{\frac1{n-1}}\]

Prove that there exist infinitely many collections of positive integers $ (a,b,c,d,e,f)$ such that $ a < b < c$ and the equalities $ ab \minus{} c \equal{} de,$ $ bc \minus{} a \equal{} ef$ and $ ac \minus{} b \equal{} df$ hold.

Points $A,B,C$ with $AB = BC$ are given on a circle with radius $r$, and $D$ is a point inside the circle such that the triangle $BCD$ is equilateral. The line $AD$ meets the circle again at $E$. Show that $DE = r$.

$200 \times 200$ square is colored in chess order. In one move we can take every $2 \times 3$ rectangle and change color of all its cells. Can we make all cells of square in same color ?

Let $ABCD$ be a square of side length $10.$ Point $E$ is on ray $\overrightarrow{AB}$ such that $AE=17,$ and point $F$ is on ray $\overrightarrow{AD}$ such that $AF=14.$ The line through $B$ parallel to $CE$ and the line through $D$ parallel to $CF$ meet at $P.$ Compute the area of quadrilateral $AEPF.$

In a certain land, all Arogs are Brafs, all Crups are Brafs, all Dramps are Arogs, and all Crups are Dramps. Which of the following statements is implied by these facts? $ \textbf{(A)}\ \text{All Dramps are Brafs and are Crups.}\qquad \\ \textbf{(B)}\ \text{All Brafs are Crups and are Dramps.}\qquad \\ \textbf{(C)}\ \text{All Arogs are Crups and are Dramps.}\qquad \\ \textbf{(D)}\ \text{All Crups are Arogs and are Brafs.}\qquad \\ \textbf{(E)}\ \text{All Arogs are Dramps and some Arogs may not be Crups.}$

Given the equation \[ x^4 \plus{} px^3 \plus{} qx^2 \plus{} rx \plus{} s \equal{} 0\] has four real, positive roots, prove that (a) $ pr \minus{} 16s \geq 0$ (b) $ q^2 \minus{} 36s \geq 0$ with equality in each case holding if and only if the four roots are equal.

Solve in $ \mathbb{Z} $ the system: $$ \left\{ \begin{matrix} 2^x+\log_3 x=y^2 \\ 2^y+\log_3 y=x^2 \end{matrix} \right. . $$