A license plate in a certain state consists of 4 digits, not necessarily distinct, and 2 letters, also not necessarily distinct. These six characters may appear in any order, except that the two letters must appear next to each other. How many distinct license plates are possible? $ \textbf{(A) } 10^4\cdot 26^2 \qquad \textbf{(B) } 10^3\cdot 26^3 \qquad \textbf{(C) } 5\cdot 10^4\cdot 26^2 \qquad \textbf{(D) } 10^2\cdot 26^4\\ \textbf{(E) } 5\cdot 10^3\cdot 26^3$

A square is drawn on a sheet of grid paper on the sides of the cells $ABCD$ with side $8$. Point $E$ is the midpoint of side $BC$, $Q$ is such a point on the diagonal $AC$ such that $AQ: QC = 3: 1$. Find the angle between straight lines $AE$ and $DQ$.

For $m$ and $n$ positive integers that are prime to each other, determine the possible values ​​of $$\gcd (5^m + 7^m, 5^n + 7^n)$$

To each pair $ (x, y)$ of distinct elements of a finite set $ X$ a number $ f(x, y)$ equal to 0 or 1 is assigned in such a way that $ f(x, y) \neq f(y, x)$ $ \forall x,y$ and $ x \neq y.$ Prove that exactly one of the following situations occurs: [b](i)[/b] $ X$ is the union of two disjoint nonempty subsets $ U, V$ such that $ f(u, v) \equal{} 1$ $ \forall u \in U, v \in V.$ [b](ii)[/b] The elements of $ X$ can be labeled $ x_1, \ldots , x_n$ so that \[ f(x_1, x_2) \equal{} f(x_2, x_3) \equal{} \cdots \equal{} f(x_{n\minus{}1}, x_n) \equal{} f(x_n, x_1) \equal{} 1.\] [i]Alternative formulation:[/i] In a tournament of n participants, each pair plays one game (no ties). Prove that exactly one of the following situations occurs: [b](i)[/b] The league can be partitioned into two nonempty groups such that each player in one of these groups has won against each player of the other. [b](ii)[/b] All participants can be ranked 1 through $ n$ so that $ i\minus{}$th player wins the game against the $ (i \plus{} 1)$st and the $ n\minus{}$th player wins against the first.

Show that a circle inscribed in a square has a larger perimeter than any other ellipse inscribed in the square.

There are three colleges in a town. Each college has $n$ students. Any student of any college knows $n+1$ students of the other two colleges. Prove that it is possible to choose a student from each of the three colleges so that all three students would know each other.

In base ten, the number $100! = 100 \cdot 99 \cdot 98 \cdot 97... 2 \cdot 1$ has $158$ digits, and the last $24$ digits are all zeros. Find the number of zeros there are at the end of this same number when it is written in base $24$.

In the acute-angled triangle $ABC$, let $M$ be the midpoint of the atlitude $h_b$ through $B$ and $N$ be the midpoint of the height $h_c$ through $C$. Further let $P$ be the intersection of $AM$ and $h_c$ and $Q$ be the intersection of $AN$ and $h_b$. Show that $M, N, P$ and $Q$ lie on a circle.

$f(k) = k + \left[ \frac{n}{k}\right ] $,$k \in \{1,2,..., n\}$, $k_0 =\left[ \sqrt{n} \right] + 1$. Prove that $f(k_0) < f(k)$ if $k \in \{1,2,..., n\}$

For a point $O$ inside a triangle $ABC$, denote by $A_1,B_1, C_1,$ the respective intersection points of $AO, BO, CO$ with the corresponding sides. Let \[n_1 =\frac{AO}{A_1O}, n_2 = \frac{BO}{B_1O}, n_3 = \frac{CO}{C_1O}.\] What possible values of $n_1, n_2, n_3$ can all be positive integers?

Call a fraction $\frac{a}{b}$, not necessarily in the simplest form [i]special[/i] if $a$ and $b$ are positive integers whose sum is $15$. How many distinct integers can be written as the sum of two, not necessarily different, special fractions? $\textbf{(A)}\ 9 \qquad\textbf{(B)}\ 10 \qquad\textbf{(C)}\ 11 \qquad\textbf{(D)}\ 12 \qquad\textbf{(E)}\ 13$

