Determine the largest integer $k$ for which $12^k$ is a factor of $120! $

The number of triangles such that lengths of three sides are integers, and the length of the longest side is $11$ is________.

Let $R$ be the set of points $(x, y)$ such that $x$ and $y$ are positive, $x + y$ is at most 2013, and \[ \lceil x \rceil \lfloor y \rfloor = \lfloor x \rfloor \lceil y \rceil. \] Compute the area of set $R$. Recall that $\lfloor a \rfloor$ is the greatest integer that is less than or equal to $a$, and $\lceil a \rceil$ is the least integer that is greater than or equal to $a$.

There are $27$ cards, each has some amount of ($1$ or $2$ or $3$) shapes (a circle, a square or a triangle) with some color (white, grey or black) on them. We call a triple of cards a [i]match[/i] such that all of them have the same amount of shapes or distinct amount of shapes, have the same shape or distinct shapes and have the same color or distinct colors. For instance, three cards shown in the figure are a [i]match[/i] be cause they have distinct amount of shapes, distinct shapes but the same color of shapes. What is the maximum number of cards that we can choose such that non of the triples make a [i]match[/i]? [i]Proposed by Amin Bahjati[/i]

Given an acute triangle $ABC$ let $M$ be the midpoint of $AB$. Point $K$ is given on the other side of line $AC$ from that of point $B$ such that $\angle KMC = 90 ^ \circ $ and $\angle KAC = 180^\circ - \angle ABC$. The tangent to circumcircle of triangle $ABC$ at $A$ intersects line $CK$ at $E$. Prove that the reflection of line $BC$ with respect to $CM$ passes through the midpoint of line segment $ME$.

Let $ a,\ b$ are postive constant numbers. (1) Differentiate $ \ln (x\plus{}\sqrt{x^2\plus{}a})\ (x>0).$ (2) For $ a\equal{}\frac{4b^2}{(e\minus{}e^{\minus{}1})^2}$, evaluate $ \int_0^b \frac{1}{\sqrt{x^2\plus{}a}}\ dx.$

Let $n$ be a positive integer and let $x_1\le x_2\le\cdots\le x_n$ be real numbers. Prove that \[ \left(\sum_{i,j=1}^{n}|x_i-x_j|\right)^2\le\frac{2(n^2-1)}{3}\sum_{i,j=1}^{n}(x_i-x_j)^2. \] Show that the equality holds if and only if $x_1, \ldots, x_n$ is an arithmetic sequence.

Consider a square $ABCD$. Let $M$ be the midpoint of segment $AB$, $\Gamma_1$ be the circle tangent to $\overline{AD}$, $\overline{AM}$ and $\overline{MC}$ with radius $r > 0$ and let $\Gamma_2$ be the circle tangent to $\overline{AD}$, $\overline{DC}$ and $\overline{MC}$ with radius $R > 0$. Prove that $R =\frac{2r}{r+1}$.

Square $ABCD$ is divided into four rectangles by $EF$ and $GH$. $EF$ is parallel to $AB$ and $GH$ parallel to $BC$. $\angle BAF = 18^\circ$. $EF$ and $GH$ meet at point $P$. The area of rectangle $PFCH$ is twice that of rectangle $AGPE$. Given that the value of $\angle FAH$ in degrees is $x$, find the nearest integer to $x$. [asy] size(100); defaultpen(linewidth(0.7)+fontsize(10)); pair D2(pair P) { dot(P,linewidth(3)); return P; } // NOTE: I've tampered with the angles to make the diagram not-to-scale. The correct numbers should be 72 instead of 76, and 45 instead of 55. pair A=(0,1), B=(0,0), C=(1,0), D=(1,1), F=intersectionpoints(A--A+2*dir(-76),B--C)[0], H=intersectionpoints(A--A+2*dir(-76+55),D--C)[0], E=F+(0,1), G=H-(1,0), P=intersectionpoints(E--F,G--H)[0]; draw(A--B--C--D--cycle); draw(F--A--H); draw(E--F); draw(G--H); label("$A$",D2(A),NW); label("$B$",D2(B),SW); label("$C$",D2(C),SE); label("$D$",D2(D),NE); label("$E$",D2(E),plain.N); label("$F$",D2(F),S); label("$G$",D2(G),W); label("$H$",D2(H),plain.E); label("$P$",D2(P),SE); [/asy]

The Tokyo Metro system is one of the most efficient in the world. There is some odd positive integer $k$ such that each metro line passes through exactly $k$ stations, and each station is serviced by exactly $k$ metro lines. One can get from any station to any otherstation using only one metro line - but this connection is unique. Furthermore, any two metro lines must share exactly one station. David is planning an excursion for the IMO team, and wants to visit a set $S$ of $k$ stations. He remarks that no three of the stationsin $S$ are on a common metro line. Show that there is some station not in $S$, which is connected to every station in $S$ by a different metro line.

Let $ABC$ be a triangle with circumradius $17$, inradius $4$, circumcircle $\Gamma$ and $A$-excircle $\Omega$. Suppose the reflection of $\Omega$ over line $BC$ is internally tangent to $\Gamma$. Compute the area of $\triangle ABC$.

We define a sequence of natural numbers by the initial values $a_0 = a_1 = a_2 = 1$ and the recursion $$ a_n = \bigg \lfloor \frac{n}{a_{n-1}a_{n-2}a_{n-3}} \bigg \rfloor $$ for all $n \ge 3$. Find the value of $a_{2022}$.

[help me] Let m and n denote the number of digits in $2^{2007}$ and $5^{2007}$ when expressed in base 10. What is the sum m + n?

