The $48$ faces of $8$ unit cubes are painted white. What is the smallest number of these faces that can be repainted black so that it becomes impossible to arrange the $8$ unit cubes into a two by two by two cube, each of whose $6$ faces is totally white?

Let $\Gamma_1$ and $\Gamma_2$ be circles - with respective centres $O_1$ and $O_2$ - that intersect each other in $A$ and $B$. The line $O_1A$ intersects $\Gamma_2$ in $A$ and $C$ and the line $O_2A$ intersects $\Gamma_1$ in $A$ and $D$. The line through $B$ parallel to $AD$ intersects $\Gamma_1$ in $B$ and $E$. Suppose that $O_1A$ is parallel to $DE$. Show that $CD$ is perpendicular to $O_2C$.

A rectangle of dimensions $2024 \times 2023$ is filled with pieces of the following types: [asy] size(200); // Figure (A) draw((0,0)--(4,0)--(4,1)--(0,1)--cycle); draw((1,0)--(1,1)); draw((2,0)--(2,1)); draw((3,0)--(3,1)); // Figure (B) draw((6,0)--(8,0)--(8,2)--(6,2)--cycle); draw((7,0)--(7,2)); draw((6,1)--(8,1)); // Figure (C) draw((10,0)--(12,0)--(12,1)--(11,1)--(11,2)--(9,2)--(9,1)--(10,1)--cycle); draw((10,0)--(10,1)); draw((11,0)--(11,1)); draw((10,1)--(11,1)); draw((9,1)--(9,2)); draw((10,1)--(10,2)); draw((11,0)--(12,0)); draw((10,1)--(12,1)); // Labeling label("(A)", (2, -0.5)); label("(B)", (7, -0.5)); label("(C)", (10.5, -0.5)); [/asy] Each piece can be turned arround, and each square has side length $1$. Is it possible to use exactly 2023 pieces of type $(A)$?

On each side of an equilateral triangle of side $n \ge 1$ consider $n - 1$ points that divide the sides into $n$ equal segments. Through these points draw parallel lines to the sides of the triangles, obtaining a net of equilateral triangles of side length $1$. On each of the vertices of the small triangles put a coin head up. A move consists in flipping over three mutually adjacent coins. Find all values of $n$ for which it is possible to turn all coins tail up after a finite number of moves. Colombia 1997

Solve the equation [b]a)[/b] $ \log_2^2 +(x-1)\log_2 x =6-2x $ in $ \mathbb{R} . $ [b]b)[/b] $ 2^{x+1}+3^{x+1} +2^{1/x^2}+3^{1/x^2}=18 $ in $ (0,\infty ) . $ [i]Cristinel Mortici[/i]

Let $O, M, N$ be the circumcenter, the centroid and the Nagel point of a triangle. Prove that angle $MON$ is right if and only if one of the triangle’s angles is equal to $60^o$.

If $ x < a < 0$ means that $ x$ and $ a$ are numbers such that $ x$ is less than $ a$ and $ a$ is less than zero, then: $ \textbf{(A)}\ x^2 < ax < 0 \qquad\textbf{(B)}\ x^2 > ax > a^2 \qquad\textbf{(C)}\ x^2 < a^2 < 0$ $ \textbf{(D)}\ x^2 > ax\text{ but }ax < 0 \qquad\textbf{(E)}\ x^2 > a^2\text{ but }a^2 < 0$

Let $\vartriangle ABC$ be an isosceles triangle with $|AB| = |AC|$. Let $D, E$ and $F$ be points on line segments $BC, CA$ and $AB$, respectively, such that $|BF| = |BE|$ and such that $ED$ is the internal angle bisector of $\angle BEC$. Prove that $|BD|= |EF|$ if and only if $|AF| = |EC|$.

Point $D$ is chosen on the side $AC$ of an acute-angled triangle $ABC$. The median $AM$ intersects the altitude $CH$ and the segment $BD$ at points $N$ and $K$ respectively. Prove that if $AK = BK$, then $AN = 2KM$.

Consider a sequence $\{a_n\}_{n\geq 0}$ such that $a_{n+1}=a_n-\lfloor{\sqrt{a_n}}\rfloor\ (n\geq 0),\ a_0\geq 0$. (1) If $a_0=24$, then find the smallest $n$ such that $a_n=0$. (2) If $a_0=m^2\ (m=2,\ 3,\ \cdots)$, then for $j$ with $1\leq j\leq m$, express $a_{2j-1},\ a_{2j}$ in terms of $j,\ m$. (3) Let $m\geq 2$ be integer and for integer $p$ with $1\leq p\leq m-1$, let $a\0=m^2-p$. Find $k$ such that $a_k=(m-p)^2$, then find the smallest $n$ such that $a_n=0$.

