On a $ 10 \times 10$ chessboard, some $ 4n$ unit squares are chosen to form a region $ \mathcal{R}.$ This region $ \mathcal{R}$ can be tiled by $ n$ $ 2 \times 2$ squares. This region $ \mathcal{R}$ can also be tiled by a combination of $ n$ pieces of the following types of shapes ([i]see below[/i], with rotations allowed). Determine the value of $ n.$

How many sequences of words (not necessarily grammatically correct) have the property that the first word has one letter, each word can be obtained by inserting a letter somewhere in the previous word, and the final word is CCAMT? Here are examples of possible sequences: [center] C,CA,CAM,CCAM,CCAMT. [/center] [center] A,AT,CAT,CAMT,CCAMT. [/center] [i]2021 CCA Math Bonanza Team Round #1[/i]

Let $a_1, a_2, \cdots a_{100}$ be a permutation of $1,2,\cdots 100$. Define $l(k)$ as the maximum $m$ such that there exists $i_1, i_2 \cdots i_m$ such that $a_{i_1} > a_{i_2} > \cdots > a_{i_m}$ or $a_{i_1} < a_{i_2} < \cdots < a_{i_m}$, where $i_1=k$ and $i_1<i_2< \cdots <i_m$ Find the minimum possible value for $\sum_{i=1}^{100} l(i)$.

An equilateral triangle with side $20$ is divided by there series of parallel lines into $400$ equilateral triangles with side $1$. What maximum number of these small triangles can be crossed (internally) by one line? Tuymaada 2017 Q7 Juniors

For an integer $m\geq 1$, we consider partitions of a $2^m\times 2^m$ chessboard into rectangles consisting of cells of chessboard, in which each of the $2^m$ cells along one diagonal forms a separate rectangle of side length $1$. Determine the smallest possible sum of rectangle perimeters in such a partition. [i]Proposed by Gerhard Woeginger, Netherlands[/i]

Let $A = \left\{ 1,2,3,4,5,6,7 \right\}$ and let $N$ be the number of functions $f$ from set $A$ to set $A$ such that $f(f(x))$ is a constant function. Find the remainder when $N$ is divided by $1000$.

Find all $6$ digit natural numbers, which consist of only the digits $1,2,$ and $3$, in which $3$ occurs exactly twice and the number is divisible by $9$.

We call a subset $B$ of natural numbers [i]loyal[/i] if there exists natural numbers $i\le j$ such that $B=\{i,i+1,\ldots,j\}$. Let $Q$ be the set of all [i]loyal[/i] sets. For every subset $A=\{a_1<a_2<\ldots<a_k\}$ of $\{1,2,\ldots,n\}$ we set \[f(A)=\max_{1\le i \le k-1}{a_{i+1}-a_i}\qquad\text{and}\qquad g(A)=\max_{B\subseteq A, B\in Q} |B|.\] Furthermore, we define \[F(n)=\sum_{A\subseteq \{1,2,\ldots,n\}} f(A)\qquad\text{and}\qquad G(n)=\sum_{A\subseteq \{1,2,\ldots,n\}} g(A).\] Prove that there exists $m\in \mathbb N$ such that for each natural number $n>m$ we have $F(n)>G(n)$. (By $|A|$ we mean the number of elements of $A$, and if $|A|\le 1$, we define $f(A)$ to be zero). [i]Proposed by Javad Abedi[/i]

From a squared sheet of paper of size $29 \times 29, 99$ pieces, each a $2\times 2$ square, are cut off (all cutting is along the lines bounding the squares). Prove that at least one more piece of size $2\times 2$ may be cut from the remaining part of the sheet. (S Fomin, Leningrad)

Let $N$ be the number of ways of distributing $8$ chocolates of different brands among $3$ children such that each child gets at least one chocolate, and no two children get the same number of chocolates. Find the sum of the digits of $N$.

For positive integer $a,b,c,d$ there are $a+b+c+d$ points on plane which none of three are collinear. Prove there exist two lines $l_1, l_2 $ such that (1) $l_1, l_2 $ are not parallel. (2) $l_1, l_2 $ do not pass through any of $a+b+c+d$ points. (3) There are $ a, b, c, d $ points on each region separated by two lines $l_1, l_2 $.

A hundred tourists arrive to a hotel at night. They know that in the hotel there are single rooms numbered as $1, 2, \ldots , n$, and among them $k{}$ (the tourists do not know which) are under repair, the other rooms are free. The tourists, one after another, check the rooms in any order (maybe different for different tourists), and the first room not under repair is taken by the tourist. The tourists don’t know whether a room is occupied until they check it. However it is forbidden to check an occupied room, and the tourists may coordinate their strategy beforehand to avoid this situation. For each $k{}$ find the smallest $n{}$ for which the tourists may select their rooms for sure. [i]Fyodor Ivlev[/i]

