Convex quadrilateral $ABCD$ has $AB = 3, BC = 4, CD = 13, AD = 12,$ and $\angle ABC = 90^\circ,$ as shown. What is the area of the quadrilateral? [asy] unitsize(.4cm); defaultpen(linewidth(.8pt)+fontsize(14pt)); dotfactor=2; pair A,B,C,D; C = (0,0); B = (0,4); A = (3,4); D = (12.8,-2.8); draw(C--B--A--D--cycle); draw(rightanglemark(C,B,A,20)); dot("$A$",A,N); dot("$B$",B,NW); dot("$C$",C,SW); dot("$D$",D,E); [/asy] $ \textbf{(A)}\ 30 \qquad \textbf{(B)}\ 36 \qquad \textbf{(C)}\ 40 \qquad \textbf{(D)}\ 48 \qquad \textbf{(E)}\ 58.5 $

On each unit square of a $9 \times 9$ square, there is a bettle. Simultaneously, at the whistle, each bettle moves from its unit square to another one which has only a common vertex with the original one (thus in diagonal). Some bettles can go to the same unit square. Determine the minimum number of empty unit squares after the moves. Pierre.

An acute angle $XAY$ and a point $P$ inside the angle are given. Construct (using a ruler and a compass) a line that passes through $P$ and intersects the rays $AX$ and $AY$ at $B$ and $C$ such that the area of the triangle $ABC$ equals $AP^2$. [i]Greece[/i]

2 squares are painted in blue and 2 squares are painted in red on a $ 3\times 3$ board in such a way that two square with same color is neither at same row nor at same column. In how many different ways can these four squares be painted? $\textbf{(A)}\ 198 \qquad\textbf{(B)}\ 288 \qquad\textbf{(C)}\ 396 \qquad\textbf{(D)}\ 576 \qquad\textbf{(E)}\ 792$

How many distinct sets are there such that each set contains only non-negative powers of $2$ or $3$ and sum of its elements is $2014$? $ \textbf{(A)}\ 64 \qquad\textbf{(B)}\ 60 \qquad\textbf{(C)}\ 54 \qquad\textbf{(D)}\ 48 \qquad\textbf{(E)}\ \text{None of the preceding} $

Triangle $\vartriangle ABC$ has $AB = 13$, $BC = 14$, and $CA = 15$. $\vartriangle ABC$ has incircle $\gamma$ and circumcircle $\omega$. $\gamma$ has center at $I$. Line $AI$ is extended to hit $\omega$ at $P$. What is the area of quadrilateral $ABPC$?

Let $ABC$ be an acute triangle. $PQRS$ is a rectangle with $P$ on $AB$, $Q$ and $R$ on $BC$, and $S$ on $AC$ such that $PQRS$ has the largest area among all rectangles $TUVW$ with $T$ on $AB$, $U$ and $V$ on $BC$, and $W$ on $AC$. If $D$ is the point on $BC$ such that $AD\perp BC$, then $PQ$ is the harmonic mean of $\frac{AD}{DB}$ and $\frac{AD}{DC}$. What is $BC$? Note: The harmonic mean of two numbers $a$ and $b$ is the reciprocal of the arithmetic mean of the reciprocals of $a$ and $b$. [i]2017 CCA Math Bonanza Lightning Round #4.4[/i]

The set $M$ consists of all $7$-digit positive integer numbers that contain (in decimal notation) each of the digits $1, 3, 4, 6, 7, 8$ and $9$ exactly once. (a) Find the smallest positive difference $d$ of two numbers from $M$. (b) How many pairs $(x, y)$ with $x$ and $y$ from M are there for which $x - y = d$? (Gerhard Kirchner)

A square is divided into $N^2$ equal smaller non-overlapping squares, where $N \geq 3$. We are given a broken line which passes through the centres of all the smaller squares (such a broken line may intersect itself). [list] [*] Show that it is possible to find a broken line composed of $4$ segments for $N = 3$. [*] Find the minimum number of segments in this broken line for arbitrary $N$. [/list]

Determine the sum of all positive integers whose digits (in base ten) form either a strictly increasing or a strictly decreasing sequence.

Prove that there are not intgers $a$ and $b$ with conditions, i) $16a-9b$ is a prime number. ii) $ab$ is a perfect square. iii) $a+b$ is also perfect square.

Find all pairs of integers $ (a,b) $ such that the equation $$ |x-1|+|x-a|+|x-b|=1 $$ has exactly one real solution. [i]Florian Dumitrel[/i]

