For what real values of $k$ do $1988x^2 + kx + 8891$ and $8891x^2 + kx + 1988$ have a common zero?

$\text{ABCD}$ is a rectangle, $\text{D}$ is the center of the circle, and $\text{B}$ is on the circle. If $\text{AD}=4$ and $\text{CD}=3$, then the area of the shaded region is between [asy] pair A,B,C,D; A=(0,4); B=(3,4); C=(3,0); D=origin; draw(circle(D,5)); fill((0,5)..(1.5,4.7697)..B--A--cycle,black); fill(B..(4,3)..(5,0)--C--cycle,black); draw((0,5)--D--(5,0)); label("A",A,NW); label("B",B,NE); label("C",C,S); label("D",D,SW); [/asy] $\text{(A)}\ 4\text{ and }5 \qquad \text{(B)}\ 5\text{ and }6 \qquad \text{(C)}\ 6\text{ and }7 \qquad \text{(D)}\ 7\text{ and }8 \qquad \text{(E)}\ 8\text{ and }9$

Given three lines $ a $, $ b $, $ c $ pairwise skew. Is it possible to construct a parallelepiped whose edges lie on the lines $ a $, $ b $, $ c $?

Let $S$ be a set which is closed under the binary operation $\circ$, with the following properties: (i) there is an element $e \in S$ such that $a \circ e = e \circ a = a$, for each $a \in S$. (ii) $(a \circ b) \circ (c \circ d)=(a \circ c) \circ (b \circ d)$, for all $a,b, c,d \in S$. Prove or disprove: (a) $\circ$ is associative on S (b) $\circ$ is commutative on S

A circle of radius $ 10$ inches has its center at the vertex $ C$ of an equilateral triangle $ ABC$ and passes through the other two vertices. The side $ AC$ extended through $ C$ intersects the circle at $ D$. The number of degrees of angle $ ADB$ is: $ \textbf{(A)}\ 15 \qquad\textbf{(B)}\ 30 \qquad\textbf{(C)}\ 60 \qquad\textbf{(D)}\ 90 \qquad\textbf{(E)}\ 120$

Let $f (x)$ be a function mapping real numbers to real numbers. Given that $f (f (x)) =\frac{1}{3x}$, and $f (2) =\frac19$, find $ f\left(\frac{1}{6}\right)$. [i]Proposed by Zachary Perry[/i]

It is known that, having $6$ weighs, it is possible to balance the scales with loads, which weights are successing natural numbers from $1$ to $63$. Find all such sets of weighs.

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]

Consider a parallelogram $ABCD$ where $AB>AD$. Let $X$ and $Y$, distinct from $B$, be points on the ray $BD^\rightarrow$ such that $CX=CB$ and $AY=AB$. Prove that $DX=DY$. Note: The notation $BD^\rightarrow$ denotes the ray originating from point $B$ passing through point $D$.

Ben has a big blackboard, initially empty, and Francisco has a fair coin. Francisco flips the coin $2013$ times. On the $n^{\text{th}}$ flip (where $n=1,2,\dots,2013$), Ben does the following if the coin flips heads: (i) If the blackboard is empty, Ben writes $n$ on the blackboard. (ii) If the blackboard is not empty, let $m$ denote the largest number on the blackboard. If $m^2+2n^2$ is divisible by $3$, Ben erases $m$ from the blackboard; otherwise, he writes the number $n$. No action is taken when the coin flips tails. If probability that the blackboard is empty after all $2013$ flips is $\frac{2u+1}{2^k(2v+1)}$, where $u$, $v$, and $k$ are nonnegative integers, compute $k$. [i]Proposed by Evan Chen[/i]

Let $ ABC$ be a triangle. Point $ D$ lies on its sideline $ BC$ such that $ \angle CAD \equal{} \angle CBA.$ Circle $ (O)$ passing through $ B,D$ intersects $ AB,AD$ at $ E,F$, respectively. $ BF$ meets $ DE$ at $ G$.Denote by$ M$ the midpoint of $ AG.$ Show that $ CM\perp AO.$

For $a>0,$ find $\lim_{a\to\infty}a^{-\left(\frac{3}{2}+n\right) }\int_{0}^{a}x^{n}\sqrt{1+x}\ dx\ (n=1,\ 2,\ \cdots).$

Let $P(x)$ be a polynomial with rational coefficients such that when $P(x)$ is divided by the polynomial $x^2 + x + 1$, the remainder is $x + 2$, and when $P(x)$ is divided by the polynomial $x^2 + 1$, the remainder is $2x + 1$. There is a unique polynomial of least degree with these two properties. What is the sum of the squares of the coefficients of that polynomial? $\textbf{(A) } 10 \qquad \textbf{(B) } 13 \qquad \textbf{(C) } 19 \qquad \textbf{(D) } 20 \qquad \textbf{(E) } 23$

Let $ABCD$ be a parallelogram. Let $X \notin AC $ lie inside $ABCD$ so that $\angle AXB = \angle CXD = 90^ {\circ}$ and $\Omega$ denote the circumcircle of $AXC$. Consider a diameter $EF$ of $\Omega$ and assume neither $E, \ X, \ B$ nor $F, \ X, \ D$ are collinear. Let $K \neq X$ be an intersection point of circumcircles of $BXE$ and $DXF$ and $L \neq X$ be such point on $\Omega$ so that $\angle KXL = 90^{\circ}$. Prove that $AB = KL$.

