Prove that if the point $ P $ runs through a circle inscribed in the triangle $ ABC $, then the value of the expression $ a \cdot PA^2 + b \cdot PB^2 + c \cdot PC^2 $ is constant ($ a, b, c $ are the lengths of the sides opposite the vertices $ A, B, C $, respectively).

In parallelogram $ABCD$ of the accompanying diagram, line $DP$ is drawn bisecting $BC$ at $N$ and meeting $AB$ (extended) at $P$. From vertex $C$, line $CQ$ is drawn bisecting side $AD$ at $M$ and meeting $AB$ (extended) at $Q$. Lines $DP$ and $CQ$ meet at $O$. If the area of parallelogram $ABCD$ is $k$, then the area of the triangle $QPO$ is equal to [asy] size((400)); draw((0,0)--(5,0)--(6,3)--(1,3)--cycle); draw((6,3)--(-5,0)--(10,0)--(1,3)); label("A", (0,0), S); label("B", (5,0), S); label("C", (6,3), NE); label("D", (1,3), NW); label("P", (10,0), E); label("Q", (-5,0), W); label("M", (.5,1.5), NW); label("N", (5.65, 1.5), NE); label("O", (3.4,1.75)); [/asy] $ \textbf{(A)}\ k \qquad\textbf{(B)}\ \frac{6k}{5} \qquad\textbf{(C)}\ \frac{9k}{8} \qquad\textbf{(D)}\ \frac{5k}{4} \qquad\textbf{(E)}\ 2k $

A crymble is a solid consisting of four white and one black unit cubes as shown in the picture. Find the side length of the smallest cube that can be exactly filled up with crymbles. [img]https://cdn.artofproblemsolving.com/attachments/b/0/b1e50f7abbfb7d356913d746d653fd3875f5ae.png[/img]

Let $\mathbb{Z}_{>0}$ denote the set of positive integers. For any positive integer $k$, a function $f: \mathbb{Z}_{>0} \to \mathbb{Z}_{>0}$ is called [i]$k$-good[/i] if $\gcd(f(m) + n, f(n) + m) \le k$ for all $m \neq n$. Find all $k$ such that there exists a $k$-good function. [i]Proposed by James Rickards, Canada[/i]

$H$ is the intersection point of the heights $AA'$ and $BB'$ of the acute-angled triangle $ABC$. A straight line, perpendicular to $AB$, intersects these heights at points $D$ and $E$, and side $AB$ at point $P$. Prove that the orthocenter of the triangle $DEH$ lies on segment $CP$.

The set of all points $P$ such that the sum of the (undirected) distances from $P$ to two fixed points $A$ and $B$ equals the distance between $A$ and $B$ is $\textbf{(A) }\text{the line segment from }A\text{ to }B\qquad$ $\textbf{(B) }\text{the line passing through }A\text{ and }B\qquad$ $\textbf{(C) }\text{the perpendicular bisector of the line segment from }A\text{ to }B\qquad$ $\textbf{(D) }\text{an elllipse having positive area}\qquad$ $\textbf{(E) }\text{a parabola}$

$2025$ light bulbs are operated by some switches. Each switch works on a subset of the light bulbs. When we use a switch, all the light bulbs in the subset change their state: bulbs that were on turn off, and bulbs that were off turn on. We know that every light bulb is operated by at least one of the switches. Initially, all lamps were off. Find the biggest number $k$ for which we can surely turn on at least $k$ light bulbs. [i]Based on an OKTV problem[/i]

Let $ a$, $ b$, $ c$, $ d$ be positive real numbers such that $ abcd \equal{} 1$ and $ a \plus{} b \plus{} c \plus{} d > \dfrac{a}{b} \plus{} \dfrac{b}{c} \plus{} \dfrac{c}{d} \plus{} \dfrac{d}{a}$. Prove that \[ a \plus{} b \plus{} c \plus{} d < \dfrac{b}{a} \plus{} \dfrac{c}{b} \plus{} \dfrac{d}{c} \plus{} \dfrac{a}{d}\] [i]Proposed by Pavel Novotný, Slovakia[/i]

Given are $8$ weights weighing $1, 2, . . . , 8$ grams, but it is not known which one how much does it weigh. Baron Munchausen claims that he remembers which of the weights weighs how much, and to prove that he is right he is ready to conduct one weighing, as a result of which the weight of at least one of the weights will be unambiguously established. Is he cheating?

For every lattice point $(x, y)$ with $x, y$ non-negative integers, a square of side $\frac{0.9}{2^x5^y}$ with center at the point $(x, y)$ is constructed. Compute the area of the union of all these squares.

