A magazine printed photos of three celebrities along with three photos of the celebrities as babies. The baby pictures did not identify the celebrities. Readers were asked to match each celebrity with the correct baby pictures. What is the probability that a reader guessing at random will match all three correctly? $\textbf{(A) }\frac{1}{9}\qquad\textbf{(B) }\frac{1}{6}\qquad\textbf{(C) }\frac{1}{4}\qquad\textbf{(D) }\frac{1}{3}\qquad \textbf{(E) }\frac{1}{2}$

Let $a_{1}={11}^{11}$, $a_{2}={12}^{12}$, $a_{3}={13}^{13}$, and \[a_{n}= \vert a_{n-1}-a_{n-2}\vert+\vert a_{n-2}-a_{n-3}\vert, n \ge 4.\] Determine $a_{{14}^{14}}$.

The bisectors of angles $A$, $B$, and $C$ of triangle $ABC$ meet for the second time its circumcircle at points $A_1$, $B_1$, $C_1$ respectively. Let $A_2$, $B_2$, $C_2$ be the midpoints of segments $AA_1$, $BB_1$, $CC_1$ respectively. Prove that the triangles $A_1B_1C_1$ and $A_2B_2C_2$ are similar.

[b]p1.[/b] How many perfect squares are in the set: $\{1, 2, 4, 9, 10, 16, 17, 25, 36, 49\}$? [b]p2.[/b] If $a \spadesuit b = a^b - ab - 5$, what is the value of $2 \spadesuit 11$? [b]p3.[/b] Joe can catch $20$ fish in $5$ hours. Jill can catch $35$ fish in $7$ hours. If they work together, and the number of days it takes them to catch $900$ fish is represented by $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers, what is $m + n$? Assume that they work at a constant rate without taking breaks and that there are an infinite number of fish to catch. [b]p4.[/b] What is the units digit of $187^{10}$? [b]p5.[/b] What is the largest number of regions we can create by drawing $4$ lines in a plane? [b]p6.[/b] A regular hexagon is inscribed in a circle. If the area of the circle is $2025\pi$, given that the area of the hexagon can be expressed as $\frac{a\sqrt{b}}{c}$ for positive integers $a$, $b$, $c$ where $gcd(a, c) = 1$ and $b$ is not divisible by the square of any number other than $1$, find $a + b + c$. [b]p7.[/b] Find the number of trailing zeroes in the product $3! \cdot 5! \cdot 719!$. [b]p8.[/b] How many ordered triples $(x, y, z)$ of odd positive integers satisfy $x + y + z = 37$? [b]p9.[/b] Let $N$ be a number with $2021$ digits that has a remainder of $1$ when divided by $9$. $S(N)$ is the sum of the digits of $N$. What is the value of $S(S(S(S(N))))$? [b]p10.[/b] Ayana rolls a standard die $10$ times. If the probability that the sum of the $10$ die is divisible by $6$ is $\frac{m}{n}$ for relatively prime positive integers $m$, $n$, what is $m + n$? [b]p11.[/b] In triangle $ABC$, $AB=13$, $BC=14$, and $CA=15$. The inscribed circle touches the side $BC$ at point $D$. The line $AI$ intersects side $BC$ at point $K$ given that $I$ is the incenter of triangle $ABC$. What is the area of the triangle $KID$? [b]p12.[/b] Given the cubic equation $2x^3+8x^2-42x-188$, with roots $a, b, c$, evaluate $|a^2b+a^2c+ab^2+b^2c+c^2a+bc^2|$. [b]p13.[/b] In tetrahedron $ABCD$, $AB=6$, $BC=8$, $CA=10$, and $DA$, $DB$, $DC=20$. If the volume of $ABCD$ is $a\sqrt{b}$ where $a$, $b$ are positive integers and in simplified radical form, what is $a + b$? [b]p14.[/b] A $2021$-digit number starts with the four digits $2021$ and the rest of the digits are randomly chosen from the set $0$,$1$,$2$,$3$,$4$,$5$,$6$. If the probability that the number is divisible by $14$ is $\frac{m}{n}$ for relatively prime positive integers $m$, $n$. what is $m + n$? [b]p15.[/b] Let $ABCD$ be a cyclic quadrilateral with circumcenter $O_1$ and circumradius $20$, Let the intersection of $AC$ and $BD$ be $E$. Let the circumcenter of $\vartriangle EDC$ be $O_2$. Given that the circumradius of 4EDC is $13$; $O_1O_2 = 11$, $BE = 11 \sqrt2$, find $O_1E^2$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