Show that for any integer $n \ge 2$ the sum of the fractions $\frac{1}{ab}$, where $a$ and $b$ are relatively prime positive integers such that $a < b \le n$ and $a+b > n$, equals $\frac{1}{2}$. (Integers $a$ and $b$ are called relatively prime if the greatest common divisor of $a$ and $b$ is $1$.)

Prove that for all $n \ge 3$ there are an infinite number of $n$-sided polygonal numbers which are also the sum of two other (not necessarily different) $n$-sided polygonal numbers! The first $n$-sided polygonal number is $1$. The kth n-sided polygonal number for $k \ge 2$ is the number of different points in a figure that consists of all of the regular $n$-sided polygons which have one common vertex, are oriented in the same direction from that vertex and their sides are $\ell$ cm long where $1 \le \ell \le k - 1$ cm and $\ell$ is an integer. [i]In this figure, what we call points are the vertices of the polygons and the points that break up the sides of the polygons into exactly $1$ cm long segments. For example, the first four pentagonal numbers are 1,5,12, and 22, like it is shown in the figure.[/i] [img]https://cdn.artofproblemsolving.com/attachments/1/4/290745d4be1888813678127e6d63b331adaa3d.png[/img]

What is the maximal number of knights that can be placed on the usual 8x8 chessboard so that each of then threatens at most 7 others?

In a triangle $ABC$ angle $\angle BAC = 60^{\circ}$. Point $M$ is the midpoint of $BC$, and $D$ is the foot of altitude from point $A$. Points $T$ and $P$ are marked such that $TBC$ is equilateral, and $\angle BPD=\angle DPC = 30^{\circ}$ and this points lie in the same half-plane with respect to $BC$, not in the same as $A$. Prove that the circumcircles of $ADP$ and $AMT$ are tangent. [i]Ivan Korshunau[/i]

Let $ABCD$ be a parallelogram, $AC$ intersects $BD$ at $I$. Consider point $G$ inside $\triangle ABC$ that satisfy $\angle IAG=\angle IBG\neq 45^{\circ}-\frac{\angle AIB}{4}$. Let $E,G$ be projections of $C$ on $AG$ and $D$ on $BG$. The $E-$ median line of $\triangle BEF$ and $F-$ median line of $\triangle AEF$ intersects at $H$. $a)$ Prove that $AF,BE$ and $IH$ concurrent. Call the concurrent point $L$. $b)$ Let $K$ be the intersection of $CE$ and $DF$. Let $J$ circumcenter of $(LAB)$ and $M,N$ are respectively be circumcenters of $(EIJ)$ and $(FIJ)$. Prove that $EM,FN$ and the line go through circumcenters of $(GAB),(KCD)$ are concurrent.

An "n-pointed star" is formed as follows: the sides of a convex polygon are numbered consecutively $1,2,\cdots,k,\cdots,n$, $n\geq 5$; for all $n$ values of $k$, sides $k$ and $k+2$ are non-parallel, sides $n+1$ and $n+2$ being respectively identical with sides $1$ and $2$; prolong the $n$ pairs of sides numbered $k$ and $k+2$ until they meet. (A figure is shown for the case $n=5$) [img]http://www.artofproblemsolving.com/Forum/album_pic.php?pic_id=704&sid=8da93909c5939e037aa99c429b2d157a[/img] Let $S$ be the degree-sum of the interior angles at the $n$ points of the star; then $S$ equals: $\text{(A)} \ 180 \qquad \text{(B)} \ 360 \qquad \text{(C)} \ 180(n+2) \qquad \text{(D)} \ 180(n-2) \qquad \text{(E)} \ 180(n-4)$

Compute the number of ways a non-self-intersecting concave quadrilateral can be drawn in the plane such that two of its vertices are $(0, 0)$ and $(1, 0)$, and the other two vertices are two distinct lattice points $(a, b)$, $(c, d)$ with $0 \le a$, $c \le 59$ and $1 \le b$, $d \le 5.$ (A concave quadrilateral is a quadrilateral with an angle strictly larger than $180^o$. A lattice point is a point with both coordinates integers.)

Let $x,y,z \in\mathbb{Q}$,such that $(x+y+z)^3=9(x^2y+y^2z+z^2x).$ Prove that $x=y=z$

Given $m,n\geq 2$.Paint each cell of a $m\times n$ board $S$ red or blue so that:for any two red cells in a row,one of the two columns they belong to is all red,and the other column has at least one blue cell in it.Find the number of ways to paint $S$ like this.

Let $a, \ b \in \mathbb{Z_{+}}$. Denote $f(a, b)$ the number sequences $s_1, \ s_2, \ ..., \ s_a$, $s_i \in \mathbb{Z}$ such that $|s_1|+|s_2|+...+|s_a| \le b$. Show that $f(a, b)=f(b, a)$.

For each positive integer $n$, let $k(n)$ be the number of ones in the binary representation of $2023 \cdot n$. What is the minimum value of $k(n)$?