In the diagram below, angle $ABC$ is a right angle. Point $D$ is on $\overline{BC}$, and $\overline{AD}$ bisects angle $CAB$. Points $E$ and $F$ are on $\overline{AB}$ and $\overline{AC}$, respectively, so that $AE=3$ and $AF=10.$ Given that $EB=9$ and $FC=27$, find the integer closest to the area of quadrilateral $DCFG.$ [asy] size(250); pair A=(0,12), E=(0,8), B=origin, C=(24*sqrt(2),0), D=(6*sqrt(2),0), F=A+10*dir(A--C), G=intersectionpoint(E--F, A--D); draw(A--B--C--A--D^^E--F); pair point=G+1*dir(250); label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F)); label("$G$", G, dir(point--G)); markscalefactor=0.1; draw(rightanglemark(A,B,C)); label("10", A--F, dir(90)*dir(A--F)); label("27", F--C, dir(90)*dir(F--C)); label("3", (0,10), W); label("9", (0,4), W);[/asy]

Let $ABCD$ be a regular triangular pyramid with base $ABC$ (this means that $ABC$ is a regular triangle, and edges $AD$, $BD$ and $CD$ are equal) and plane angles at the opposite vertex equal to $a$. A plane parallel to $ABC$ intersects $AD$, $BD$ and $CD$, respectively, at points $A_1$, $B_1$ and $C_1$. The surface of the polyhedron $ABCA_1B_1C_1$ is cut along five edges: $A_1B_1$, $B_1C_1$, $C_1C$, $CA$ and $AB$, after which this surface is turned onto a plane. At what values of $a$ will the resulting scan necessarily cover itself?

Kathryn, for a history project on sports, chronicled the history of college football. When she mentioned that Auburn got cheated out of the NCAA Football championship in the $2004-05$ season due to the many flaws in the BCS system, her teacher just couldn’t contain her applause, and awarded an automatic A to her for the rest of the year. The lecture was so popular, in fact, that many students pressed Kathryn to record the lecture on video and sell DVDs of it. If the function for Kathryn’s profit for selling DVDs of her college football presentation is $y = -x^2 + 14x + 251$, where $y$ is Kathryn’s profit and $x$ is the price per DVD, what price (in dollars) will maximize her profit?

Let $ a,b,c>0$. Prove that: $ \dfrac{a}{2a\plus{}b}\plus{}\dfrac{b}{2b\plus{}c}\plus{}\dfrac{c}{2c\plus{}a}\leq 1$

Jon and Steve ride their bicycles on a path that parallels two side-by-side train tracks running in the east/west direction. Jon rides east at 20 miles per hour, and Steve rides west at 20 miles per hour. Two trains of equal length traveling in opposite directions at constant but different speeds, each pass the two riders. Each train takes exactly 1 minute to go past Jon. The westbound train takes 10 times as long as the eastbound train to go past Steve. The length of each train is $\tfrac mn$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Let \( n \) be a positive integer, and let \( A \) and \( B \) be \( n \times n \) matrices with real coefficients such that \[ ABBA - BAAB = A - B. \] (a) Prove that \( \text{Tr}(A) = \text{Tr}(B) \) and that \( \text{Tr}(A^2) = \text{Tr}(B^2) \). (b) If \(BA^2B= A^2B^2\) and \(AB^2A= B^2A^2\), prove that \( \det A = \det B \). Note: \( \text{Tr}(X) \) denotes the trace of \( X \), which is the sum of the elements on its main diagonal, and \( \det X \) denotes the determinant of \( X \).

In how many ways can the ”Nikolaus’ House” (see the picture) be drawn? Edges may not be erased nor duplicated, and no additional edges may be drawn. [img]https://cdn.artofproblemsolving.com/attachments/0/5/33795820e0335686b06255180af698e536a9be.png[/img]

A teacher gave a test to a class in which $ 10\%$ of the students are juniors and $ 90\%$ are seniors. The average score on the test was $ 84$. The juniors all received the same score, and the average score of the seniors was $ 83$. What score did each of the juniors receive on the test? $ \textbf{(A)}\ 85 \qquad \textbf{(B)}\ 88 \qquad \textbf{(C)}\ 93 \qquad \textbf{(D)}\ 94 \qquad \textbf{(E)}\ 98$

Give are the integers $a_{1}=11 , a_{2}=1111, a_{3}=111111, ... , a_{n}= 1111...111$( with $2n$ digits) with $n > 8$ . Let $q_{i}= \frac{a_{i}}{11} , i= 1,2,3, ... , n$ the remainder of the division of $a_{i}$ by$ 11$ . Prove that the sum of nine consecutive quotients: $s_{i}=q_{i}+q_{i+1}+q_{i+2}+ ... +q_{i+8}$ is a multiple of $9$ for any $i= 1,2,3, ... , (n-8)$

Let $ABCD$ be a trapezium inscribed in a circle $\Gamma$ with diameter $AB$. Let $E$ be the intersection point of the diagonals $AC$ and $BD$ . The circle with center $B$ and radius $BE$ meets $\Gamma$ at the points $K$ and $L$ (where $K$ is on the same side of $AB$ as $C$). The line perpendicular to $BD$ at $E$ intersects $CD$ at $M$. Prove that $KM$ is perpendicular to $DL$. [i]Greece - Silouanos Brazitikos[/i]