There is a set of $2n$ chips of $n$ different colors, two chips of each color. The chips are randomly placed in a row. Prove that the probability that there are two adjacent chips of the same color in a row is greater than $1/2$. [i]From the folklore[/i]

The squares in a $9\times 9$ grid are numbered from $11$ to $99$, where the first digit is the row and the second the column. Each square is colored black or white. Squares $44$ and $49$ are black. Every black square shares an edge with at most one other black square, and each white square shares an edge with at most one other white square. What color is square $99$?

Two positive integers $p,q \in \mathbf{Z}^{+}$ are given. There is a blackboard with $n$ positive integers written on it. A operation is to choose two same number $a,a$ written on the blackboard, and replace them with $a+p,a+q$. Determine the smallest $n$ so that such operation can go on infinitely.

We call an even positive integer $n$ [i]nice[/i] if the set $\{1, 2, \dots, n\}$ can be partitioned into $\frac{n}{2}$ two-element subsets, such that the sum of the elements in each subset is a power of $3$. For example, $6$ is nice, because the set $\{1, 2, 3, 4, 5, 6\}$ can be partitioned into subsets $\{1, 2\}$, $\{3, 6\}$, $\{4, 5\}$. Find the number of nice positive integers which are smaller than $3^{2022}$.

There is a standard deck of $52$ cards without jokers. The deck consists of four suits(diamond, club, heart, spade) which include thirteen cards in each. For each suit, all thirteen cards are ranked from “$2$” to “$A$” (i.e. $2, 3,\ldots , Q, K, A$). A pair of cards is called a “[i]straight flush[/i]” if these two cards belong to the same suit and their ranks are adjacent. Additionally, "$A$" and "$2$" are considered to be adjacent (i.e. "A" is also considered as "$1$"). For example, spade $A$ and spade $2$ form a “[i]straight flush[/i]”; diamond $10$ and diamond $Q$ are not a “[i]straight flush[/i]” pair. Determine how many ways of picking thirteen cards out of the deck such that all ranks are included but no “[i]straight flush[/i]” exists in them.

p1. Given a set of $n$ the first natural number. If one of the numbers is removed, then the average number remaining is $21\frac14$ . Specify the number which is deleted. p2. Ipin and Upin play a game of Tic Tac Toe with a board measuring $3 \times 3$. Ipin gets first turn by playing $X$. Upin plays $O$. They must fill in the $X$ or $O$ mark on the board chess in turn. The winner of this game was the first person to successfully compose a sign horizontally, vertically, or diagonally. Determine as many final positions as possible, if Ipin wins in the $4$th step. For example, one of the positions the end is like the picture on the side. [img]https://cdn.artofproblemsolving.com/attachments/6/a/a8946f24f583ca5e7c3d4ce32c9aa347c7e083.png[/img] p3. Numbers $ 1$ to $10$ are arranged in pentagons so that the sum of three numbers on each side is the same. For example, in the picture next to the number the three numbers are $16$. For all possible arrangements, determine the largest and smallest values ​​of the sum of the three numbers. [img]https://cdn.artofproblemsolving.com/attachments/2/8/3dd629361715b4edebc7803e2734e4f91ca3dc.png[/img] p4. Define $$S(n)=\sum_{k=1}^{n}(-1)^{k+1}\,\, , \,\, k=(-1)^{1+1}1+(-1)^{2+1}2+...+(-1)^{n+1}n$$ Investigate whether there are positive integers $m$ and $n$ that satisfy $S(m) + S(n) + S(m + n) = 2011$ p5. Consider the cube $ABCD.EFGH$ with side length $2$ units. Point $A, B, C$, and $D$ lie in the lower side plane. Point $I$ is intersection point of the diagonal lines on the plane of the upper side. Next, make a pyramid $I.ABCD$. If the pyramid $I.ABCD$ is cut by a diagonal plane connecting the points $A, B, G$, and $H$, determine the volume of the truncated pyramid low part.

For a subset $ S$ of vertices of graph $ G$, let $ \Lambda(S)$ be the subset of all edges of $ G$ such that at least one of their ends is in $ S$. Suppose that $ G$ is a graph with $ m$ edges. Let $ d^*: V(G)\longrightarrow\mathbb N\cup\{0\}$ be a function such that a) $ \sum_{u}d^*(u)\equal{}m$. b) For each subset $ S$ of $ V(G)$: \[ \sum_{u\in S}d^*(u)\leq|\Lambda(S)|\] Prove that we can give directions to edges of $ G$ such that for each edge $ e$, $ d^\plus{}(e)\equal{}d^*(e)$.