When $4444^{4444}$ is written in decimal notation, the sum of its digits is $ A.$ Let $B$ be the sum of the digits of $A.$ Find the sum of the digits of $ B.$ ($A$ and $B$ are written in decimal notation.)

Consider a positive integer $n$ and $A = \{ 1,2,...,n \}$. Call a subset $X \subseteq A$ [i][b]perfect[/b][/i] if $|X| \in X$. Call a perfect subset $X$ [i][b]minimal[/b][/i] if it doesn't contain another perfect subset. Find the number of minimal subsets of $A$.

Suppose that every positve integer has been given one of the colors red, blue,arbitrarily. Prove that there exists an infinite sequence of positive integers $ a_{1} < a_{2} < a_{3} < \cdots < a_{n} < \cdots,$ such that inifinite sequence of positive integers $ a_{1},\frac {a_{1} \plus{} a_{2}}{2},a_{2},\frac {a_{2} \plus{} a_{3}}{2},a_{3},\frac {a_{3} \plus{} a_{4}}{2},\cdots$ has the same color.

Let $n$ be a positive odd integer and let $\theta$ be a real number such that $\theta/\pi$ is irrational. Set $a_{k}=\tan(\theta+k\pi/n),\ k=1,2\dots,n.$ Prove that \[\frac{a_{1}+a_{2}+\cdots+a_{n}}{a_{1}a_{2}\cdots a_{n}}\] is an integer, and determine its value.

Find the area of a convex octagon that is inscribed in a circle and has four consecutive sides of length $3$ and the remaining four sides of length $2$. Give the answer in the form $r+s\sqrt{t}$ with $r,s, t$ positive integers.

If $x,y,z$ satisfies $x^2+y^2+z^2=1$, find the maximum possible value of $$(x^2-yz)(y^2-zx)(z^2-xy)$$

Let \( P(x) \) be a polynomial with natural coefficients. We denote by \( d(n) \) the number of positive divisors of the natural number \( n \), and by \( \sigma(n) \), the sum of these divisors. The sequence \( a_n \) is defined as follows: \[ a_{n+1} \in \left\{ \begin{array}{ll} \sigma(P(d(a_n))) \\ d(P(\sigma(a_n))) \end{array} \right. \] That is, \( a_{n+1} \) is one of the two terms above. Show that there exists a constant \( C \), depending on \( a_1 \) and \( P(x) \), such that for all \( i \), \( a_i < C \); in other words, show that the sequence \( a_n \) is bounded.

Let $P$ be an arbitrary point inside $\triangle ABC$ with sides $3,7,8$. What is the probability that the distance of $P$ to at least one vertices of the triangle is less than $1$? $ \textbf{(A)}\ \frac{\pi}{36}\sqrt 2 \qquad\textbf{(B)}\ \frac{\pi}{36}\sqrt 3 \qquad\textbf{(C)}\ \frac{\pi}{36} \qquad\textbf{(D)}\ \frac12 \qquad\textbf{(E)}\ \frac 34 $

Let $ a,b,c\in \mathbb R$ such that $ a\ge b\ge c > 1$. Prove the inequality: $ \log_c\log_c b \plus{} \log_b\log_b a \plus{} \log_a\log_a c\geq 0$

Let $a$, $b$, $c$, and $d$ be positive real numbers such that \[a^2 + b^2 - c^2 - d^2 = 0 \quad \text{and} \quad a^2 - b^2 - c^2 + d^2 = \frac{56}{53}(bc + ad).\] Let $M$ be the maximum possible value of $\tfrac{ab+cd}{bc+ad}$. If $M$ can be expressed as $\tfrac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, find $100m + n$. [i]Proposed by Robin Park[/i]

$P(x)$ and $Q(x)$ are two polynomials with integer coefficients such that $P(x)|Q(x)^2+1$. [b]a)[/b] Prove that there exists polynomials $A(x)$ and $B(x)$ with rational coefficients and a rational number $c$ such that $P(x)=c(A(x)^2+B(x)^2)$. [b]b)[/b] If $P(x)$ is a monic polynomial with integer coefficients, Prove that there exists two polynomials $A(x)$ and $B(x)$ with integer coefficients such that $P(x)$ can be written in the form of $A(x)^2+B(x)^2$. [i]Proposed by Mohammad Gharakhani[/i]

Incircle of $\triangle ABC$ has centre $I$ and touches sides $AC, AB$ at $E,F$, respectively. The perpendicular bisector of segment $AI$ intersects side $AC$ at $P$. On side $AB$ a point $Q$ is chosen so that $QI \perp FP$. Prove that $EQ \perp AB$.