Let $n$ be an even positive integer. We say that two different cells of a $n \times n$ board are [b]neighboring[/b] if they have a common side. Find the minimal number of cells on the $n \times n$ board that must be marked so that any cell (marked or not marked) has a marked neighboring cell.

Given acute triangle $ABC$. Point $D$ is the foot of the perpendicular from $A$ to $BC$. Point $E$ lies on the segment $AD$ and satisfies the equation \[\frac{AE}{ED}=\frac{CD}{DB}\] Point $F$ is the foot of the perpendicular from $D$ to $BE$. Prove that $\angle AFC=90^{\circ}$.

A circular target with a radius of $12$ cm was hit by $19$ shots. Prove that the distance between two hits is less than $7$ cm.

Let $n$ be a positive integer. Prove that the equation \[x+y+\frac{1}{x}+\frac{1}{y}=3n\] does not have solutions in positive rational numbers.

Let $S$ be the Sierpiński triangle. What can we say about the Hausdorff dimension of the elevation sets $f^{-1}(y)$ for typical continuous real functions defined on $S$? (A property is satisfied for typical continuous real functions on $S$ if the set of functions not having this property is of the first Baire category in the metric space of continuous $S\rightarrow\mathbb{R}$ functions with the supremum norm.) (translated by Miklós Maróti)

Let $n \geqslant 3$ be an integer, and let $x_1,x_2,\ldots,x_n$ be real numbers in the interval $[0,1]$. Let $s=x_1+x_2+\ldots+x_n$, and assume that $s \geqslant 3$. Prove that there exist integers $i$ and $j$ with $1 \leqslant i<j \leqslant n$ such that \[2^{j-i}x_ix_j>2^{s-3}.\]

A cube with side length $2$ is inscribed in a sphere. A second cube, with faces parallel to the first, is inscribed between the sphere and one face of the first cube. What is the length of a side of the smaller cube?

Nonzero real numbers $x$, $y$, $a$, and $b$ satisfy $x < a$ and $y < b$. How many of the following inequalities must be true? (I) $x+y < a+b$ (II) $x-y < a-b$ (III) $xy < ab$ (IV) $\frac{x}{y} < \frac{a}{b}$ ${ \textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}}\ 3\qquad\textbf{(E)}\ 4$

Nelson challenges Telma for the following game: First Telma takes $2^9$ numbers from the set $\left\{0,1,2,3,\cdots,1024\right\}$, then Nelson takes $2^8$ of the remaining numbers. Then Telma takes $2^7$ numbers and successively, until only two numbers remain. Nelson will have to give Telma the difference between these two numbers in euros. What is the largest amount Telma can win, whatever Nelson's strategy is?

Given a segment of a circle, consisting of a straight edge and an arc. The length of the straight edge is $24$. The length between the midpoint of the straight edge and the midpoint of the arc is $6$. Find the radius of the circle.

Four people were guessing the number, $N$, of jellybeans in a jar. No two guesses were equally close to $N$. The closest guess was 80 jellybeans, the next closest guess was 60 jellybeans, followed by 49 jellybeans, and the furthest guess was 125 jellybeans. Find the sum of all possible values for $N$. [i]Proposed by CJ Quines[/i]

Let $M$ be the intersection point of the medians $AD$ and $BE$ of a right triangle $ABC$ ($\angle C=90^\circ$). It is known that the circumcircles of triangles $AEM$ and $CDM$ are tangent. Find the angle $\angle BMC.$

Let $ a_i, b_i$ be positive real numbers, $ i\equal{}1,2,\ldots,n$, $ n\geq 2$, such that $ a_i<b_i$, for all $ i$, and also \[ b_1\plus{}b_2\plus{}\cdots \plus{} b_n < 1 \plus{} a_1\plus{}\cdots \plus{} a_n.\] Prove that there exists a $ c\in\mathbb R$ such that for all $ i\equal{}1,2,\ldots,n$, and $ k\in\mathbb Z$ we have \[ (a_i\plus{}c\plus{}k)(b_i\plus{}c\plus{}k) > 0.\]

Let $A_{1}$, $B_{1}$, $C_{1}$ be the feet of the altitudes of an acute-angled triangle $ABC$ issuing from the vertices $A$, $B$, $C$, respectively. Let $K$ and $M$ be points on the segments $A_{1}C_{1}$ and $B_{1}C_{1}$, respectively, such that $\measuredangle KAM = \measuredangle A_{1}AC$. Prove that the line $AK$ is the angle bisector of the angle $C_{1}KM$.

In racing over a distance $d$ at uniform speed, $A$ can beat $B$ by $20$ yards, $B$ can beat $C$ by $10$ yards, and $A$ can beat $C$ by $28$ yards. Then $d$, in yards, equals: ${{ \textbf{(A)}\ \text{Not determined by the given information} \qquad\textbf{(B)}\ 58\qquad\textbf{(C)}\ 100 \qquad\textbf{(D)}\ 116}\qquad\textbf{(E)}\ 120} $