Alberto and Barbara are sitting one next to each other in front of a table onto which they arranged in a line $15$ chocolates. Some of them are milk chocolates, while the others are dark chocolates. Starting from Alberto, they play the following game: during their turn, each player eats a positive number of consecutive chocolates, starting from the leftmost of the remaining ones, so that the number of chocolates eaten that are of the same type as the first one is odd (for example, if after some turns the sequence of the remaining chocolates is $\text{MMDMD},$ where $\text{M}$ stands for $\emph{milk}$ and $\text{D}$ for $\emph{dark},$ the player could either eat the first chocolate, the first $4$ chocolates or all $5$ of them). The player eating the last chocolate wins. Among all $2^{15}$ possible initial sequences of chocolates, how many of them allow Barbara to have a winning strategy?

Let $ABCD$ be a parallelogram with diagonal $AC = 10$ such that the distance from $A$ to line $CD$ is $6$ and the distance from $A$ to line $BC$ is $7$. There are two non-congruent configurations of $ABCD$ that satisfy these conditions. The sum of the areas of these two parallelograms is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

Compute the number of quadruples $(a,b,c,d)$ of positive integers satisfying $$12a+21b+28c+84d=2024.$$

A spider built a web on the unit circle. The web is a planar graph with straight edges inside the circle, bounded by the circumference of the circle. Each vertex of the graph lying on the circle belongs to a unique edge, which goes perpendicularly inward to the circle. For each vertex of the graph inside the circle, the sum of the unit outgoing vectors along the edges of the graph is zero. Prove that the total length of the web is equal to the number of its vertices on the circle.

A particle projected vertically upward reaches, at the end of $t$ seconds, an elevation of $s$ feet where $s = 160 t - 16t^2$. The highest elevation is: $\textbf{(A)}\ 800 \qquad \textbf{(B)}\ 640\qquad \textbf{(C)}\ 400 \qquad \textbf{(D)}\ 320 \qquad \textbf{(E)}\ 160$

Given a triangle $\vartriangle ABC$,construct squares $BAQP$ and $ACRS$ outside the triangle $ABC$ (with vertices in that listed in counterclockwise order).Show that the line from $A$ perpendicular to $BC$ passes through the midpoint of the segment $QS$.

There are infinitely many people registered on the social network Mugbook. Some pairs of (different) users are registered as friends, but each person has only finitely many friends. Every user has at least one friend. (Friendship is symmetric; that is, if $A$ is a friend of $B$, then $B$ is a friend of $A$.) Each person is required to designate one of their friends as their best friend. If $A$ designates $B$ as her best friend, then (unfortunately) it does not follow that $B$ necessarily designates $A$ as her best friend. Someone designated as a best friend is called a $1$-best friend. More generally, if $n> 1$ is a positive integer, then a user is an $n$-best friend provided that they have been designated the best friend of someone who is an $(n-1)$-best friend. Someone who is a $k$-best friend for every positive integer $k$ is called popular. (a) Prove that every popular person is the best friend of a popular person. (b) Show that if people can have infinitely many friends, then it is possible that a popular person is not the best friend of a popular person. [i]Romania (Dan Schwarz)[/i]

$a,b,c,d$ are real numbers so that $a\geq b,c\geq d$,\[|a|+2|b|+3|c|+4|d|=1.\] Let $P=(a-b)(b-c)(c-d)$,find the maximum and minimum value of $P$.

$1001$ marbles are drawn at random and without replacement from a jar of $2020$ red marbles and $n$ blue marbles. Find the smallest positive integer $n$ such that the probability that there are more blue marbles chosen than red marbles is strictly greater than $\frac{1}{2}$. [i]Proposed by Taiki Aiba[/i]