Wanda the Worm likes to eat Pascal's triangle. One day, she starts at the top of the triangle and eats $\textstyle\binom{0}{0}=1$. Each move, she travels to an adjacent positive integer and eats it, but she can never return to a spot that she has previously eaten. If Wanda can never eat numbers $a,b,c$ such that $a+b=c$, prove that it is possible for her to eat 100,000 numbers in the first 2011 rows given that she is not restricted to traveling only in the first 2011 rows. (Here, the $n+1$st row of Pascal's triangle consists of entries of the form $\textstyle\binom{n}{k}$ for integers $0\le k\le n$. Thus, the entry $\textstyle\binom{n}{k}$ is considered adjacent to the entries $\textstyle\binom{n-1}{k-1}$, $\textstyle\binom{n-1}{k}$, $\textstyle\binom{n}{k-1}$, $\textstyle\binom{n}{k+1}$, $\textstyle\binom{n+1}{k}$, $\textstyle\binom{n+1}{k+1}$.) [i]Linus Hamilton.[/i]

Find all positive integers $m$ that have some multiple of the form $x^2+5y^2+2024$, with $x$ and $y$ integers.

Let $ABCD$ be a unit square. Consider an equilateral triangle $XYZ$ with $X,Y$ as (inner or boundary) points of the square. Determine the locus $M$ of vertices $Z$ of all these triangles $XYZ$ and compute the area of $M.$

Odin and Evelyn are playing a game, Odin going first. There are initially $3k$ empty boxes, for some given positive integer $k$. On each player’s turn, they can write a non-negative integer in an empty box, or erase a number in a box and replace it with a strictly smaller non-negative integer. However, Odin is only ever allowed to write odd numbers, and Evelyn is only allowed to write even numbers. The game ends when either one of the players cannot move, in which case the other player wins; or there are exactly $k$ boxes with the number $0$, in which case Evelyn wins if all other boxes contain the number $1$, and Odin wins otherwise. Who has a winning strategy? $Agnijo \ Banerjee \ , United \ Kingdom$

One half of the water is poured out of a full container. Then one third of the remainder is poured out. Continue the process: one fourth of the remainder for the third pouring, one fifth of the remainder for the fourth pouring, etc. After how many pourings does exactly one tenth of the original water remain? $\text{(A)}\ 6 \qquad \text{(B)}\ 7 \qquad \text{(C)}\ 8 \qquad \text{(D)}\ 9 \qquad \text{(E)}\ 10$

Let $ABC$ be a triangle with $AB=13$, $BC=14$, and $CA=15$. The incircle of $ABC$ meets $BC$ at $D$. Line $AD$ meets the circle through $B$, $D$, and the reflection of $C$ over $AD$ at a point $P\neq D$. Compute $AP$. [i]2020 CCA Math Bonanza Tiebreaker Round #4[/i]

A chess piece moves as follows: it can jump 8 or 9 squares either vertically or horizontally. It is not allowed to visit the same square twice. At most, how many squares can this piece visit on a $15 \times 15$ board (it can start from any square)? [i](4 points)[/i]

Csenge has a yellow and a red foil on her rectangular window which look beautiful in the morning light. Where the two foils overlap, they look orange. The window is $80$ cm tall, $120$ cm wide and its corners are denoted by $A, B, C$ and $D$ in the figure. The two foils are triangular and both have two of their vertices at the two bottom corners of the window, A and $B$. The third vertex of the yellow foil is $S$, the trisecting point of side $DC$ closer to $D$, whereas the third vertex of the red foil is $P$, which is one fourth on the way on segment $SC$, closer to $C$. The red region (i.e. triangle $BPE$) is of area $16$ dm$^2$. What is the total area of the regions not covered by foil? [img]https://cdn.artofproblemsolving.com/attachments/b/c/ea371aeafde6968506da6f3456e88fa0bddc6d.png[/img]

Given an acute triangle $ABC$. The inscribed circle of triangle $ABC$ is tangent to $AB$ and $AC$ at $X$ and $Y$ respectively. Let $CH$ be the altitude. The perpendicular bisector of the segment $CH$ intersects the line $XY$ at $Z$. Prove that $\angle BZC = 90^o.$

If $ x$, $ y$, and $ z$ are positive with $ xy \equal{} 24$, $ xz \equal{} 48$, and $ yz \equal{} 72$, then $ x \plus{} y \plus{} z$ is $ \textbf{(A) }18\qquad\textbf{(B) }19\qquad\textbf{(C) }20\qquad\textbf{(D) }22\qquad\textbf{(E) }24$

