Find the smallest positive integer $n$ such that it is possible to paint each of the $64$ squares of an $8 \times 8$ board of one of $n$ colors so that any four squares that form an $L$ as in the following figure (or congruent figures obtained through rotations and/or reflections) have different colors. [img]https://cdn.artofproblemsolving.com/attachments/a/2/c8049b1be8f37657c058949e11faf041856da4.png[/img]

Suppose we have a convex quadrilateral $ABCD$ such that $\angle B = 100^\circ$ and the circumcircle of $\triangle ABC$ has a center at $D$. Find the measure, in degrees, of $\angle D$. [i]Note:[/i] The circumcircle of a $\triangle ABC$ is the unique circle containing $A$, $B$, and $C$.

Let $\{a_n\}$ be a bounded real sequence. (a) Prove that if X is a positive-measure subset of $\mathbb R$, then for almost all $x\in X$, there exist a subsequence $\{y_n\}$ of X such that $$\sum_{n=1}^\infty (n(y_n-x)-a_n)=1$$ (b) construct an unbounded sequence $\{a_n\}$ for which the above equation is also true.

A light has been placed on every lattice point (point with integer coordinates) on the (infinite) 2$D$ plane. Dene the Chebyshev distance between points $(x_1,y_1)$ and $(x_2, y_2)$ to be $\ max (|x_1 - x_2|, |y_1 -y_2|)$. Each light is turned on with probability $\frac{1}{2^{d/2}}$ , where $d$ is the Chebyshev distance from that point to the origin. What is expected number of lights that have all their directly adjacent lights turned on? (Adjacent points being points such that $|x_1-x_2|+|y_1- y_2| =1$.)

Find all functions $f : \mathbb{N} \rightarrow \mathbb{R}$ such that for all triples $a,b,c$ of positive integers the following holds : $$f(ac)+f(bc)-f(c)f(ab) \ge 1$$ Proposed by [i]Mojtaba Zare[/i]

Suppose $x$ is a positive real number such that $\{x\}, [x]$ and $x$ are in a geometric progression. Find the least positive integer $n$ such that $x^n > 100$. (Here $[x]$ denotes the integer part of $x$ and $\{x\} = x - [x]$.)

The function $f(n)$ is defined on the positive integers and takes non-negative integer values. $f(2)=0,f(3)>0,f(9999)=3333$ and for all $m,n:$ \[ f(m+n)-f(m)-f(n)=0 \text{ or } 1. \] Determine $f(1982)$.

There are$ 1$ cm long bars with a number$ 1$, $2$ or $3$ written on each one from them. There is an unlimited supply of bars with each number. Two triangles formed by three bars are considered different if none of them can be built with the bars of the other triangle. (a) How many different triangles formed by three bars are possible? (b) An equilateral triangle of side length $3$ cm is formed using $18$ bars, , divided into $9$ equilateral triangles, different by pairs, $1$ cm long on each side. Find the largest sum possible from the numbers written on the $9$ bars of the border of the big triangle. [center][img]https://cdn.artofproblemsolving.com/attachments/1/1/c2f7edeea3c70ba4689d7b12fe8ac8be72f115.png[/img][/center]

There are $n$ ordered tuples of positive integers $(a,b,c,d)$ that satisfy $$a^2+ b^2+ c^2+ d^2=13 \cdot 2^{13}.$$ Let these ordered tuples be $(a_1,b_1,c_1,d_1), (a_2,b_2,c_2,d_2), \dots, (a_n,b_n,c_n,d_n)$. Compute $\sum_{i=1}^{n}(a_i+b_i+c_i+d_i)$. [i]Proposed by Kaylee Ji[/i]

Any natural number $n, n\ge 3$ can be presented in different ways as a sum several summands (not necessarily different). Find the greatest possible value of these summands. Folklore

For how many positive integers $n$ is \[\left( 1999+\frac{1}{2}\right)^{n}+\left(2000+\frac{1}{2}\right)^{n}\] an integer?

Find the number of pairs of integers $(x, y)$ such that $x^2 + 2y^2 < 25$.

If $ N > 1$, then ${ \sqrt [3] {N \sqrt [3] {N \sqrt [3] {N}}}} =$ $ \textbf{(A)}\ N^{\frac {1}{27}}\qquad \textbf{(B)}\ N^{\frac {1}{9}}\qquad \textbf{(C)}\ N^{\frac {1}{3}}\qquad \textbf{(D)}\ N^{\frac {13}{27}}\qquad \textbf{(E)}\ N$

Find all the $4$-digit natural numbers, written in base $10$, that are equal to the cube of the sum of its digits.

Given a prime $p \geq 5$ , show that there exist at least two distinct primes $q$ and $r$ in the range $2, 3, \ldots p-2$ such that $q^{p-1} \not\equiv 1 \pmod{p^2}$ and $r^{p-1} \not\equiv 1 \pmod{p^2}$.

Define a sequence of polynomials $P_0\left(x\right)=x$ and $P_k\left(x\right)=P_{k-1}\left(x\right)^2-\left(-1\right)^kk$ for each $k\geq1$. Also define $Q_0\left(x\right)=x$ and $Q_k\left(x\right)=Q_{k-1}\left(x\right)^2+\left(-1\right)^kk$ for each $k\geq1$. Compute the product of the distinct real roots of \[P_1\left(x\right)Q_1\left(x\right)P_2\left(x\right)Q_2\left(x\right)\cdots P_{2018}\left(x\right)Q_{2018}\left(x\right).\] [i]2018 CCA Math Bonanza Tiebreaker Round #2[/i]

