If $ x^4 \plus{} 4x^3 \plus{} 6px^2 \plus{} 4qx \plus{} r$ is exactly divisible by $ x^3 \plus{} 3x^2 \plus{} 9x \plus{} 3$, the value of $ (p \plus{} q)r$ is: $ \textbf{(A)}\ \minus{} 18 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 15 \qquad \textbf{(D)}\ 27 \qquad \textbf{(E)}\ 45 \qquad$

$(BEL 1)$ A parabola $P_1$ with equation $x^2 - 2py = 0$ and parabola $P_2$ with equation $x^2 + 2py = 0, p > 0$, are given. A line $t$ is tangent to $P_2.$ Find the locus of pole $M$ of the line $t$ with respect to $P_1.$

Let $ n$ be a positive integer. Consider \[ S \equal{} \left\{ (x,y,z) \mid x,y,z \in \{ 0, 1, \ldots, n\}, x \plus{} y \plus{} z > 0 \right \} \] as a set of $ (n \plus{} 1)^{3} \minus{} 1$ points in the three-dimensional space. Determine the smallest possible number of planes, the union of which contains $ S$ but does not include $ (0,0,0)$. [i]Author: Gerhard Wöginger, Netherlands [/i]

Player Zero and Player One play a game on a $n \times n$ board ($n \ge 1$). The columns of this $n \times n$ board are numbered $1,2,4,\dots,2^{n-1}$. Turn my turn, the players put their own number in one of the free cells (thus Player Zero puts a $0$ and Player One puts a $1$). Player Zero begins. When the board is filled, the game ends and each row yields a (reverse binary) number obtained by adding the values of the columns with a $1$ in that row. For instance, when $n=4$, a row with $0101$ yields the number $0 \cdot1+1 \cdot 2+0 \cdot 4+1 \cdot 8=10$. a) For which natural numbers $n$ can Player One always ensure that at least one of the row numbers is divisible by $4$? b) For which natural numbers $n$ can Player One always ensure that at least one of the row numbers is divisible by $3$?

Prove that there are no four points $A, B, C, D$ on a plane such that all triangles $\vartriangle ABC,\vartriangle BCD, \vartriangle CDA, \vartriangle DAB$ are acute ones.

Let $n \in \mathbb{N}_{\geq 2}.$ Prove that for any complex numbers $a_1,a_2,\ldots,a_n$ and $b_1,b_2,\ldots,b_n,$ the following statements are equivalent: a) $\sum_{k=1}^n|z-a_k|^2 \leq \sum_{k=1}^n|z-b_k|^2, \: \forall z \in \mathbb{C}.$ b) $\sum_{k=1}^na_k=\sum_{k=1}^nb_k$ and $\sum_{k=1}^n|a_k|^2 \leq \sum_{k=1}^n|b_k|^2.$

Find all values of the positive integer $k$ that has the property: There are no positive integers $a,b$ such that the expression $A(k,a,b)=\frac{a+b}{a^2+k^2b^2-k^2ab}$ is a composite positive number.

Let $\vartriangle ABC$ be a triangle. The angle bisector of $\angle CAB$ intersects$ BC$ at $L$. On the interior of line segments $AC$ and $AB$, two points, $M$ and $N$, respectively, are chosen in such a way that the lines $AL, BM$ and $CN$ are concurrent, and such that $\angle AMN = \angle ALB$. Prove that $\angle NML = 90^o$.

Mrs. Krabappel gives a five-question pop quiz one Monday. Nobody is ready, so everyone guesses and gets exactly three questions correct. The students later discover that they each answered a different set of three questions correctly. What is the largest possible number of students in the class? $\mathrm{(A) \ } 9 \qquad \mathrm{(B) \ } 10 \qquad \mathrm {(C) \ } 11 \qquad \mathrm{(D) \ } 12 \qquad \mathrm{(E) \ } 13$

Solve the system of equations: \[x>y>z\] \[x+y+z=1\] \[x^2+y^2+z^2=69\] \[x^3+y^3+z^3=271\] [hide=Answer]x=7, y=-2, z=-4[/hide]

There exists a block of $1000$ consecutive positive integers containing no prime numbers, namely, $1001!+2$, $1001!+3$, $\cdots$, $1001!+1001$. Does there exist a block of $1000$ consecutive positive integers containing exactly five prime numbers?

A square with sidelength $1$ is covered by $3$ congruent disks. Find the smallest possible value of the radius of the disks.

Tweaking a convex $n$-gon means the following: choose two adjacent sides $AB$ and $BC$ and replaces them with the line segment $AM$, $MN$, $NC$, where $M \in AB$ and $N \in BC$ are arbitrary points inside these segments. In other words, you cut off a corner and get an $(n+1)$-corner. Starting from a regular hexagon $P_6$ with area $1$, by continuous Tweaks a sequence $P_6,P_7,P_8, ...$ convex polygons. Show that Area of $​​P_n$ for all $n\ge 6$ greater than $\frac1 2$ is, regardless of how tweaks takes place.

