An equilateral triangle with sides of length $4$ has an isosceles triangle with the same base and half the height cut out of it. Find the remaining area

The unit's digit (one's digit) of the product of any six consecutive positive whole numbers is $\text{(A)}\ 0 \qquad \text{(B)}\ 2 \qquad \text{(C)}\ 4 \qquad \text{(D)}\ 6 \qquad \text{(E)}\ 8$

Let $\omega$ be the circumcircle of $\triangle{ABC}$. $P$ is an interior point of $\triangle{ABC}$. $A_{1}, B_{1}, C_{1}$ are the intersections of $AP, BP, CP$ respectively and $A_{2}, B_{2}, C_{2}$ are the symmetrical points of $A_{1}, B_{1}, C_{1}$ with respect to the midpoints of side $BC, CA, AB$. Show that the circumcircle of $\triangle{A_{2}B_{2}C_{2}}$ passes through the orthocentre of $\triangle{ABC}$.

A sequence of positive integers with $n$ terms satisfies $\sum_{i=1}^{n} a_i=2007$. Find the least positive integer $n$ such that there exist some consecutive terms in the sequence with their sum equal to $30$.

Let $A \in \mathcal{M}_n(\mathbb{R})$ be an invertible matrix. a) Prove that the eigenvalues of $AA^T$ are positive real numbers. b) We assume that there are two distinct positive integers, $p$ and $q$, such that $(AA^T)^p=(A^TA)^q.$ Prove that $A^T=A^{-1}.$

A set $P$ of $2002$ persons is given. The family of subsets of $P$ containing exactly $1001$ persons has the property that the number of acquaintance pairs in each such subset is the same. (It is assumed that the acquaintance relation is symmetric). Find the best lower estimation of the acquaintance pairs in the set $P$.

The numbers $1,2,\dots,2000$ are written on the board. Two players are playing a game with alternating moves. A move consists of erasing two number $a,b$ and writing $a^b$. After some time only one number is left. The first player wins, if the numbers last digit is $2$, $7$ or $8$. If not, the second player wins. Who has a winning strategy? [I]Proposed by V. Frank[/i]

[b]p1.[/b] A tennis net is made of strings tied up together which make a grid consisting of small squares as shown below. [img]https://cdn.artofproblemsolving.com/attachments/9/4/72077777d57408d9fff0ea5e79be5ecb6fe8c3.png[/img] The size of the net is $100\times 10$ small squares. What is the maximal number of sides of small squares which can be cut without breaking the net into two separate pieces? (The side is cut only in the middle, not at the ends). [b]p2.[/b] What number is bigger $2^{300}$ or $3^{200}$ ? [b]p3.[/b] All noble knights participating in a medieval tournament in Camelot used nicknames. In the tournament each knight had combats with all other knights. In each combat one knight won and the second one lost. At the end of tournament the losers reported their real names to the winners and to the winners of their winners. Was there a person who knew the real names of all knights? [b]p4.[/b] Two players Tom and Sid play the following game. There are two piles of rocks, $10$ rocks in the first pile and $12$ rocks in the second pile. Each of the players in his turn can take either any amount of rocks from one pile or the same amount of rocks from both piles. The winner is the player who takes the last rock. Who does win in this game if Tom starts the game? [b]p5.[/b] There is an interesting $5$-digit integer. With a $1$ after it, it is three times as large as with a $1$ before it. What is the number? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A word of length $n$ that consists only of the digits $0$ and $1$, is called a bit-string of length $n$. (For example, $000$ and $01101$ are bit-strings of length 3 and 5.) Consider the sequence $s(1), s(2), ...$ of bit-strings of length $n > 1$ which is obtained as follows : (1) $s(1)$ is the bit-string $00...01$, consisting of $n - 1$ zeros and a $1$ ; (2) $s(k+1)$ is obtained as follows : (a) Remove the digit on the left of $s(k)$. This gives a bit-string $t$ of length $n - 1$. (b) Examine whether the bit-string $t1$ (length $n$, adding a $1$ after $t$) is already in $\{s(1), s(2), ..., s(k)\}$. If this is the not case, then $s(k+1) = t1$. If this is the case then $s(k+1) = t0$. For example, if $n = 3$ we get : $s(1) = 001 \rightarrow s(2) = 011 \rightarrow s(3) = 111 \rightarrow s(4) = 110 \rightarrow s(5) = 101$ $\rightarrow s(6) = 010 \rightarrow s(7) = 100 \rightarrow s(8) = 000 \rightarrow s(9) = 001 \rightarrow ...$ Suppose $N = 2^n$. Prove that the bit-strings $s(1), s(2), ..., s(N)$ of length $n$ are all different.