Spaceman Fred's spaceship (which has negligible mass) is in an elliptical orbit about Planet Bob. The minimum distance between the spaceship and the planet is $R$; the maximum distance between the spaceship and the planet is $2R$. At the point of maximum distance, Spaceman Fred is traveling at speed $v_\text{0}$. He then fires his thrusters so that he enters a circular orbit of radius $2R$. What is his new speed? [asy] size(300); // Shape draw(circle((0,0),25),dashed+gray); draw(circle((0,0),3.5),linewidth(2)); draw(ellipse((5,0),20,15)); // Dashed Lines draw((25,13)--(25,-35),dotted); draw((0,-35)--(0,-3.3),dotted); draw((0,3.3)--(0,13),dotted); draw((-15,13)--(-15,-35),dotted); // Labels draw((-14,-35)--(-1,-35),Arrows(size=6,SimpleHead)); label(scale(1.2)*"$R$",(-7.5,-35),N); draw((24,-35)--(1,-35),Arrows(size=6,SimpleHead)); label(scale(1.2)*"$2R$",(10,-35),N); // Blobs on Earth path A=(-1.433, 2.667)-- (-1.433, 2.573)-- (-1.360, 2.478)-- (-1.408, 2.360)-- (-1.493, 2.207)-- (-1.554, 2.160)-- (-1.614, 2.113)-- (-1.675, 2.065)-- (-1.735, 1.959)-- (-1.772, 1.877)-- (-1.723, 1.759)-- (-1.748, 1.676)-- (-1.748, 1.523)-- (-1.772, 1.369)-- (-1.760, 1.240)-- (-1.857, 1.145)-- (-1.941, 1.098)-- (-2.050, 1.122)-- (-2.111, 1.086)-- (-2.244, 1.039)-- (-2.390, 1.004)-- (-2.511, 0.909)-- (-2.486, 0.697)-- (-2.499, 0.555)-- (-2.535, 0.414)-- (-2.668, 0.308)-- (-2.765, 0.237)-- (-2.910, 0.131)-- (-3.068, 0.036)-- (-3.250, 0.024)-- (-3.310, 0.154)-- (-3.274, 0.272)-- (-3.286, 0.402)-- (-3.298, 0.532)-- (-3.250, 0.650)-- (-3.165, 0.768)-- (-3.128, 0.933)-- (-3.068, 1.074)-- (-3.032, 1.204)-- (-2.971, 1.310)-- (-2.886, 1.452)-- (-2.801, 1.558)-- (-2.729, 1.652)-- (-2.656, 1.770)-- (-2.583, 1.912)-- (-2.486, 1.995)-- (-2.365, 2.089)-- (-2.244, 2.207)-- (-2.123, 2.313)-- (-2.014, 2.419)-- (-1.905, 2.478)-- (-1.832, 2.573)-- (-1.687, 2.643)-- (-1.578, 2.714)--cycle; filldraw(A,gray); path B=(-0.397, 2.527)-- (-0.468, 2.321)-- (-0.538, 2.154)-- (-0.639, 2.065)-- (-0.760, 2.085)-- (-0.922, 2.085)-- (-0.993, 2.016)-- (-0.770, 1.918)-- (-0.649, 1.829)-- (-0.498, 1.780)-- (-0.367, 1.770)-- (-0.205, 1.751)-- (-0.084, 1.761)-- (-0.104, 1.613)-- (-0.114, 1.495)-- (-0.094, 1.358)-- (0.007, 1.220)-- (0.067, 1.131)-- (0.108, 1.013)-- (0.188, 0.905)-- (0.239, 0.787)-- (0.330, 0.650)-- (0.461, 0.620)-- (0.622, 0.620)-- (0.794, 0.591)-- (0.905, 0.610)-- (0.956, 0.689)-- (1.026, 0.591)-- (1.097, 0.483)-- (1.198, 0.374)-- (1.258, 0.276)-- (1.339, 0.188)-- (1.319, -0.009)-- (1.309, -0.166)-- (1.198, -0.343)-- (1.077, -0.432)-- (0.935, -0.520)-- (0.814, -0.589)-- (0.633, -0.677)-- (0.481, -0.727)-- (0.350, -0.776)-- (0.229, -0.894)-- (0.229, -1.041)-- (0.229, -1.228)-- (0.340, -1.346)-- (0.522, -1.415)-- (0.643, -1.513)-- (0.693, -1.651)-- (0.784, -1.798)-- (0.723, -1.936)-- (0.612, -2.044)-- (0.471, -2.123)-- (0.350, -2.201)-- (0.249, -2.270)-- (0.108, -2.339)-- (-0.013, -2.418)-- (-0.124, -2.535)-- (-0.135, -2.673)-- (-0.175, -2.811)-- (-0.084, -2.840)-- (0.067, -2.840)-- (0.209, -2.830)-- (0.350, -2.742)-- (0.522, -2.653)-- (0.582, -2.604)-- (0.713, -2.545)-- (0.845, -2.457)-- (0.935, -2.408)-- (1.057, -2.388)-- (1.228, -2.280)-- (1.329, -2.191)-- (1.460, -2.132)-- (1.581, -2.093)-- (1.692, -2.044)-- (1.793, -2.005)-- (1.844, -1.906)-- (1.844, -1.828)-- (1.904, -1.749)-- (2.005, -1.621)-- (1.955, -1.454)-- (1.894, -1.287)-- (1.773, -1.189)-- (1.632, -0.992)-- (1.592, -0.874)-- (1.491, -0.736)-- (1.410, -0.569)-- (1.460, -0.412)-- (1.561, -0.274)-- (1.592, -0.078)-- (1.622, 0.168)-- (1.551, 0.306)-- (1.440, 0.404)-- (1.420, 0.561)-- (1.551, 0.620)-- (1.703, 0.630)-- (1.824, 0.532)-- (1.955, 0.365)-- (2.046, 0.453)-- (2.116, 0.551)-- (2.167, 0.689)-- (2.096, 0.807)-- (1.965, 0.905)-- (1.834, 0.935)-- (1.743, 0.994)-- (1.622, 1.131)-- (1.531, 1.249)-- (1.430, 1.348)-- (1.359, 1.515)-- (1.420, 1.702)-- (1.511, 1.839)-- (1.571, 2.016)-- (1.672, 2.134)-- (1.592, 2.232)-- (1.440, 2.291)-- (1.289, 2.350)-- (1.178, 2.252)-- (1.127, 2.134)-- (1.067, 1.997)-- (0.986, 1.898)-- (0.845, 1.839)-- (0.693, 1.839)-- (0.522, 1.859)-- (0.471, 1.977)-- (0.380, 2.124)-- (0.289, 2.203)-- (0.188, 2.291)-- (0.047, 2.311)-- (-0.074, 2.370)-- (-0.195, 2.508)--cycle; filldraw(B,gray); [/asy] (A) $\sqrt{3/2}v_\text{0}$ (B) $\sqrt{5}v_\text{0}$ (C) $\sqrt{3/5}v_\text{0}$ (D) $\sqrt{2}v_\text{0}$ (E) $2v_\text{0}$