Find the largest natural number $n$ such that any set of $n$ tetraminoes, each of which is one of the four shapes in the picture, can be placed without overlapping in a $20 \times 20$ table (no tetramino extends beyond the borders of the table), such that each tetramino covers exactly 4 cells of the 20x20 table. An individual tetramino is allowed to turn and flip at will. [img]https://cdn.artofproblemsolving.com/attachments/b/9/0dddb25c2aa07536b711ded8363679e47972d6.png[/img]

Let $ABC$ be an acute-angled triangle with $AB < AC$. Let $\Omega$ be the circumcircle of $ABC$. Let $S$ be the midpoint of the arc $CB$ of $\Omega$ containing $A$. The perpendicular from $A$ to $BC$ meets $BS$ at $D$ and meets $\Omega$ again at $E \neq A$. The line through $D$ parallel to $BC$ meets line $BE$ at $L$. Denote the circumcircle of triangle $BDL$ by $\omega$. Let $\omega$ meet $\Omega$ again at $P \neq B$. Prove that the line tangent to $\omega$ at $P$ meets line $BS$ on the internal angle bisector of $\angle BAC$.

Elmo has 2023 cookie jars, all initially empty. Every day, he chooses two distinct jars and places a cookie in each. Every night, Cookie Monster finds a jar with the most cookies and eats all of them. If this process continues indefinitely, what is the maximum possible number of cookies that the Cookie Monster could eat in one night? [i]Proposed by Espen Slettnes[/i]

Prove that from an arbitrary set of three-digit numbers, including at least four numbers that are mutually prime, you can choose four numbers that are also mutually prime

Let \(ABCDE\) be a regular pentagon. Let \(P\) be a variable point on the interior of segment \(AB\) such that \(PA\ne PB\). The circumcircles of \(\triangle PAE\) and \(\triangle PBC\) meet again at \(Q\). Let \(R\) be the circumcenter of \(\triangle DPQ\). Show that as \(P\) varies, \(R\) lies on a fixed line. [i]Proposed by Karthik Vedula[/i]

Consider positive numbers $h, s_1, s_2$, and a spatial triangle $\vartriangle ABC$. How many ways are there to select a point $D$ so that the height of tetrahedron $ABCD$ drawn from $D$ equals $h$, and the areas of faces $ACD$ and $BCD$ equal $s_1$ and $s_2$, respectively?

Let $\gamma,\gamma_0,\gamma_1,\gamma_2$ be four circles in plane,such that $\gamma_i$ is interiorly tangent to $\gamma$ in point $A_i$,and $\gamma_i$ and $\gamma_{i+1}$ are exteriorly tangent in point $B_{i+2}$,$i=0,1,2$(the indexes are reduced modulo $3$).The tangent in $B_i$,common for circles $\gamma_{i-1}$ and $\gamma_{i+1}$,intersects circle $\gamma$ in point $C_i$,situated in the opposite semiplane of $A_i$ with respect to line $A_{i-1}A_{i+1}$.Prove that the three lines $A_iC_i$ are concurrent.

The graph shows the number of minutes studied by both Asha (black bar) and Sasha (grey bar) in one week. On the average, how many more minutes per day did Sasha study than Asha? [asy] size(300); real i; defaultpen(linewidth(0.8)); draw((0,140)--origin--(220,0)); for(i=1;i<13;i=i+1) { draw((0,10*i)--(220,10*i)); } label("$0$",origin,W); label("$20$",(0,20),W); label("$40$",(0,40),W); label("$60$",(0,60),W); label("$80$",(0,80),W); label("$100$",(0,100),W); label("$120$",(0,120),W); path MonD=(20,0)--(20,60)--(30,60)--(30,0)--cycle,MonL=(30,0)--(30,70)--(40,70)--(40,0)--cycle,TuesD=(60,0)--(60,90)--(70,90)--(70,0)--cycle,TuesL=(70,0)--(70,80)--(80,80)--(80,0)--cycle,WedD=(100,0)--(100,100)--(110,100)--(110,0)--cycle,WedL=(110,0)--(110,120)--(120,120)--(120,0)--cycle,ThurD=(140,0)--(140,80)--(150,80)--(150,0)--cycle,ThurL=(150,0)--(150,110)--(160,110)--(160,0)--cycle,FriD=(180,0)--(180,70)--(190,70)--(190,0)--cycle,FriL=(190,0)--(190,50)--(200,50)--(200,0)--cycle; fill(MonD,grey); fill(MonL,lightgrey); fill(TuesD,grey); fill(TuesL,lightgrey); fill(WedD,grey); fill(WedL,lightgrey); fill(ThurD,grey); fill(ThurL,lightgrey); fill(FriD,grey); fill(FriL,lightgrey); draw(MonD^^MonL^^TuesD^^TuesL^^WedD^^WedL^^ThurD^^ThurL^^FriD^^FriL); label("M",(30,-5),S); label("Tu",(70,-5),S); label("W",(110,-5),S); label("Th",(150,-5),S); label("F",(190,-5),S); label("M",(-25,85),W); label("I",(-27,75),W); label("N",(-25,65),W); label("U",(-25,55),W); label("T",(-25,45),W); label("E",(-25,35),W); label("S",(-26,25),W);[/asy] $ \textbf{(A)}\ 6\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 12 $

Let $n$ be a positive integer. Find all real solutions $(a_1, a_2, \dots, a_n)$ to the system: \[a_1^2 + a_1 - 1 = a_2\] \[ a_2^2 + a_2 - 1 = a_3\] \[\hspace*{3.3em} \vdots \] \[a_{n}^2 + a_n - 1 = a_1\]