$D, \: E , \: F$ are points on the sides $AB, \: BC, \: CA,$ respectively, of a triangle $ABC$ such that $AD=AF, \: BD=BE,$ and $DE=DF.$ Let $I$ be the incenter of the triangle $ABC,$ and let $K$ be the point of intersection of the line $BI$ and the tangent line through $A$ to the circumcircle of the triangle $ABI.$ Show that $AK=EK$ if $AK=AD.$

Find the number of subsets of $\{1,2,\ldots,7\}$ that do not contain two consecutive integers.

A positive integer $M$ has been represented as a product of primes. Each of these primes is increased by 1 . The product $N$ of the new multipliers is divisible by $M$ . Prove that if we represent $N$ as a product of primes and increase each of them by 1 then the product of the new multipliers will be divisible by $N$ . Alexandr Gribalko

Evaluate $\int_0^1 \frac{x^2+x+1}{x^4+x^3+x^2+x+1}\ dx.$

Let $D{}$ be a point inside the triangle $ABC$. Let $E{}$ and $F{}$ be the projections of $D{}$ onto $AB$ and $AC$, respectively. The lines $BD$ and $CD$ intersect the circumcircle of $ABC$ the second time at $M{}$ and $N{}$, respectively. Prove that \[\frac{EF}{MN}\geqslant \frac{r}{R},\]where $r{}$ and $R{}$ are the inradius and circumradius of $ABC$, respectively.

Suppose that $X$ and $Y$ are metric spaces and $f:X \longrightarrow Y$ is a continious function. Also $f_1: X\times \mathbb R \longrightarrow Y\times \mathbb R$ with equation $f_1(x,t)=(f(x),t)$ for all $x\in X$ and $t\in \mathbb R$ is a closed function. Prove that for every compact set $K\subseteq Y$, its pre-image $f^{pre}(K)$ is a compact set in $X$.

