If a number is selected at random from the set of all five-digit numbers in which the sum of the digits is equal to $43$, what is the probability that this number is divisible by $11$? $\textbf{(A) }2/5\qquad\textbf{(B) }1/5\qquad\textbf{(C) }1/6\qquad\textbf{(D) }1/11\qquad \textbf{(E) }1/15$

Find the best possible $k,k'$ such that \[k<\frac{v}{v+w}+\frac{w}{w+x}+\frac{x}{x+y}+\frac{y}{y+z}+\frac{z}{z+v}<k'\] for all positive reals $v,w,x,y,z$.

The incircle of triangle $ABC$, is tangent to sides $BC,CA$ and $AB$ in $D,E$ and $F$ respectively. The reflection of $F$ with respect to $B$ and the reflection of $E$ with respect to $C$ are $T$ and $S$ respectively. Prove that the incenter of triangle $AST$ is inside or on the incircle of triangle $ABC$. [i]Proposed by Mehdi E'tesami Fard[/i]

Evaluate the sum $\left\lfloor\log_21\right\rfloor+\left\lfloor\log_22\right\rfloor+\left\lfloor\log_23\right\rfloor+\ldots+\left\lfloor\log_2256\right\rfloor$.

Prove that $5^n-3^n$ is not divisible by $2^n+65$ for any positive integer $n$.

[list=a] [*]A convex pentagon is partitioned into three triangles by nonintersecting diagonals. Is it possible for centroids of these triangles to lie on a common straight line? [*]The same question for a non-convex pentagon. [/list] [i]Alexandr Gribalko[/i]

Let $K$ denote the set $\{a, b, c, d, e\}$. $F$ is a collection of $16$ different subsets of $K$, and it is known that any three members of $F$ have at least one element in common. Show that all $16$ members of $F$ have exactly one element in common.

Let $k$ and $s$ be positive integers such that $s<(2k + 1)^2$. Initially, one cell out of an $n \times n$ grid is coloured green. On each turn, we pick some green cell $c$ and colour green some $s$ out of the $(2k + 1)^2$ cells in the $(2k + 1) \times (2k + 1)$ square centred at $c$. No cell may be coloured green twice. We say that $s$ is $k-sparse$ if there exists some positive number $C$ such that, for every positive integer $n$, the total number of green cells after any number of turns is always going to be at most $Cn$. Find, in terms of $k$, the least $k$-sparse integer $s$. [I]Proposed by Nikolai Beluhov.[/i]

Let $A,B$ be two distinct points on a given circle $O$ and let $P$ be the midpoint of the line segment AB. Let $O_1$ be the circle tangent to the line $AB$ at $P$ and tangent to the circle $O$. Let $l$ be the tangent line, different from the line $AB$, to $O_1$ passing through $A$. Let $C$ be the intersection point, different from $A$, of $l$ and $O$. Let $Q$ be the midpoint of the line segment $BC$ and $O_2$ be the circle tangent to the line $BC$ at $Q$ and tangent to the line segment $AC$. Prove that the circle $O_2$ is tangent to the circle $O$.

Compute the number of ways to rearrange nine white cubes and eighteen black cubes into a $3\times 3\times 3$ cube such that each $1\times1\times3$ row or column contains exactly one white cube. Note that rotations are considered $\textit{distinct}$.

For real numbers $ x$ and $ y$, define $ x\spadesuit y \equal{} (x \plus{} y)(x \minus{} y)$. What is $ 3\spadesuit(4\spadesuit 5)$? $ \textbf{(A) } \minus{} 72 \qquad \textbf{(B) } \minus{} 27 \qquad \textbf{(C) } \minus{} 24 \qquad \textbf{(D) } 24 \qquad \textbf{(E) } 72$

From a point $P$ outside of a circle with centre $O$, tangent segments $PA$ and $PB$ are drawn. $\frac{1}{OA^2}+\frac{1}{PA^2}=\frac{1}{16}$ then $AB=$ [list=1] [*] 4 [*] 6 [*] 8 [*] 10 [/list]

Is it possible to divide a polygon with $21$ sides into $2022$ triangles in such a way that among all the vertices there are not three collinear?

Prove that if $f\colon \mathbb{R} \to \mathbb{R}$ is a continuous periodic function and $\alpha \in \mathbb{R}$ is irrational, then the sequence $\{n\alpha+f(n\alpha)\}_{n=1}^{\infty}$ modulo 1 is dense in $[0,1]$.

Show that in any set of three distinct integers there are two of them, say $a$ and $b$ such that the number $a^5b^3-a^3b^5$ is a multiple of $10$.

