Consider the sums of the form $\sum_{k=1}^{n} \epsilon_k k^3,$ where $\epsilon_k \in \{-1, 1\}.$ Is any of these sums equal to $0$ if [b](a)[/b] $n=2000;$ [b](b)[/b] $n=2001 \ ?$

We have to divide a cube onto $k$ non-overlapping tetrahedrons. For what smallest $k$ is it possible?

Let $ABC$ be an equilateral triangle, and let $D,E$ and $F$ be points on $BC,BA$ and $AB$ respectively. Let $\angle BAD= \alpha, \angle CBE=\beta$ and $\angle ACF =\gamma$. Prove that if $\alpha+\beta+\gamma \geq 120^\circ$, then the union of the triangular regions $BAD,CBE,ACF$ covers the triangle $ABC$.

A box contains 36 pink, 18 blue, 9 green, 6 red, and 3 purple cubes that are identical in size. If a cube is selected at random, what is the probability that it is green? $\textbf{(A)}\ \dfrac{1}{9} \qquad \textbf{(B)}\ \dfrac{1}{8} \qquad \textbf{(C)}\ \dfrac{1}{5} \qquad \textbf{(D)}\ \dfrac{1}{4} \qquad \textbf{(E)}\ \dfrac{9}{70}$

Is there a polyhedron whose area ratio of any two faces is at least $2$ ?

Let $ABCD$ is a trapezoid with $\angle A = \angle B = 90^o$ and let $E$ is a point lying on side $CD$. Let the circle $\omega$ is inscribed to triangle $ABE$ and tangents sides $AB, AE$ and $BE$ at points $P, F$ and $K$ respectively. Let $KF$ intersects segments $BC$ and $AD$ at points $M$ and $N$ respectively, as well as $PM$ and $PN$ intersect $\omega$ at points $H$ and $T$ respectively. Prove that $PH = PT$.

Given a triangle $ABC$, $A',B',C'$ are the midpoints of $\overline{BC},\overline{AC},\overline{AB}$, respectively. $B^*,C^*$ lie in $\overline{AC},\overline{AB}$, respectively, such that $\overline{BB^*},\overline{CC^*}$ are the altitudes of the triangle $ABC$. Let $B^{\#},C^{\#}$ be the midpoints of $\overline{BB^*},\overline{CC^*}$, respectively. $\overline{B'B^{\#}}$ and $\overline{C'C^{\#}}$ meet at $K$, and $\overline{AK}$ and $\overline{BC}$ meet at $L$. Prove that $\angle{BAL}=\angle{CAA'}$

Given a natural number $n> 3$. On the plane are considered convex $n$ - gons $F_1$ and $F_2$ such that on each side of $F_1$ lies one vertex of $F_2$ and no two vertices $F_1$ and $F_2$ coincide. For each $n$, determine the limits of the ratio of the areas of the polygons $F_1$ and $F_2$. For each $n$, determine the range of the areas of the polygons $F_1$ and $F_2$, if $F_1$ is a regular $n$-gon. Determine the set of values of this value for other partial cases of the polygon $F_1$.

Given a triangle with $ \triangle ABC $, with: $ \angle C = 36^o$ and $ \angle A = \angle B $. Consider the points $ D $ on $ BC $, $ E $ on $ AD $, $ F $ on $ BE $, $ G $ on $ DF $ and $ H $ on $ EG $, so that the rays $ AD, BE, DF, EG, FH $ bisect the angles $ A, B, D, E, F $ respectively. It is known that $ FH = 1 $. Calculate $ AC$.

In isosceles right triangle $ ABC$ a circle is inscribed. Let $ CD$ be the hypotenuse height ($ D\in AB$), and let $ P$ be the intersection of inscribed circle and height $ CD$. In which ratio does the circle divide segment $ AP$?

Does there exist a triangle $ ABC$ satisfying the following two conditions: (a) ${ \sin^2A + \sin^2B + \sin^2C = \cot A + \cot B + \cot C}$ (b) $ S\ge a^2 - (b - c)^2$ where $ S$ is the area of the triangle $ ABC$.

Let $ABCD$ be a convex quadrilateral whose vertices do not lie on a circle. Let $A'B'C'D'$ be a quadrangle such that $A',B', C',D'$ are the centers of the circumcircles of triangles $BCD,ACD,ABD$, and $ABC$. We write $T (ABCD) = A'B'C'D'$. Let us define $A''B''C''D'' = T (A'B'C'D') = T (T (ABCD)).$ [b](a)[/b] Prove that $ABCD$ and $A''B''C''D''$ are similar. [b](b) [/b]The ratio of similitude depends on the size of the angles of $ABCD$. Determine this ratio.

Define a [b]ring[/b] in the plane to be the set of points at a distance of at least $r$ and at most $R$ from a specific point $O$, where $r<R$ are positive real numbers. Rings are determined by the three parameters $(O, R, r)$. The area of a ring is labeled $S$. A point in the plane for which both its coordinates are integers is called an integer point. [b]a)[/b] For each positive integer $n$, show that there exists a ring not containing any integer point, for which $S>3n$ and $R<2^{2^n}$. [b]b)[/b] Show that each ring satisfying $100\cdot R<S^2$ contains an integer point.

