On an infinite sheet of graph paper a table is drawn so that in each square of the table stands a number equal to the arithmetic mean of the four adjacent numbers. Out of the table a piece is cut along the lines of the graph paper. Prove that the largest number on the piece always occurs at an edge, where $x = \frac14 (a + b + c + d)$.

In the coordinate plane with the origin $O$, consider points $P(t+2,\ 0),\ Q(0, -2t^2-2t+4)\ (t\geq 0).$ If the $y$-coordinate of $Q$ is nonnegative, then find the area of the region swept out by the line segment $PQ$. [i]2011 Ritsumeikan University entrance exam/Pharmacy[/i]

A semicircle has diameter $AB$ with $AB = 100$. Points $C$ and $D$ lie on the semicircle such that $AC = 28$ and $BD = 60$. Find $CD$.

In how many distinguishable rearrangements of the letters ABCCDEEF does the A precede both C's, the F appears between the 2 C's, and the D appears after the F?

Let $ABC$ be a isosceles triangle, with $AB=AC$. A line $r$ that pass through the incenter $I$ of $ABC$ touches the sides $AB$ and $AC$ at the points $D$ and $E$, respectively. Let $F$ and $G$ be points on $BC$ such that $BF=CE$ and $CG=BD$. Show that the angle $\angle FIG$ is constant when we vary the line $r$.

A line parallel to the side $AC$ of a triangle $ABC$ with $\angle C = 90$ intersects side $AB$ at $M$ and side $BC$ at $N$, so that $CN/BN = AC/BC = 2/1$. The segments $CM$ and $AN$ meet at $O$. Let $K$ be a point on the segment $ON$ such that $MO+OK = KN$. The bisector of $\angle ABC$ meets the line through $K$ perpendicular to $AN$ at point $T$. Determine $\angle MTB$.

Given two integers $m\geq 2$ and $n\geq 2$ we consider two types of sequences of length $m\cdot n$ formed exclusively by $0$ and $1$ TYPE 1 sequences are all those that verify the following two conditions: $\bullet$ $a_ka_{k+m} = 0$ for all $k = 1, 2, 3, ...$ $\bullet$ If $a_ka_{k+1} = 1$, then $k$ is a multiple of $m$. TYPE 2 sequences are all those that verify the following two conditions: $\bullet$ $a_ka_{k+n} = 0$ for all $k = 1, 2, 3, ...$ $\bullet$ If $a_ka_{k+1} = 1$, then $k$ is a multiple of $n$. Prove that the number of sequences of type 1 is equal to the number of sequences of type 2.

Given the condition that there exist exactly $1990$ triangles $ABC$ with integral side-lengths satisfying the following conditions: (i) $\angle ABC =\frac 12 \angle BAC;$ (ii) $AC = b.$ Find the minimal value of $b.$

The diagram shows a regular pentagon $ABCDE$ and a square $ABFG$. Find the degree measure of $\angle FAD$. [img]https://cdn.artofproblemsolving.com/attachments/7/5/d90827028f426f2d2772f7d7b875eea4909211.png[/img]

Find all polynomials $p(x)\in\mathbb{R}[x]$ such that for all $x\in \mathbb{R}$: $p(5x)^2-3=p(5x^2+1)$ such that: $a) p(0)\neq 0$ $b) p(0)=0$

Let $a_1, a_2, ...,a_n$ represent an arbitrary arrangement of the numbers $1, 2, ...,n$. Prove that, if $n$ is odd, the product $$(a_1 - 1)(a_2 - 2) ... (a_n -n)$$ is an even number.

Let $s$ and $t$ be the solutions to $x^2-10x+10=0$. Compute $\tfrac{1}{s^5}+\tfrac{1}{t^5}$.

Find the greatest integer $n < 1000$ for which $4n^3 - 3n$ is the product of two consecutive odd integers.

Show that if $D_1$ and $D_2$ are two skew lines, then there are infinitely many straight lines such that their points have equal distance from $D_1$ and $D_2.$

Anita plays the following single-player game: She is given a circle in the plane. The center of this circle and some point on the circle are designated “known points”. Now she makes a series of moves, each of which takes one of the following forms: (i) She draws a line (infinite in both directions) between two “known points”; or (ii) She draws a circle whose center is a “known point” and which intersects another “known point”. Once she makes a move, all intersections between her new line/circle and existing lines/circles become “known points”, unless the new/line circle is identical to an existing one. In other words, Anita is making a ruler-and-compass construction, starting from a circle. What is the smallest number of moves that Anita can use to construct a drawing containing an equilateral triangle inscribed in the original circle?

Two coloured points are marked on a line, with the blue one at the left and the red one at the right. You may add to the line two neighbouring points of the same color (both red or both blue) or delete two such points (neighbouring means that there is no coloured point between these two). Prove that after several such transformation you cannot again get only two points on the line in which the red one is at the left and the blue one is at the right. (A Belov)