[b]p1. [/b] If $f(x) = 3x - 1$, what is $f^6(2) = (f \circ f \circ f \circ f \circ f \circ f)(2)$? [b]p2.[/b] A frog starts at the origin of the $(x, y)$ plane and wants to go to $(6, 6)$. It can either jump to the right one unit or jump up one unit. How many ways are there for the frog to jump from the origin to $(6, 6)$ without passing through point $(2, 3)$? [b]p3.[/b] Alfred, Bob, and Carl plan to meet at a café between noon and $2$ pm. Alfred and Bob will arrive at a random time between noon and $2$ pm. They will wait for $20$ minutes or until $2$ pm for all $3$ people to show up after which they will leave. Carl will arrive at the café at noon and leave at $1:30$ pm. What is the probability that all three will meet together? [b]p4.[/b] Let triangle $ABC$ be isosceles with $AB = AC$. Let $BD$ be the altitude from $ B$ to $AC$, $E$ be the midpoint of $AB$, and $AF$ be the altitude from $ A$ to $BC$. If $AF = 8$ and the area of triangle $ACE$ is $ 8$, find the length of $CD$. [b]p5.[/b] Find the sum of the unique prime factors of $(2018^2 - 121) \cdot (2018^2 - 9)$. [b]p6.[/b] Compute the remainder when $3^{102} + 3^{101} + ... + 3^0$ is divided by $101$. [b]p7.[/b] Take regular heptagon $DUKMATH$ with side length $ 3$. Find the value of $$\frac{1}{DK}+\frac{1}{DM}.$$ [b]p8.[/b] RJ’s favorite number is a positive integer less than $1000$. It has final digit of $3$ when written in base $5$ and final digit $4$ when written in base $6$. How many guesses do you need to be certain that you can guess RJ’s favorite number? [b]p9.[/b] Let $f(a, b) = \frac{a^2+b^2}{ab-1}$ , where $a$ and $b$ are positive integers, $ab \ne 1$. Let $x$ be the maximum positive integer value of $f$, and let $y$ be the minimum positive integer value of f. What is $x - y$ ? [b]p10.[/b] Haoyang has a circular cylinder container with height $50$ and radius $5$ that contains $5$ tennis balls, each with outer-radius $5$ and thickness $1$. Since Haoyang is very smart, he figures out that he can fit in more balls if he cuts each of the balls in half, then puts them in the container, so he is ”stacking” the halves. How many balls would he have to cut up to fill up the container? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Metadieu, Tercieu and Quartieu are three bodybuilder warriors who fight against an $n$-headed monster. Each of them can attack the monster according to the following rules: (1) Metadieu's attack consists of cutting off half of the monster's heads, then cutting off one more head. If the monster's number of heads is odd, Metadieu cannot attack; (2) Tercieu's attack consists of cutting off a third of the monster's heads, then cutting off two more heads. If the monster's number of heads is not a multiple of 3, Tercieu cannot attack; (3) Quartieu's attack consists of cutting off a quarter of the monster's heads, then cutting off three more heads. If the monster's number of heads is not a multiple of 4, Quartieu cannot attack; If none of the three warriors can attack the monster at some point, then it will devour our three heroes. The objective of the three warriors is to defeat the monster, and for that they need to cut off all its heads, one warrior attacking at a time. For what positive integer values of $n$ is it possible for the three warriors to combine a sequence of attacks in order to defeat the monster?

Starting from a positive integer $n$, we can replace the current number with a multiple of the current number or by deleting one or more zeroes from the decimal representation of the current number. Prove that for all values of $n$, it is possible to obtain a single-digit number by applying the above algorithm a finite number of times. There is a nice solution to this...

$n$ volleyball teams have competed to each other (each $2$ teams have competed exactly $1$ time.). For every $2$ distinct teams like $A,B$, there exist exactly $t$ teams which have lost their match with $A,B$. Prove that $n=4t+3$. (Notabene that in volleyball, there doesn’t exist tie!)

Numbers from $1$ to $8$ are placed on the vertices of a cube, one on each of the eight vertices, so that the sum of the numbers on any three vertices of the same face is greater than $9$. Determines the minimum value that the sum of the numbers on one side can have.

Caitlin and Donal play a game called [i]Basketball Shoot-Out[/i]. The game consists of $10$ rounds. In each round, Caitlin and Donal both throw a ball simultaneously at each other's basket. If a player's ball falls into the basket, that player scores one point; otherwise, they score zero points. The scoreboard shows the complete sequence of points scored by each player in each of the $10$ rounds of the game. It turns out that Caitlin has scored at least as many points in total as Donal after every round of the game. Prove the number of possible scoreboards is divisible by $4$ but not by $8$.