The game of pool includes $15$ balls that fit within a triangular rack as shown: [asy] // thanks Ritwin for this diagram :D unitsize(0.6cm); pair pos(real i, real j) { return i*dir(60) + (j,0); } for (int i = 0; i <= 4; ++i) { for (int j = 0; j <= 4-i; ++j) { draw(circle(pos(i,j), .5)); } } pair A = pos(0,0); pair B = pos(0,4); pair C = pos(4,0); pair dd = dir(270) * .5; pair ul = dir(150) * .5; pair ur = dir( 30) * .5; real S = 1.75; draw(A+dd -- B+dd ^^ B+ur -- C+ur ^^ C+ul -- A+ul ); draw(A+dd*S -- B+dd*S ^^ B+ur*S -- C+ur*S ^^ C+ul*S -- A+ul*S); draw(arc(A, A+ul*S, A+dd*S)); draw(arc(B, B+dd*S, B+ur*S)); draw(arc(C, C+ur*S, C+ul*S)); [/asy] Seven of the balls are "striped" (not colored with a single color) and eight are "solid" (colored with a single color). Prove that no matter how the $15$ balls are arranged in the rack, there must always be a pair of striped balls adjacent to each other.

Find all strictly monotone functions $f : \mathbb{R} \to \mathbb{R}$ such that some polynomial $P(x, y)$ satisfies the equality $$f(x + y) = P(f(x), f(y))$$ for all real numbers $x$ and $y$

Determine all triples of integers $(x, y, z)$ that satisfy the equation \[x^z + y^z = z.\]

The bisectors of angles $A$ and $C$ of triangle $ABC$ intersect the circumcircle of this triangle at points $A_0$ and $C_0$, respectively. A straight line passing through the center of the inscribed circle of a triangle $ABC$ is parallel to side $AC$ and intersects line $A_0C_0$ at point $P$. Prove that line $PB$ is tangent to the circumcircle of the triangle $ABC$.

[b]p1.[/b] Two players play the following game. On the lowest left square of an $8\times 8$ chessboard there is a rook. The first player is allowed to move the rook up or to the right by an arbitrary number of squares. The second player is also allowed to move the rook up or to the right by an arbitrary number of squares. Then the first player is allowed to do this again, and so on. The one who moves the rook to the upper right square wins. Who has a winning strategy? [b]p2.[/b] In Crocodile Country there are banknotes of $1$ dollar, $10$ dollars, $100$ dollars, and $1,000$ dollars. Is it possible to get 1,000,000 dollars by using $250,000$ banknotes? [b]p3.[/b] Fifteen positive numbers (not necessarily whole numbers) are placed around the circle. It is known that the sum of every four consecutive numbers is $30$. Prove that each number is less than $15$. [b]p4.[/b] Donald Duck has $100$ sticks, each of which has length $1$ cm or $3$ cm. Prove that he can break into $2$ pieces no more than one stick, after which he can compose a rectangle using all sticks. [b]p5.[/b] Three consecutive $2$ digit numbers are written next to each other. It turns out that the resulting $6$ digit number is divisible by $17$. Find all such numbers. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that $ \frac {( \minus{} 1)^n}{n!}\int_1^2 (\ln x)^n\ dx \equal{} 2\sum_{k \equal{} 1}^n \frac {( \minus{} \ln 2)^k}{k!} \plus{} 1$.

A student council must select a two-person welcoming committee and a three-person planning committee from among its members. There are exactly $10$ ways to select a two-person team for the welcoming committee. It is possible for students to serve on both committees. In how many different ways can a three-person planning committee be selected? $ \textbf{(A)}\ 10\qquad\textbf{(B)}\ 12\qquad\textbf{(C)}\ 15\qquad\textbf{(D)}\ 18\qquad\textbf{(E)}\ 25$

Find the least integer $n$ greater than $345$ such that $\frac{3n+4}{5}, \frac{4n+5}{3},$ and $\frac{5n+3}{4}$ are all integers.

Let $BD$ be an altitude of $\triangle ABC$ with $AB < BC$ and $\angle B > 90^\circ$. Let $M$ be the midpoint of $AC$, and point $K$ be symmetric to point $D$ with respect to point $M$. A perpendicular drawn from point $M$ to the line $BC$ intersects line $AB$ at point $L$. Prove that $\angle MBL = \angle MKL$. [i]Proposed by Oleksandra Yakovenko[/i]

Find all positive integers $r$ with the property that there exists positive prime numbers $p$ and $q$ so that $$p^2 + pq + q^2 = r^2 .$$

An excircle centered at $I_{A}$ touches the side $BC$ of a triangle $ABC$ at point $D$. Prove that the pedal circles of $D$ with respect to the triangles $ABI_{A}$ and $ACI_{A}$ are congruent. Proposed by:K.Belsky

Three different non-zero real numbers $a,b,c$ satisfy the equations $a+\frac{2}{b}=b+\frac{2}{c}=c+\frac{2}{a}=p $, where $p$ is a real number. Prove that $abc+2p=0.$