Let $ABCD$ be a cyclic quadrilateral with circumcenter $O$. The internal angle bisectors of \(\angle DAB\), \(\angle ABC\), \(\angle BCD\), \(\angle CDA\) create a convex quadrilateral $Q_1$. The external bisectors of the same angles create another convex quadrilateral $Q_2$. Prove $Q_1$, $Q_2$ are cyclic, and that $O$ is the midpoint of their circumcenters.

Let $ \triangle{ABC}$ be a triangle with $ AB\not\equal{}AC$. The incircle with centre $ I$ touches $ BC$, $ CA$, $ AB$ at $ D$, $ E$, $ F$, respectively. Furthermore let $ M$ the midpoint of $ EF$ and $ AD$ intersect the incircle at $ P\not\equal{}D$. Show that $ PMID$ ist cyclic.

Let $ R$, $ r$ be respectively the circumradius and inradius of a regular $ 1986$-gonal pyramid. Prove that \[ \frac{R}{r}\ge 1\plus{}\frac{1}{\cos\frac{\pi}{1986}}\] and find the total area of the surface of the pyramid when the equality occurs.

The incentre of a triangle is joined by three segments to the three vertices of the triangle, thereby dividing it into three smaller triangles. If one of these three triangles is similar to the original triangle, find its angles. (A Shapovalov)

A cuboctahedron is a solid with 6 square faces and 8 equilateral triangle faces, with each edge adjacent to both a square and a triangle (see picture). Suppose the ratio of the volume of an octahedron to a cuboctahedron with the same side length is $r$. Find $100r^2$. [asy] // dragon96, replacing // [img]http://i.imgur.com/08FbQs.png[/img] size(140); defaultpen(linewidth(.7)); real alpha=10, x=-0.12, y=0.025, r=1/sqrt(3); path hex=rotate(alpha)*polygon(6); pair A = shift(x,y)*(r*dir(330+alpha)), B = shift(x,y)*(r*dir(90+alpha)), C = shift(x,y)*(r*dir(210+alpha)); pair X = (-A.x, -A.y), Y = (-B.x, -B.y), Z = (-C.x, -C.y); int i; pair[] H; for(i=0; i<6; i=i+1) { H[i] = dir(alpha+60*i);} fill(X--Y--Z--cycle, rgb(204,255,255)); fill(H[5]--Y--Z--H[0]--cycle^^H[2]--H[3]--X--cycle, rgb(203,153,255)); fill(H[1]--Z--X--H[2]--cycle^^H[4]--H[5]--Y--cycle, rgb(255,203,153)); fill(H[3]--X--Y--H[4]--cycle^^H[0]--H[1]--Z--cycle, rgb(153,203,255)); draw(hex^^X--Y--Z--cycle); draw(H[1]--B--H[2]^^H[3]--C--H[4]^^H[5]--A--H[0]^^A--B--C--cycle, linewidth(0.6)+linetype("5 5")); draw(H[0]--Z--H[1]^^H[2]--X--H[3]^^H[4]--Y--H[5]);[/asy]

On a straight line $4$ points are successively set , $A, P, Q,W $, which are the points of intersection of the bisector $AL $ of the triangle $ABC$ with the circumscribed and inscribed circle. Knowing only these points, construct a triangle $ABC $.

Let $ABCD$ be a rectangle. Construct equilateral triangles $BCX$ and $DCY$, in such a way that both of these triangles share some of their interior points with some interior points of the rectangle. Line $AX$ intersects line $CD$ on $P$, and line $AY$ intersects line $BC$ on $Q$. Prove that triangle $APQ$ is equilateral.

What triangles can be cut into three triangles having equal radii of circumcircles?

Let $V$ be a finite set of points in three-dimensional space. Let $S_1, S_2, S_3$ be the sets consisting of the orthogonal projections of the points of $V$ onto the $yz$-plane, $zx$-plane, $xy$-plane, respectively. Prove that $| V|^2 \leq | S1|\cdot|S2|\cdot |S3|$, where $| A|$ denotes the number of elements in the finite set $A.$

