For how many positive integers $n \le 1000$ is $$\left\lfloor \dfrac{998}{n} \right\rfloor+\left\lfloor \dfrac{999}{n} \right\rfloor+\left\lfloor \dfrac{1000}{n}\right \rfloor$$ not divisible by $3$? (Recall that $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.) $\textbf{(A) } 22 \qquad\textbf{(B) } 23 \qquad\textbf{(C) } 24 \qquad\textbf{(D) } 25 \qquad\textbf{(E) } 26$

In the quadrilateral $ABCD$ the side $AB$ has length $7, BC$ length $14, CD$ length $26$, and $DA$ length $23$. Show that the diagonals are perpendicular. You may assume that the quadrilateral is convex (all internal angles are less than $180^o$).

We define the weight $W$ of a positive integer as follows: $W(1) = 0$, $W(2) = 1$, $W(p) = 1 + W(p + 1)$ for every odd prime $p$, $W(c) = 1 + W(d)$ for every composite $c$, where $d$ is the greatest proper factor of $c$. Compute the greatest possible weight of a positive integer less than 100.

In a convex hexagon $ABCDEF$, triangles $ACE$ and $BDF$ have the same circumradius $R$. If triangle $ACE$ has inradius $r$, prove that \[ \text{Area}(ABCDEF)\le\frac{R}{r}\cdot\text{Area}(ACE).\]

Let $a$ and $b$ be positive real numbers such that $3a^2 + 2b^2 = 3a + 2b$. Find the minimum value of $A =\sqrt{\frac{a}{b(3a+2)}} + \sqrt{\frac{b}{a(2b+3)}} $

A father takes his twins and a younger child out to dinner on the twins' birthday. The restaurant charges $\$4.95$ for the father and $\$0.45$ for each year of a child's age, where age is defined as the age at the most recent birthday. If the bill is $\$9.45$, which of the following could be the age of the youngest child? $\textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 4 \qquad \textbf{(E)}\ 5$

Let $n$ be an integer greater than or equal to $3$, and let $P_n$ be the collection of all planar (simple) $n$-gons no two distinct sides of which are parallel or lie along some line. For each member $P$ of $P_n$, let $f_n(P)$ be the least cardinal a cover of $P$ by triangles formed by lines of support of sides of $P$ may have. Determine the largest value $f_n(P)$ may achieve, as $P$ runs through $P_n$.

Let $ABC$ and $DEF$ be two triangles, such that $AB=DE=20$, $BC=EF=13$, and $\angle A = \angle D$. If $AC-DF=10$, determine the area of $\triangle ABC$. [i]Proposed by Lewis Chen[/i]

In the isosceles triangle $ABC$ we have $AC = BC$. Let $X$ be an arbitrary point of the segment $AB$. The line parallel to $BC$ and passing through $X$ intersects the segment $AC$ in $N$, and the line parallel to $AC$ and passing through $BC$ intersects the segment $BC$ in $M$. Let $k_1$ be the circle with center $N$ and radius $NA$. Similarly, let $k_2$ be the circle with center $M$ and radius $MB$. Let $T$ be the intersection of the circles $k_1$ and $k_2$ different from $X$. Show that the angles $\angle NCM$ and $\angle NTM$ are equal.

Find $\frac{area(CDF)}{area(CEF)}$ in the figure. [asy] /* File unicodetex not found. */ /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki, go to User:Azjps/geogebra */ import graph; size(5.75cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -2, xmax = 21, ymin = -2, ymax = 16; /* image dimensions */ /* draw figures */ draw((0,0)--(20,0)); draw((13.48,14.62)--(7,0)); draw((0,0)--(15.93,9.12)); draw((13.48,14.62)--(20,0)); draw((13.48,14.62)--(0,0)); label("6",(15.16,12.72),SE*labelscalefactor); label("10",(18.56,5.1),SE*labelscalefactor); label("7",(3.26,-0.6),SE*labelscalefactor); label("13",(13.18,-0.71),SE*labelscalefactor); label("20",(5.07,8.33),SE*labelscalefactor); /* dots and labels */ dot((0,0),dotstyle); label("$B$", (-1.23,-1.48), NE * labelscalefactor); dot((20,0),dotstyle); label("$C$", (19.71,-1.59), NE * labelscalefactor); dot((7,0),dotstyle); label("$D$", (6.77,-1.64), NE * labelscalefactor); dot((13.48,14.62),dotstyle); label("$A$", (12.36,14.91), NE * labelscalefactor); dot((15.93,9.12),dotstyle); label("$E$", (16.42,9.21), NE * labelscalefactor); dot((9.38,5.37),dotstyle); label("$F$", (9.68,4.5), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy]

Consider triangle $ABC$ such that $AB \le AC$. Point $D$ on the arc $BC$ of thecircumcirle of $ABC$ not containing point $A$ and point $E$ on side $BC$ are such that $\angle BAD = \angle CAE < \frac12 \angle BAC$ . Let $S$ be the midpoint of segment $AD$. If $\angle ADE = \angle ABC - \angle ACB$ prove that $\angle BSC = 2 \angle BAC$ .

Let $ABCD$ be a regular tetrahedron with side $a$. Take $E,E'$ on the edge $AB, F, F'$ on the edge $AC$ and $G,G'$ on the edge AD so that $AE =a/6,AE' = 5a/6,AF= a/4,AF'= 3a/4,AG = a/3,AG'= 2a/3$. Compute the volume of $EFGE'F'G'$ in term of $a$ and find the angles between the lines $AB,AC,AD$ and the plane $EFG$.

A [i]lame king[/i] is a chess piece that can move from a cell to any cell that shares at least one vertex with it, except for the cells in the same column as the current cell. A lame king is placed in the top-left cell of a $7\times 7$ grid. Compute the maximum number of cells it can visit without visiting the same cell twice (including its starting cell).

Consider $\triangle ABC$. Choose a point $M$ on side $BC$ and let $O$ be the center of the circle passing through the vertices of $\triangle ABM$. Let $k$ be the circle that passes through $A$ and $M$ and whose center lies on $BC$. Let line $MO$ intersect $K$ again in point $K$. Prove that the line $BK$ is the same for any point $M$ on segment $BC$, so long as all of these constructions are well-defined. [i]Proposed by Evan Chen[/i]

Show that for every integer $k \ge 1$ there is a positive integer $n$ such that the decimal representation of $2^n$ contains a block of exactly $k$ zeros, i.e. $2^n = \dots a00 \dots 0b \cdots$ with $k$ zeros and $a, b \ne 0$.

Let there be an incircle of triangle $ABC$, and 3 circles each inscribed between incircle and angles of $ABC$. Let $r, r_1, r_2, r_3$ be radii of these circles ($r_1, r_2, r_3 < r$). Prove that $$r_1+r_2+r_3 \geq r$$