For how many two-digit integers $n$ is $13 \mid 1 - 2^n - 3^n + 5^n$?

$ P(x)$ is a quadratic trinomial. What maximum number of terms equal to the sum of the two preceding terms can occur in the sequence $ P(1)$, $ P(2)$, $ P(3)$, $ \dots?$ [i]Proposed by A. Golovanov[/i]

The four congruent circles below touch one another and each has radius 1. [asy] unitsize(30); fill(box((-1,-1), (1, 1)), gray); filldraw(circle((1, 1), 1), white); filldraw(circle((1, -1), 1), white); filldraw(circle((-1, 1), 1), white); filldraw(circle((-1, -1), 1), white); [/asy] What is the area of the shaded region?

How many real triples $(x,y,z)$ are there such that $\dfrac{4x^2}{1+4x^2}=y$, $\dfrac{4y^2}{1+4y^2}=z$, $\dfrac{4z^2}{1+4z^2}=x$ ? $ \textbf{(A)}\ 2 \qquad\textbf{(B)}\ 4 \qquad\textbf{(C)}\ 6 \qquad\textbf{(D)}\ \text{Infinitely many} \qquad\textbf{(E)}\ \text{None of the preceding} $

Let $n$ be a positive integer. There are $n$ islands with $n-1$ bridges connecting them such that one can travel from any island to another. One afternoon, a fire breaks out in one of the islands. Every morning, it spreads to all neighbouring islands. (Two islands are neighbours if they are connected by a bridge.) To control the spread, one bridge is destroyed every night until the fire has nowhere to spread the next day. Let $X$ be the minimum possible number of bridges one has to destroy before the fire stops spreading. Find the maximum possible value of $X$ over all possible configurations of bridges and island where the fire starts at.

We consider a game on an infinite chessboard similar to that of solitaire: If two adjacent fields are occupied by pawns and the next field is empty (the three fields lie on a vertical or horizontal line), then we may remove these two pawns and put one of them on the third field. Prove that if in the initial position pawns fill a $3k \times n$ rectangle, then it is impossible to reach a position with only one pawn on the board.

Anis, Banu, and Cholis are going to play a game. They are given an $n\times n$ board consisting of $n^2$ unit squares, where $n$ is an integer and $n > 5$. In the beginning of the game, the number $n$ is written on each unit square. Then Anis, Banu, and Cholis take turns playing the game, repeatedly in that order, according to the following procedure: On every turn, an arrangement of $n$ squares on the same row or column is chosen, and every number from the chosen squares is subtracted by $1$. The turn cannot be done if it results in a negative number, that is, no arrangement of $n$ unit squares on the same column or row in which all of its unit squares contain a positive number can be found. The last person to get a turn wins. Determine which player will win the game.

There are $N{}$ friends and a round pizza. It is allowed to make no more than $100{}$ straight cuts without shifting the slices until all cuts are done; then the resulting slices are distributed among all the friends so that each of them gets a share off pizza having the same total area. Is there a cutting which gives the above result if a) $N=201$ and b) $N=400$?

Let's call the positive integer $x$ interesting, if there exists integer $y$ such that the following equation holds: $(x + y)^y = (x - y)^x.$ Suppose we list all interesting integers in increasing order. An interesting integer is considered very interesting if it is not relatively prime with any other interesting integer preceding it. Find the second very interesting integer. [i]Note: It is assumed that the first interesting integer is not very interesting.[/i] [i]Proposed by Zurab Aghdgomelashvili, Georgia[/i]

Let $A_0$, $A_1$, $A_2$, ..., $A_n$ be nonnegative numbers such that \[ A_0 \le A_1 \le A_2 \le \dots \le A_n. \] Prove that \[ \left| \sum_{i = 0}^{\lfloor n/2 \rfloor} A_{2i} - \frac{1}{2} \sum_{i = 0}^n A_i \right| \le \frac{A_n}{2} \, . \] (Note: $\lfloor x \rfloor$ means the greatest integer that is less than or equal to $x$.)

A triangle $ABC$ and a positive number $k$ are given. Find the locus of a point $M$ inside the triangle such that the projections of $M$ on the sides of $\Delta ABC$ form a triangle of area $k$.

Let's call a polynomial [i]mixed[/i] if it has both positive and negative coefficients ($0$ isn't considered positive or negative). Is the product of two mixed polynomials always mixed? [i]Proposed by Vadym Koval[/i]

a) Find all positive integer solutions of the equation $x^y = y^x$ ($x \ne y$). b) Find all positive rational solutions of the equation $x^y = y^x$ ($x \ne y$).