Cut a rectangle into $18$ rectangles so that no two adjacent ones form a rectangle.

Andrew the Antelope canters along the surface of a regular icosahedron, which has twenty equilateral triangle faces and edge length 4. If he wants to move from one vertex to the opposite vertex, the minimum distance he must travel can be expressed as $\sqrt{n}$ for some integer $n$. Compute $n$.

[hide=D stands for Descartes, L stands for Leibniz]they had two problem sets under those two names[/hide] [b]L.10[/b] Given the following system of equations where $x, y, z$ are nonzero, find $x^2 + y^2 + z^2$. $$x + 2y = xy$$ $$3y + z = yz$$ $$3x + 2z = xz$$ [u]Set 4[/u] [b]L.16 / D.23[/b] Anson, Billiam, and Connor are looking at a $3D$ figure. The figure is made of unit cubes and is sitting on the ground. No cubes are floating; in other words, each unit cube must either have another unit cube or the ground directly under it. Anson looks from the left side and says, “I see a $5 \times 5$ square.” Billiam looks from the front and says the same thing. Connor looks from the top and says the same thing. Find the absolute difference between the minimum and maximum volume of the figure. [b]L.17[/b] The repeating decimal $0.\overline{MBMT}$ is equal to $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers, and $M, B, T$ are distinct digits. Find the minimum value of $q$. [b]L.18[/b] Annie, Bob, and Claire have a bag containing the numbers $1, 2, 3, . . . , 9$. Annie randomly chooses three numbers without replacement, then Bob chooses, then Claire gets the remaining three numbers. Find the probability that everyone is holding an arithmetic sequence. (Order does not matter, so $123$, $213$, and $321$ all count as arithmetic sequences.) [b]L.19[/b] Consider a set $S$ of positive integers. Define the operation $f(S)$ to be the smallest integer $n > 1$ such that the base $2^k$ representation of $n$ consists only of ones and zeros for all $k \in S$. Find the size of the largest set $S$ such that $f(S) < 2^{2019}$. [b]L.20 / D.25[/b] Find the largest solution to the equation $$2019(x^{2019x^{2019}-2019^2+2019})^{2019} = 2019^{x^{2019}+1}.$$ [u]Set 5[/u] [b]L.21[/b] Steven is concerned about his artistic abilities. To make himself feel better, he creates a $100 \times 100$ square grid and randomly paints each square either white or black, each with probability $\frac12$. Then, he divides the white squares into connected components, groups of white squares that are connected to each other, possibly using corners. (For example, there are three connected components in the following diagram.) What is the expected number of connected components with 1 square, to the nearest integer? [img]https://cdn.artofproblemsolving.com/attachments/e/d/c76e81cd44c3e1e818f6cf89877e56da2fc42f.png[/img] [b]L.22[/b] Let x be chosen uniformly at random from $[0, 1]$. Let n be the smallest positive integer such that $3^n x$ is at most $\frac14$ away from an integer. What is the expected value of $n$? [b]L.23[/b] Let $A$ and $B$ be two points in the plane with $AB = 1$. Let $\ell$ be a variable line through $A$. Let $\ell'$ be a line through $B$ perpendicular to $\ell$. Let X be on $\ell$ and $Y$ be on $\ell'$ with $AX = BY = 1$. Find the length of the locus of the midpoint of $XY$ . [b]L.24[/b] Each of the numbers $a_i$, where $1 \le i \le n$, is either $-1$ or $1$. Also, $$a_1a_2a_3a_4+a_2a_3a_4a_5+...+a_{n-3}a_{n-2}a_{n-1}a_n+a_{n-2}a_{n-1}a_na_1+a_{n-1}a_na_1a_2+a_na_1a_2a_3 = 0.$$ Find the number of possible values for $n$ between $4$ and $100$, inclusive. [b]L.25[/b] Let $S$ be the set of positive integers less than $3^{2019}$ that have only zeros and ones in their base $3$ representation. Find the sum of the squares of the elements of $S$. Express your answer in the form $a^b(c^d - 1)(e^f - 1)$, where $a, b, c, d, e, f$ are positive integers and $a, c, e$ are not perfect powers. PS. You should use hide for answers. D.1-15 / L1-9 problems have been collected [url=https://artofproblemsolving.com/community/c3h2790795p24541357]here [/url] and D.16-30/ L10-15 [url=https://artofproblemsolving.com/community/c3h2790818p24541688]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].