Let $ABC$ be a triangle such that $\angle C=2\angle B$ and $\omega$ be its circumcircle. a tangent from $A$ to $\omega$ intersect $BC$ at $E$. $\Omega$ is a circle passing throw $B$ that is tangent to $AC$ at $C$. Let $\Omega\cap AB=F$. $K$ is a point on $\Omega$ such that $EK$ is tangent to $\Omega$ ($A,K$ aren't in one side of $BC$). Let $M$ be the midpoint of arc $BC$ of $\omega$ (not containing $A$). Prove that $AFMK$ is a cyclic quadrilateral. [asy] import graph; size(15.424606256655986cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ real xmin = -7.905629294221492, xmax = 11.618976962434495, ymin = -5.154837585051625, ymax = 4.0091473316396895; /* image dimensions */ pen uuuuuu = rgb(0.26666666666666666,0.26666666666666666,0.26666666666666666); /* draw figures */ draw(circle((1.4210145017438194,0.18096629151696939), 2.581514123077079)); draw(circle((1.4210145017438194,-1.3302878964546825), 2.8984706754484924)); draw(circle((-0.7076932767793396,-0.4161825262831505), 2.9101722408015513), linetype("4 4") + red); draw((3.996177869179178,0.)--(-3.839514259733819,0.)); draw((3.996177869179178,0.)--(0.07833180472267817,2.385828723227042)); draw((0.07833180472267817,2.385828723227042)--(-1.154148865691539,0.)); draw((-3.839514259733819,0.)--(-0.6807342461448075,-3.3262298939043657)); draw((0.07833180472267817,2.385828723227042)--(-3.839514259733819,0.)); /* dots and labels */ dot((3.996177869179178,0.),blue); label("$B$", (4.040279615036859,0.10218054796102663), NE * labelscalefactor,blue); dot((-1.154148865691539,0.),blue); label("$C$", (-1.3803811057738653,-0.14328333373606214), NE * labelscalefactor,blue); dot((1.4210145017438194,1.5681827789938092),linewidth(4.pt)); label("$F$", (1.4629088572174203,1.6465574703052102), NE * labelscalefactor); dot((0.07833180472267817,2.385828723227042),linewidth(3.pt) + blue); label("$A$", (-0.04055741817725232,2.5568193649319144), NE * labelscalefactor,blue); dot((-3.839514259733819,0.),linewidth(3.pt)); label("$E$", (-4.049800819229713,-0.06146203983703255), NE * labelscalefactor); dot((1.4210145017438194,-2.40054783156011),linewidth(4.pt) + uuuuuu); label("$M$", (1.4117705485305265,-2.6490604593938434), NE * labelscalefactor,uuuuuu); dot((-0.6807342461448075,-3.3262298939043657),linewidth(4.pt)); label("$K$", (-0.7871767250058992,-3.5490946922831688), NE * labelscalefactor); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */[/asy]

Find the largest positive integer $N$ so that the number of integers in the set $\{1,2,\dots,N\}$ which are divisible by 3 is equal to the number of integers which are divisible by 5 or 7 (or both).

A circle that passes through the vertices $ B,C $ of a triangle $ ABC, $ cuts the segments $ AB,AC $ (endpoints excluded) in $ N, $ respectively, $ M. $ Consider the point $ P $ on the segment $ MN $ and $ Q $ on the segment $ BC $ (endpoints excluded on both segments) such that the angles $ \angle BAC,\angle PAQ $ have the same bisector. Show that: [b]a)[/b] $ \frac{PM}{PN} =\frac{QB}{QC} . $ [b]b)[/b] The midpoints of the segments $ BM,CN,PQ $ are collinear.

Find the slope of a line passing through the point $(0,\ 1)$ with which the area of the part bounded by the line and the parabola $y=x^2$ is $\frac{5\sqrt{5}}{6}.$

Victor has a drawer with two red socks, two green socks, two blue socks, two magenta socks, two lavender socks, two neon socks, two mauve socks, two wisteria socks, and $2000$ copper socks, for a total of $2016$ socks. He repeatedly draws two socks at a time from the drawer at random, and stops if the socks are of the same color. However, Victor is red-green colorblind, so he also stops if he sees a red and green sock. What is the probability that Victor stops with two socks of the same color? Assume Victor returns both socks to the drawer at each step.

Given some cards with either "$-1$" or "$+1$" written on the opposite side. You are allowed to choose a triple of cards and ask about the product of the three numbers on the cards. What is the minimal number of questions allowing to determine all the numbers on the cards ... a) for $30$ cards, b) for $31$ cards, c) for $32$ cards. (You should prove, that you cannot manage with less questions.) d) Fifty above mentioned cards are lying along the circumference. You are allowed to ask about the product of three consecutive numbers only. You need to determine the product af all the $50$ numbers. What is the minimal number of questions allowing to determine it?