[b]p1.[/b] Susan plays a game in which she rolls two fair standard six-sided dice with sides labeled one through six. She wins if the number on one of the dice is three times the number on the other die. If Susan plays this game three times, compute the probability that she wins at least once. [b]p2.[/b] In triangles $\vartriangle ABC$ and $\vartriangle DEF$, $DE = 4AB$, $EF = 4BC$, and $FD = 4CA$. The area of $\vartriangle DEF$ is $360$ units more than the area of $\vartriangle ABC$. Compute the area of $\vartriangle ABC$. [b]p3.[/b] Andy has $2010$ square tiles, each of which has a side length of one unit. He plans to arrange the tiles in an $m\times n$ rectangle, where $mn = 2010$. Compute the sum of the perimeters of all of the different possible rectangles he can make. Two rectangles are considered to be the same if one can be rotated to become the other, so, for instance, a $1\times 2010$ rectangle is considered to be the same as a $2010\times 1$ rectangle. [b]p4.[/b] Let $$S = \log_2 9 \log_3 16 \log_4 25 ... \log_{999} 1000000.$$ Compute the greatest integer less than or equal to $\log_2 S$. [b]p5.[/b] Let $A$ and $B$ be fixed points in the plane with distance $AB = 1$. An ant walks on a straight line from point $A$ to some point $C$ in the plane and notices that the distance from itself to B always decreases at any time during this walk. Compute the area of the region in the plane containing all points where point $C$ could possibly be located. [b]p6.[/b] Lisette notices that $2^{10} = 1024$ and $2^{20} = 1 048 576$. Based on these facts, she claims that every number of the form $2^{10k}$ begins with the digit $1$, where k is a positive integer. Compute the smallest $k$ such that Lisette's claim is false. You may or may not find it helpful to know that $ln 2 \approx 0.69314718$, $ln 5 \approx 1.60943791$, and $log_{10} 2 \approx 0:30103000$. [b]p7.[/b] Let $S$ be the set of all positive integers relatively prime to $6$. Find the value of $\sum_{k\in S}\frac{1}{2^k}$ . [b]p8.[/b] Euclid's algorithm is a way of computing the greatest common divisor of two positive integers $a$ and $b$ with $a > b$. The algorithm works by writing a sequence of pairs of integers as follows. 1. Write down $(a, b)$. 2. Look at the last pair of integers you wrote down, and call it $(c, d)$. $\bullet$ If $d \ne 0$, let r be the remainder when c is divided by d. Write down $(d, r)$. $\bullet$ If $d = 0$, then write down c. Once this happens, you're done, and the number you just wrote down is the greatest common divisor of a and b. 3. Repeat step 2 until you're done. For example, with $a = 7$ and $b = 4$, Euclid's algorithm computes the greatest common divisor in $4$ steps: $$(7, 4) \to (4, 3) \to (3, 1) \to (1, 0) \to 1$$ For $a > b > 0,$ compute the least value of a such that Euclid's algorithm takes $10$ steps to compute the greatest common divisor of $a$ and $b$. [b]p9.[/b] Let $ABCD$ be a square of unit side length. Inscribe a circle $C_0$ tangent to all of the sides of the square. For each positive integer $n$, draw a circle Cn that is externally tangent to $C_{n-1}$ and also tangent to sides $AB$ and $AD$. Suppose $r_i$ is the radius of circle $C_i$ for every nonnegative integer $i$. Compute $\sqrt[200]{r_0/r_{100}}$. [b]p10.[/b] Rachel and Mike are playing a game. They start at $0$ on the number line. At each positive integer on the number line, there is a carrot. At the beginning of the game, Mike picks a positive integer $n$ other than $30$. Every minute, Rachel moves to the next multiple of $30$ on the number line that has a carrot on it and eats that carrot. At the same time, every minute, Mike moves to the next multiple of $n$ on the number line that has a carrot on it and eats that carrot. Mike wants to pick an $n$ such that, as the game goes on, he is always within $1000$ units of Rachel. Compute the average (arithmetic mean) of all such $n$. [b]p11.[/b] Darryl has a six-sided die with faces $1, 2, 3, 4, 5, 6$. He knows the die is weighted so that one face comes up with probability $1/2$ and the other five faces have equal probability of coming up. He unfortunately does not know which side is weighted, but he knows each face is equally likely to be the weighted one. He rolls the die 5 times and gets a $1$, $2$, $3$, $4$ and $5$ in some unspecified order. Compute the probability that his next roll is a $6$. [b]p12.[/b] Let $F_0 = 1$, $F_1 = 1$ and $F_k = F_{k-1} + F_{k-2}$. Let $P(x) =\sum^{99}_{k=0} x^{F_k}$ . The remainder when $P(x)$ is divided by $x^3 - 1$ can be expressed as $ax^2 + bx + c$. Find $2a + b$. [b]p13.[/b] Let $\theta \ne 0$ be the smallest acute angle for which $\sin \theta$, $\sin (2\theta)$, $\sin (3\theta)$, when sorted in increasing order, form an arithmetic progression. Compute $\cos (\theta/2)$. [b]p14.[/b] A $4$-dimensional hypercube of edge length 1 is constructed in $4$-space with its edges parallel to the coordinate axes and one vertex at the origin. The coordinates of its sixteen vertices are given by $(a, b, c, d)$, where each of $a$, $b$, $c$, and $d$ is either $0$ or $1$. The $3$-dimensional hyperplane given by $x + y + z + w = 2$ intersects the hypercube at $6$ of its vertices. Compute the $3$-dimensional volume of the solid formed by the intersection. [b]p15.[/b] A student puts $2010$ red balls and $1957$ blue balls into a box. Weiqing draws randomly from the box one ball at a time without replacement. She wins if, at anytime, the total number of blue balls drawn is more than the total number of red balls drawn. Assuming Weiqing keeps drawing balls until she either wins or runs out, ompute the probability that she eventually wins. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Below is a diagram showing a $6 \times 8$ rectangle divided into four $6 \times 2$ rectangles and one diagonal line. Find the total perimeter of the four shaded trapezoids.

The sequence $a_1 = 1$, $a_2, a_3, \cdots$ is defined as follows: if $a_n - 2$ is a natural number not already occurring on the board, then $a_{n+1} = a_n-2$; otherwise, $a_{n+1} = a_n + 3$. Prove that every nonzero perfect square occurs in the sequence as the previous term increased by $3$.

Put $P = m^{2003}n^{2017} - m^{2017}n^{2003}$ , where $m, n \in N$. a) Is $P$ divisible by $24$? b) Do there exist $m, n \in N$ such that $P$ is not divisible by $7$?

Let \[\mathcal{S} = \sum_{i=1}^{\infty}\left(\prod_{j=1}^i \dfrac{3j - 2}{12j}\right).\] Then $(\mathcal{S} + 1)^3 = \tfrac mn$ with $m$ and $n$ coprime positive integers. Find $10m + n$. [i]Proposed by Justin Lee and Evan Chang[/i]

At Euclid High School, the mathematics teachers are Mrs. Germain, Mr. Newton, and Mrs. Young. There are $11$ students in Mrs. Germain's class, 8 in Mr. Newton, and $9$ in Mrs. Young's class are taking the AMC $8$ this year. How many mathematics students at Euclid High School are taking the contest? $ \textbf{(A)}\ 26 \qquad\textbf{(B)}\ 27\qquad\textbf{(C)}\ 28\qquad\textbf{(D)}\ 29\qquad\textbf{(E)}\ 30 $