Let $ f$ be a function such that for all integers $ x$ and $ y$ applies $ f(x\plus{}y) \equal{} f(x) \plus{} f(y) \plus{} 6xy \plus{} 1$ and $ f(x) \equal{} f(\minus{}x)$. Then $ f(3)$ equals $ \text{(A)}\ 26 \qquad \text{(B)}\ 27 \qquad \text{(C)}\ 52 \qquad \text{(D)}\ 53 \qquad \text{(E)}\ 54$

[b]5.[/b] Define the sequence $\{c_n\}_{n=1}^{\infty}$ as follows: $c_1= \frac {1}{2}$, $c_{n+1}= c_{n}-c_{n}^2$($n\geq 1$). Prove that $\lim_{n \to \infty} nc_n= 1$ [b](S.12)[/b]

Let $\triangle PQR$ be a triangle with $\angle P = 75^\circ$ and $\angle Q = 60^\circ$. A regular hexagon $ABCDEF$ with side length 1 is drawn inside $\triangle PQR$ so that side $\overline{AB}$ lies on $\overline{PQ}$, side $\overline{CD}$ lies on $\overline{QR}$, and one of the remaining vertices lies on $\overline{RP}$. There are positive integers $a$, $b$, $c$, and $d$ such that the area of $\triangle PQR$ can be expressed in the form $\tfrac{a+b\sqrt c}d$, where $a$ and $d$ are relatively prime and $c$ is not divisible by the square of any prime. Find $a+b+c+d$.

How many zeros are at the end of the product \[25\times 25\times 25\times 25\times 25\times 25\times 25\times 8\times 8\times 8?\] $\text{(A)}\ 3 \qquad \text{(B)}\ 6 \qquad \text{(C)}\ 9 \qquad \text{(D)}\ 10 \qquad \text{(E)}\ 12$

For an integer $n>3$ denote by $n?$ the product of all primes less than $n$. Solve the equation $n?=2n+16$. [i]V. Senderov [/i]

What is the average (mean) of all $ 5$-digit numbers that can be formed by using each of the digits $ 1$, $ 3$, $ 5$, $ 7$, and $ 8$ exactly once? $ \textbf{(A)}\ 48000\qquad \textbf{(B)}\ 49999.5\qquad \textbf{(C)}\ 53332.8\qquad \textbf{(D)}\ 55555\qquad \textbf{(E)}\ 56432.8$

Let $M$ be the midpoint of side $BC$ of an equilateral triangle $ABC$. The point $D$ is on $CA$ extended such that $A$ is between $D$ and $C$. The point $E$ is on $AB$ extended such that $B$ is between $A$ and $E$, and $|MD| = |ME|$. The point $F$ is the intersection of $MD$ and $AB$. Prove that $\angle BFM = \angle BME$.

Find the smallest positive $x$ for which holds the inequality $$\sin x \le \sin (x+1)\le \sin (x+2)\le sin (x+3)\le \sin (x+4) .$$

Each person stands on a whole number on the number line from $0$ to $2022$ . In each turn, two people are selected by a distance of at least $2$. These go towards each other by $1$. When no more such moves are possible, the process ends. Show that this process always ends after a finite number of moves, and determine all possible configurations where people can end up standing. (whereby is for each configuration is only of interest how many people stand at each number.) [i](Birgit Vera Schmidt)[/i] [hide=original wording]Bei jeder ganzen Zahl auf dem Zahlenstrahl von 0 bis 2022 steht zu Beginn eine Person. In jedem Zug werden zwei Personen mit Abstand mindestens 2 ausgewählt. Diese gehen jeweils um 1 aufeinander zu. Wenn kein solcher Zug mehr möglich ist, endet der Vorgang. Man zeige, dass dieser Vorgang immer nach endlich vielen Zügen endet, und bestimme alle möglichen Konfigurationen, wo die Personen am Ende stehen können. (Dabei ist für jede Konfiguration nur von Interesse, wie viele Personen bei jeder Zahl stehen.)[/hide]

Let be a natural number $ n\ge 2 $ and a real number $ r>1. $ Determine the natural numbers $ k $ having the property that the affixes of $ r^ke^{\pi ki/n} ,r^{k+1}e^{\pi (k+1)i/n} ,r^{k+n}e^{\pi (k+n)i/n} ,r^{k+n+1}e^{\pi (k+n+1) i/n} $ in the complex plane represent the vertices of a trapezoid.

In a table-tennis tournament of $10$ contestants, any $2$ contestants meet only once. We say that there is a winning triangle if the following situation occurs: $i$-th contestant defeated the $j$-th contestant, $j$-th contestant defeated the $k$-th contestant, and, $k$-th contestant defeated the $i$-th contestant. Let, $W_i$ and $L_i $ be respectively the number of games won and lost by the $i$-th contestant. Suppose, $L_i+W_j\geq 8$ whenever the $j$-th contestant defeats the $i$-th contestant. Prove that, there are exactly $40$ winning triangles in this tournament.

Consider an acute triangle $\Delta ABC$. Let $D$ and $E$ be the feet of the altitudes from $A$ to $BC$ and from $B$ to $AC$ respectively. Define $D_1$ and $D_2$ as the reflections of $D$ across lines $AB$ and $AC$, respectively. Let $\Gamma$ be the circumcircle of $\Delta AD_1D_2$. Denote by $P$ the second intersection of line $D_1B$ with $\Gamma$, and by $Q$ the intersection of ray $EB$ with $\Gamma$. If $O$ is the circumcenter of $\Delta ABC$, prove that $O$, $D$, and $Q$ are collinear if and only if quadrilateral $BCQP$ can be inscribed within a circle. $\textbf{Proposed by Kritesh Dhakal, Nepal.}$