The symbol $ 25_b$ represents a two-digit number in the base $ b$. If the number $ 52_b$ is double the number $ 25_b$, then $ b$ is: $ \textbf{(A)}\ 7 \qquad \textbf{(B)}\ 8 \qquad \textbf{(C)}\ 9 \qquad \textbf{(D)}\ 11 \qquad \textbf{(E)}\ 12$

Determine all triples of positive integers $(a, b, n)$ that satisfy the following equation: $a! + b! = 2^n$

Circle $\Gamma$ with radius $1$ is centered at point $A$ on the circumference of circle $\omega$ with radius $7$. Suppose that point $P$ lies on $\omega$ with $AP=4$. Determine the product of the distances from $P$ to the two intersections of $\omega$ and $\Gamma$. [i]2018 CCA Math Bonanza Team Round #6[/i]

Let $ABC$ be a triangle with side lengths $a,b,c$, such that $a$ is the longest side. Prove that $\angle BAC = 90^\circ$ if and only if \[ (\sqrt { a+b } + \sqrt { a-b} )(\sqrt {a+c } + \sqrt { a-c } ) = (a+b+c) \sqrt 2. \]

Find the minimum natural number $n$ with the following property: between any collection of $n$ distinct natural numbers in the set $\{1,2, \dots,999\}$ it is possible to choose four different $a,\ b,\ c,\ d$ such that: $a + 2b + 3c = d$.

The numbers from $ 51$ to $ 150$ are arranged in a $ 10\times 10$ array. Can this be done in such a way that, for any two horizontally or vertically adjacent numbers $ a$ and $ b$, at least one of the equations $ x^2 \minus{} ax \plus{} b \equal{} 0$ and $ x^2 \minus{} bx \plus{} a \equal{} 0$ has two integral roots?

Let $n \ge 2$ be a positive integer. Each square of an $n\times n$ board is coloured red or blue. We put dominoes on the board, each covering two squares of the board. A domino is called [i]even [/i] if it lies on two red or two blue squares and [i]colourful [/i] if it lies on a red and a blue square. Find the largest positive integer $k$ having the following property: regardless of how the red/blue-colouring of the board is done, it is always possible to put $k$ non-overlapping dominoes on the board that are either all [i]even [/i] or all [i]colourful[/i].

(a) In how many ways can $1003$ distinct integers be chosen from the set $\{1, 2, ... , 2003\}$ so that no two of the chosen integers differ by $10?$ (b) Show that there are $(3(5151) + 7(1700)) 101^7$ ways to choose $1002$ distinct integers from the set $\{1, 2, ... , 2003\}$ so that no two of the chosen integers differ by $10.$

In a community of more than six people each member exchanges letters with exactly three other members of the community. Show that the community can be partitioned into two nonempty groups so that each member exchanges letters with at least two members of the group he belongs to.

$ABCD$ is a convex quadrilateral such that $\angle A = \angle C < 90^{\circ}$ and $\angle ABD = 90^{\circ}$. $M$ is the midpoint of $AC$. Prove that $MB$ is perpendicular to $CD$.

Compute the value of the expression \[ 2009^4 \minus{} 4 \times 2007^4 \plus{} 6 \times 2005^4 \minus{} 4 \times 2003^4 \plus{} 2001^4 \, .\]

One country has $n$ cities and every two of them are linked by a railroad. A railway worker should travel by train exactly once through the entire railroad system (reaching each city exactly once). If it is impossible for worker to travel by train between two cities, he can travel by plane. What is the minimal number of flights that the worker will have to use?

The sequence $\{x_{n}\}$ is defined by \[x_{0}\in [0, 1], \; x_{n+1}=1-\vert 1-2 x_{n}\vert.\] Prove that the sequence is periodic if and only if $x_{0}$ is irrational.

Each of two houses $A$ and $B$ is divided into two flats. Several cats and dogs live there. It is known that the fraction of cats in the first flat of $A$ (the ratio between the number of cats and the total number of animals in the flat) is greater than the fraction of cats in the first flat of $B$, and the fraction of cats in the second flat of $A$ is greater than the fraction of cats in the second flat of $B$. Is it true that the fraction of cats in house $A$ is greater than the fraction of cats in house $B$? (AK Kovaldji)

Each point in the plane with integer coordinates is colored red or blue such that the following two properties hold. For any two red points, the line segment joining them does not contain any blue points. For any two blue points that are distance $2$ apart, the midpoint of the line segment joining them is blue. Prove that if three red points are the vertices of a triangle, then the interior of the triangle does not contain any blue points.