Points $A(6,13)$ and $B(12,11)$ lie on circle $\omega$ in the plane. Suppose that the tangent lines to $\omega$ at $A$ and $B$ intersect at a point on the $x$-axis. What is the area of $\omega$? $\textbf{(A) }\frac{83\pi}{8}\qquad\textbf{(B) }\frac{21\pi}{2}\qquad\textbf{(C) } \frac{85\pi}{8}\qquad\textbf{(D) }\frac{43\pi}{4}\qquad\textbf{(E) }\frac{87\pi}{8}$

Given a triangle $ABC$ ($AB \ne AC$). Let $ P$ be a point in the plane containing triangle $ABC$ satisfying the following property: If the projections of $ P$ onto $AB$,$AC$ are $C_1$,$B_1$ respectively, then $\frac{PB}{PC}=\frac{PC_1}{PB_1}=\frac{AB}{AC}$ or $\frac{PB}{PC}=\frac{PB_1}{PC_1}=\frac{AB}{AC}$. Prove that $\angle PBC + \angle PCB = \angle BAC$.

The internal angle bisectors of $A$, $B$, and $C$ in $\triangle ABC$ concur at $I$ and intersect the circumcircle of $\triangle ABC$ at $L$, $M$, and $N$, respectively. The circle with diameter $IL$ intersects $BC$ at $D$ and $E$; the circle with diameter $IM$ intersects $CA$ at $F$ and $G$; the circle with diameter $IN$ intersects $AB$ at $H$ and $J$. Show that $D$, $E$, $F$, $G$, $H$, and $J$ are concyclic.

A positive real $M$ is $strong$ if for any positive reals $a$, $b$, $c$ satisfying $$ \text{max}\left\{ \frac{a}{b+c} , \frac{b}{c+a} , \frac{c}{a+b} \right\} \geqslant M $$ then the following inequality holds: $$\frac{a}{b+c}+\frac{b}{c+a}+\frac{c}{a+b} > 20.$$ (a) Prove that $M=20-\frac{1}{20}$ is not $strong$. (b) Prove that $M=20-\frac{1}{21}$ is $strong$.

Given is an integer $k\geq 2$. Determine the smallest positive integer $n$, such that, among any $n$ points in the plane, there exist $k$ points among them, such that all distances between them are less than or equal to $2$, or all distances are strictly greater than $1$.

A box contains $100$ tickets. Each ticket has a real number written on it. There are no restrictions on the type of number except that they are all different (they can be integers, rational, positive, negative, irrational, large or small). Of course there is one ticket that has the highest number and that is the winner. The game consists of drawing a ticket at random, looking at it and deciding whether to keep it or not. If we choose to keep him, it is verified if he was the oldest, in which case we win a million pesos (if we don't win, the game is over). If we don't think it's the biggest, we can discard it and draw another one, repeating the process until we like one or we run out of tickets. Going back to choose a previously discarded ticket is prohibited. Find a game strategy that gives at least a $25\%$ chance of winning.

How many integers $n$, satisfy $|n|<2020$ and the equation $11^3|n^3+3n^2-107n+1$ (A)$0$ (B)$101$ (C)$367$ (D)$368$

There are $3$ unit squares in a row as shown in the figure below. Each side of this figure is painted by one of the three colors: Blue, Green or Red. It is known that for any square, all the three colors are used and no two adjacent sides have the same color. Find the number of possible colorings. [img]https://cdn.artofproblemsolving.com/attachments/e/c/8963e6716b7d9b23479dd7e106b4bd9a3267c1.png[/img] A. $48$ B. $96$ C. $108$ D. $192$ E. $216$

A [i]zigzag [/i] is a polyline on a plane formed from two parallel rays and a segment connecting the origins of these rays. What is the maximum number of parts a plane can be split into using $ n $ zigzags?

[i]Palindromic partitioning [/i] of the natural number $ A $ is called, when $ A $ is written as the sum of natural the terms $ A = a_1 + a_2 + \ ldots + a_ {n-1} + a_n $ ($ n \geq 1 $), in which $ a_1 = a_n , a_2 = a_ {n-1} $ and in general, $ a_i = a_ {n + 1 - i} $ with $ 1 \leq i \leq n $. For example, $ 16 = 16 $, $ 16 = 2 + 12 + 2 $ and $ 16 = 7 + 1 + 1 + 7 $ are [i]palindromic partitions[/i] of the number $16$. Find the number of all [i]palindromic partitions[/i] of the number $2006$.