Find all quadruples of real numbers $(a,b,c,d)$ such that the equalities \[X^2 + a X + b = (X-a)(X-c) \text{ and } X^2 + c X + d = (X-b)(X-d)\] hold for all real numbers $X$. [i]Morteza Saghafian, Iran[/i]

A sequence of positive integer numbers $a_1,...,a_{100}$ such is that $a_1=1$, and for all $n=1, 2,...,100$ number $(a_1+...+a_n) \left ( \frac{1}{a_1}+...+\frac{1}{a_n} \right )$ is integer. What is the maximum value that can take $ a_{100}$? [i] M. Turevskii [/i]

[b]p1.[/b] A boy has as many sisters as brothers. How ever, his sister has twice as many brothers as sisters. How many boys and girls are there in the family? [b]p2.[/b] Solve each of the following problems. (1) Find a pair of numbers with a sum of $11$ and a product of $24$. (2) Find a pair of numbers with a sum of $40$ and a product of $400$. (3) Find three consecutive numbers with a sum of $333$. (4) Find two consecutive numbers with a product of $182$. [b]p3.[/b] $2008$ integers are written on a piece of paper. It is known that the sum of any $100$ numbers is positive. Show that the sum of all numbers is positive. [b]p4.[/b] Let $p$ and $q$ be prime numbers greater than $3$. Prove that $p^2 - q^2$ is divisible by $24$. [b]p5.[/b] Four villages $A,B,C$, and $D$ are connected by trails as shown on the map. [img]https://cdn.artofproblemsolving.com/attachments/4/9/33ecc416792dacba65930caa61adbae09b8296.png[/img] On each path $A \to B \to C$ and $B \to C \to D$ there are $10$ hills, on the path $A \to B \to D$ there are $22$ hills, on the path $A \to D \to B$ there are $45$ hills. A group of tourists starts from $A$ and wants to reach $D$. They choose the path with the minimal number of hills. What is the best path for them? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].