A substitute teacher lead a groop of students to go for a trip. The teacher who in charge of the groop of the students told the substitude teacher that there are two students who always lie, and the others always tell the truth. But the substitude teacher don't know who are the two students always lie. They get lost in a forest. Finally the are in a crossroad which has four roads. The substitute teacher knows that their camp is on one road, and the distence is $20$ minutes' walk. The students have to go to the camp before it gets dark. $(1)$ If there are $8$ students, and $60$ minutes before it gets dark, give a plan that all students can get back to the camp. $(2)$ If there are $4$ students, and $100$ minutes before it gets dark, is there a plan that all students can get back to the camp?

The sum of several consecutive natural numbers is $20$ times greater than the largest of them and $30$ times greater than the smallest. Find these numbers.

Calculate the mean value of the solid angle by which the disc $x^2 + y^2 \le 1$ lying in the plane $z = 0$ is seen from points of the sphere $x^2 + y^2 + (z-2)^2 = 1$.

In an $n\times{n}$ grid, there are some cats living in each cell (the number of cats in a cell must be a non-negative integer). Every midnight, the manager chooses one cell: (a) The number of cats living in the chosen cell must be greater than or equal to the number of neighboring cells of the chosen cell. (b) For every neighboring cell of the chosen cell, the manager moves one cat from the chosen cell to the neighboring cell. (Two cells are called "neighboring" if they share a common side, e.g. there are only $2$ neighboring cells for a cell in the corner of the grid) Find the minimum number of cats living in the whole grid, such that the manager is able to do infinitely many times of this process.

Find all pairs of primes $p, q<2023$ such that $p \mid q^2+8$ and $q \mid p^2+8$.

Let $S_0=0$ and let $S_k$ equal $a_1+2a_2+\ldots+ka_k$ for $k\geq 1$. Define $a_i$ to be $1$ if $S_{i-1}<i$ and $-1$ if $S_{i-1}\geq i$. What is the largest $k\leq 2010$ such that $S_k=0$?

In each square of a garden shaped like a $2022 \times 2022$ board, there is initially a tree of height $0$. A gardener and a lumberjack alternate turns playing the following game, with the gardener taking the first turn: [list] [*] The gardener chooses a square in the garden. Each tree on that square and all the surrounding squares (of which there are at most eight) then becomes one unit taller. [*] The lumberjack then chooses four different squares on the board. Each tree of positive height on those squares then becomes one unit shorter. [/list] We say that a tree is [i]majestic[/i] if its height is at least $10^6$. Determine the largest $K$ such that the gardener can ensure there are eventually $K$ majestic trees on the board, no matter how the lumberjack plays.

Any circle in the $xy$-plane is "represented" by a point on the vertical line through the center of the circle and at a distance "above" the plane of the circle equal to the radius of the circle. Show that the locus of the representations of all the circles which cut a fixed circle at a constant angle is a portion of a one-sheeted hyperboloid. By consideration of a suitable family of circles in the plane, demonstrate the existence of two families of rulings on the hyperboloid.

If $\min \left \{ \frac{ax^2+b}{\sqrt{x^2+1}} \mid x \in \mathbb{R}\right \} = 3$, then (1) Find the range of $b$; (2) for every given $b$, find $a$.

Five guys are eating hamburgers. Each one puts a top half and a bottom half of a hamburger bun on the grill. When the buns are toasted, each guy randomly takes two pieces of bread off of the grill. What is the probability that each guy gets a top half and a bottom half?

Let $a_1, \dots, a_n, b_1, \dots, b_n$ be $2n$ positive integers such that the $n+1$ products \[a_1 a_2 a_3 \cdots a_n, b_1 a_2 a_3 \cdots a_n, b_1 b_2 a_3 \cdots a_n, \dots, b_1 b_2 b_3 \cdots b_n\] form a strictly increasing arithmetic progression in that order. Determine the smallest possible integer that could be the common difference of such an arithmetic progression.

The elements of the set $F$ are some subsets of $\left\{1,2,\ldots ,n\right\}$ and satisfy the conditions: i) if $A$ belongs to $F$, then $A$ has three elements; ii)if $A$ and $B$ are distinct elements of $F$ , then $A$ and $B$ have at most one common element. Let $f(n)$ be the greatest possible number of elements of $F$. Prove that $\frac{n^{2}-4n}{6}\leq f(n) \leq \frac{n^{2}-n}{6}$

In a building there are $119$ inhabitants who live in $120$ apartments (several inhabitants can live in the same apartment). We call an apartment [i]overcrowded [/i] if $15$ or more people live in it. Every day in some overcrowded apartment (if there is one) its inhabitants have a fight and yes they all go to live in a different apartment (which may or may not be already inhabited). Should you always terminate this process?