A positive integer $N$ is called [i]balanced[/i], if $N=1$ or if $N$ can be written as a product of an even number of not necessarily distinct primes. Given positive integers $a$ and $b$, consider the polynomial $P$ defined by $P(x)=(x+a)(x+b)$. (a) Prove that there exist distinct positive integers $a$ and $b$ such that all the number $P(1)$, $P(2)$,$\ldots$, $P(50)$ are balanced. (b) Prove that if $P(n)$ is balanced for all positive integers $n$, then $a=b$. [i]Proposed by Jorge Tipe, Peru[/i]

Given is natural number $n$. Sasha claims that for any $n$ rays in space, no two of which have a common point, he will be able to mark on these rays $k$ points lying on one sphere. What is the largest $k$ for which his statement is true?

A rectangular piece of paper $ABCD$ has sides of lengths $AB = 1$, $BC = 2$. The rectangle is folded in half such that $AD$ coincides with $BC$ and $EF$ is the folding line. Then fold the paper along a line $BM$ such that the corner $A$ falls on line $EF$. How large, in degrees, is $\angle ABM$? [asy] size(180); pathpen = rgb(0,0,0.6)+linewidth(1); pointpen = black+linewidth(3); pointfontpen = fontsize(10); pen dd = rgb(0,0,0.6) + linewidth(0.7) + linetype("4 4"), dr = rgb(0.8,0,0), dg = rgb(0,0.6,0), db = rgb(0,0,0.6)+linewidth(1); pair A=(0,1), B=(0,0), C=(2,0), D=(2,1), E=A/2, F=(2,.5), M=(1/3^.5,1), N=reflect(B,M)*A; D(B--M--D("N",N,NE)--B--D("C",C,SE)--D("D",D,NE)--M); D(D("M",M,plain.N)--D("A",A,NW)--D("B",B,SW),dd); D(D("E",E,W)--D("F",F,plain.E),dd); [/asy]

Distinct pebbles are placed on a $1001 \times 1001$ board consisting of $1001^2$ unit tiles, such that every unit tile consists of at most one pebble. The [i]pebble set[/i] of a unit tile is the set of all pebbles situated in the same row or column with said unit tile. Determine the minimum amount of pebbles that must be placed on the board so that no two distinct tiles have the same [i]pebble set[/i]. [hide=Where's the Algebra Problem?]It's already posted [url=https://artofproblemsolving.com/community/c6h2742895_simple_inequality]here[/url].[/hide]

Let $n$ be a positive integer. Two players $A$ and $B$ play a game in which they take turns choosing positive integers $k \le n$. The rules of the game are: (i) A player cannot choose a number that has been chosen by either player on any previous turn. (ii) A player cannot choose a number consecutive to any of those the player has already chosen on any previous turn. (iii) The game is a draw if all numbers have been chosen; otherwise the player who cannot choose a number anymore loses the game. The player $A$ takes the first turn. Determine the outcome of the game, assuming that both players use optimal strategies. [i]Proposed by Finland[/i]

For any odd prime $p$ and any integer $n,$ let $d_p (n) \in \{ 0,1, \dots, p-1 \}$ denote the remainder when $n$ is divided by $p.$ We say that $(a_0, a_1, a_2, \dots)$ is a [i]p-sequence[/i], if $a_0$ is a positive integer coprime to $p,$ and $a_{n+1} =a_n + d_p (a_n)$ for $n \geqslant 0.$ (a) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_n >b_n$ for infinitely many $n,$ and $b_n > a_n$ for infinitely many $n?$ (b) Do there exist infinitely many primes $p$ for which there exist $p$-sequences $(a_0, a_1, a_2, \dots)$ and $(b_0, b_1, b_2, \dots)$ such that $a_0 <b_0,$ but $a_n >b_n$ for all $n \geqslant 1?$ [I]United Kingdom[/i]

If the length of a rectangle is increased by $20\% $ and its width is increased by $50\% $, then the area is increased by $\text{(A)}\ 10\% \qquad \text{(B)}\ 30\% \qquad \text{(C)}\ 70\% \qquad \text{(D)}\ 80\% \qquad \text{(E)}\ 100\% $

$find$ all non negative integers $m$, $n$ such that $mn-1$ divides $n^3-1$

Calvin makes a number. He starts with $1$, and on each move, he multiplies his current number by $3$, then adds $5$. After $10$ moves, find the sum of the digits (in base $10$) when Calvin's resulting number is expressed in base $9$. [i]Proposed by Calvin Wang [/i]