Let $d$ be a diameter of a circle $k$, and let $A$ be an arbitrary point on this diameter $d$ in the interior of $k$. Further, let $P$ be a point in the exterior of $k$. The circle with diameter $PA$ meets the circle $k$ at the points $M$ and $N$. Find all points $B$ on the diameter $d$ in the interior of $k$ such that \[\measuredangle MPA = \measuredangle BPN \quad \text{and} \quad PA \leq PB.\] (i. e. give an explicit description of these points without using the points $M$ and $N$).

How many positive integer divisors of $201^9$ are perfect squares or perfect cubes (or both)? $\textbf{(A) } 32 \qquad\textbf{(B) } 36 \qquad\textbf{(C) } 37 \qquad\textbf{(D) } 39 \qquad\textbf{(E) } 41$

Let $ABC$ be a triangle inscribed in a circle and let \[ l_a = \frac{m_a}{M_a} \ , \ \ l_b = \frac{m_b}{M_b} \ , \ \ l_c = \frac{m_c}{M_c} \ , \] where $m_a$,$m_b$, $m_c$ are the lengths of the angle bisectors (internal to the triangle) and $M_a$, $M_b$, $M_c$ are the lengths of the angle bisectors extended until they meet the circle. Prove that \[ \frac{l_a}{\sin^2 A} + \frac{l_b}{\sin^2 B} + \frac{l_c}{\sin^2 C} \geq 3 \] and that equality holds iff $ABC$ is an equilateral triangle.

Let $O$ denote the circumcentre of an acute-angled triangle $ABC$. Let point $P$ on side $AB$ be such that $\angle BOP = \angle ABC$, and let point $Q$ on side $AC$ be such that $\angle COQ = \angle ACB$. Prove that the reflection of $BC$ in the line $PQ$ is tangent to the circumcircle of triangle $APQ$.

Does there exist an integer $n > 1$ such that $2^{2^n-1} -7$ is not a perfect square?

Consider the hexagon which is formed by the vertices of two equilateral triangles (not necessarily equal) when the triangles intersect. Prove that the area of the hexagon is unchanged when one of the triangles is translated (without rotating) relative to the other in such a way that the hexagon continues to be defined. (V Proizvolov)

Evaluate $1 \oplus 2 \oplus \dots \oplus 987654321$ where $\oplus$ is bitwise exclusive OR. ($A\oplus B$ in binary has an $n$-th digit equal to $1$ if the $n$-th binary digits of $A$ and $B$ differ and $0$ otherwise. For example, $5 \oplus 9 = 0101_{2} \oplus 1001_{2} = 1100_2= 12$ and $6 \oplus 7 = 110_2 + 111_2 = 001_2 = 1$.) [i]Proposed by Jacob Weiner[/i]

A circle $C_0$ is inscribed in an equilateral triangle $XYZ$ of side length 112. Then, for each positive integer $n$, circle $C_n$ is inscribed in the region bounded by $XY$, $XZ$, and an arc of circle $C_{n-1}$, forming an infinite sequence of circles tangent to sides $XY$ and $XZ$ and approaching vertex $X$. If these circles collectively have area $m\pi$, find $m$. [i]Proposed by Michael Tang[/i]

[u]Set 4[/u] [b]p10.[/b] Eve has nine letter tiles: three $C$’s, three $M$’s, and three $W$’s. If she arranges them in a random order, what is the probability that the string “$CMWMC$” appears somewhere in the arrangement? [b]p11.[/b] Bethany’s Batteries sells two kinds of batteries: $C$ batteries for $\$4$ per package, and $D$ batteries for $\$7$ per package. After a busy day, Bethany looks at her ledger and sees that every customer that day spent exactly $\$2021$, and no two of them purchased the same quantities of both types of battery. Bethany also notes that if any other customer had come, at least one of these two conditions would’ve had to fail. How many packages of batteries did Bethany sell? [b]p12.[/b] A deck of cards consists of $30$ cards labeled with the integers $1$ to $30$, inclusive. The cards numbered $1$ through $15$ are purple, and the cards numbered $16$ through $30$ are green. Lilith has an expansion pack to the deck that contains six indistinguishable copies of a green card labeled with the number $32$. Lilith wants to pick from the expanded deck a hand of two cards such that at least one card is green. Find the number of distinguishable hands Lilith can make with this deck. PS. You should use hide for answers.

An infinite sequence $ \,x_{0},x_{1},x_{2},\ldots \,$ of real numbers is said to be [b]bounded[/b] if there is a constant $ \,C\,$ such that $ \, \vert x_{i} \vert \leq C\,$ for every $ \,i\geq 0$. Given any real number $ \,a > 1,\,$ construct a bounded infinite sequence $ x_{0},x_{1},x_{2},\ldots \,$ such that \[ \vert x_{i} \minus{} x_{j} \vert \vert i \minus{} j \vert^{a}\geq 1 \] for every pair of distinct nonnegative integers $ i, j$.

A number which when divided by $ 10$ leaves a remainder of $ 9$, when divided by $ 9$ leaves a remainder of $ 8$, by $ 8$ leaves a remainder of $ 7$, etc., down to where, when divided by $ 2$, it leaves a remainder of $ 1$, is: $ \textbf{(A)}\ 59 \qquad\textbf{(B)}\ 419 \qquad\textbf{(C)}\ 1259 \qquad\textbf{(D)}\ 2519 \qquad\textbf{(E)}\ \text{none of these answers}$

Find the smallest number \(n\) such that any set of \(n\) ponts in a Cartesian plan, all of them with integer coordinates, contains two poitns such that the square of its mutual distance is a multiple of \(2016\).

Triangle $ABC$ with $\measuredangle A = 90^\circ$ has incenter $I$. A circle passing through $A$ with center $I$ is drawn, intersecting $\overline{BC}$ at $E$ and $F$ such that $BE < BF$. If $\tfrac{BE}{EF} = \tfrac{2}{3}$, then $\tfrac{CF}{FE} = \tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [i]Proposed by Lewis Chen [/i]

Let circles $C_1$ and $C_2$ be internally tangent at point $P$, with $C_1$ being the smaller circle. Consider a line passing through $P$ which intersects $C_1$ at $Q$ and $C_2$ at $R$. Let the line tangent to $C_2$ at $R$ and the line perpendicular to $\overline{PR}$ passing through $Q$ intersect at a point $S$ outside both circles. Given that $SR = 5$, $RQ = 3$, and $QP = 2$, compute the radius of $C_2$.

Let $\mathbb{N} = \{1,2, \ldots\}.$ Does there exists a function $f: \mathbb{N} \mapsto \mathbb{N}$ such that $\forall n \in \mathbb{N},$ $f^{1989}(n) = 2 \cdot n$ ?

2/1/31. Let $x, y,$ and $z$ be real numbers greater than $1$. Prove that if $x^y = y^z = z^x$, then $x = y = z$.