Assume the $n$ sets $A_1, A_2..., A_n$ are a partition of the set $A=\{1,2,...,29\}$, and the sum of any elements in $A_i$ , $(i=1,2,...,n)$ is not equal to $30$. Find the smallest possible value of $n$.

Given is a $K_{2024}$ in which every edge has weight $1$ or $2$. If every cycle has even total weight, find the minimal value of the sum of all weights in the graph.

Let $n$ a positive integer. We call a pair $(\pi ,C)$ composed by a permutation $\pi$$:$ {$1,2,...n$}$\rightarrow${$1,2,...,n$} and a binary function $C:$ {$1,2,...,n$}$\rightarrow${$0,1$} "revengeful" if it satisfies the two following conditions: $1)$For every $i$ $\in$ {$1,2,...,n$}, there exist $j$ $\in$ $S_{i}=${$i, \pi(i),\pi(\pi(i)),...$} such that $C(j)=1$. $2)$ If $C(k)=1$, then $k$ is one of the $v_{2}(|S_{k}|)+1$ highest elements of $S_{k}$, where $v_{2}(t)$ is the highest nonnegative integer such that $2^{v_{2}(t)}$ divides $t$, for every positive integer $t$. Let $V$ the number of revengeful pairs and $P$ the number of partitions of $n$ with all parts powers of $2$. Determine $\frac{V}{P}$.

There are $12$ monsters in a plane. Each monster is capable of spraying fire in a $30$-degree cone. Prove that monsters can destroy the plane.

$p$ passengers get on a train with $n$ wagons. Find the probability of being at least one passenger at each wagon.

We call a permutation of the numbers $1$, $2$, $3$, $\dots$ , $n$ 'kawaii' if there is exactly one number that is greater than its position. For example: $1$, $4$, $3$, $2$ is a kawaii permutation (when $n=4$) because only the number $4$ is greater than its position $2$. How many kawaii permutations are there if $n=14$?

In a school there are $2021$ doors with the numbers $1,2,\dots,2021$. In a day $2021$ students play the following game: Initially all the doors are closed, and each student receive a card to define the order, there are exactly $2021$ cards. The numbers in the cards are $1,2,\dots,2020,2021$. The order will be student $1$ first, student $2$ will be the second, and going on. The student $k$ will change the state of the doors $k,2k,4k,8k,\dots,2^pk$ with $2^pk\leq 2021\leq 2^{p+1}k$. Change the state is [b]if the door was close, it will be open and vice versa.[/b] a) After the round of the student $16$, determine the configuration of the doors $1,2,\dots,16$ b) After the round of the student $2021$, determine how many doors are closed.

$S$ is a $(k+1) \times (k+1)$ array of lattice points. How many squares have their vertices in $S$?

Let $S = \{1,2,3,4,5\}$. Find the number of functions $f : S \to S$ such that $f ^{50}(x)= x$ for all $x \in S$.

A cube has been divided into $27$ equal-sized sub-cubes. We take a line that passes through the interiors of as many sub-cubes as possible. How many does it pass through?

Initially, the number $10$ is written on the board. In each subsequent moves, you can either (i) erase the number $1$ and replace it with a $10$, or (ii) erase the number $10$ and replace it with a $1$ and a $25$ or (iii) erase a $25$ and replace it with two $10$. After sometime, you notice that there are exactly one hundred copies of $1$ on the board. What is the least possible sum of all the numbers on the board at that moment?

Given real numbers $x_i,y_i (i=1,2,\ldots ,n)$, let $A$ be the $n\times n$ matrix given by $a_{ij}=1$ if $x_i\ge y_j$ and $a_{ij}=0$ otherwise. Suppose $B$ is a $n\times n$ matrix whose entries are $0$ and $1$ such that the sum of entries in any row or column of $B$ equals the sum of entries in the corresponding row or column of $A$. Prove that $B=A$.

[b]p1.[/b] Farmer John wants to bring some cows to a pasture with grass that grows at a constant rate. Initially, the pasture has some nonzero amount of grass and it will stop growing if there is no grass left. The pasture sustains $100$ cows for ten days. The pasture can also sustain $100$ cows for five days, and then $120$ cows for three more days. If cows eat at a constant rate, fund the maximum number of cows Farmer John can bring to the pasture so that they can be sustained indefinitely. [b]p2.[/b] Sam is learning basic arithmetic. He may place either the operation $+$ or $-$ in each of the blank spots between the numbers below: $$5\,\, \_ \,\, 8\,\, \_ \,\,9\,\, \_ \,\,7\,\,\_ \,\,2\,\,\_ \,\,3$$ In how many ways can he place the operations so the result is divisible by $3$? [b]p3.[/b] Will loves the color blue, but he despises the color red. In the $5\times 6$ rectangular grid below, how many rectangles are there containing at most one red square and with sides contained in the gridlines? [img]https://cdn.artofproblemsolving.com/attachments/1/7/7ce55bdc9e05c7c514dddc7f8194f3031b93c4.png[/img] [b]p4.[/b] Let $r_1, r_2, r_3$ be the three roots of a cubic polynomial $P(x)$. Suppose that $$\frac{P(2) + P(-2)}{P(0)}= 200.$$ If $\frac{1}{r_1r_2}+ \frac{1}{r_2r_3}+\frac{1}{r_3r_1}= \frac{m}{n}$ for relatively prime positive integers $m$ and $n$, compute $m + n$. [b]p5.[/b] Consider a rectangle $ABCD$ with $AB = 3$ and $BC = 1$. Let $O$ be the intersection of diagonals $AC$ and $BD$. Suppose that the circumcircle of $ \vartriangle ADO$ intersects line $AB$ again at $E \ne A$. Then, the length $BE$ can be written as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $m + n$. [b]p6.[/b] Let $ABCD$ be a square with side length $100$ and $M$ be the midpoint of side $AB$. The circle with center $M$ and radius $50$ intersects the circle with center $D$ and radius $100$ at point $E$. $CE$ intersects $AB$ at $F$. If $AF = \frac{m}{n}$ for relatively prime positive integers $m$ and $n$, find $m + n$. [b]p7.[/b] How many pairs of real numbers $(x, y)$, with $0 < x, y < 1$ satisfy the property that both $3x + 5y$ and $5x + 2y$ are integers? [b]p8.[/b] Sebastian is coloring a circular spinner with $4$ congruent sections. He randomly chooses one of four colors for each of the sections. If two or more adjacent sections have the same color, he fuses them and considers them as one section. (Sections meeting at only one point are not adjacent.) Suppose that the expected number of sections in the final colored spinner is equal to $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]p9.[/b] Let $ABC$ be a triangle and $D$ be a point on the extension of segment $BC$ past $C$. Let the line through $A$ perpendicular to $BC$ be $\ell$. The line through $B$ perpendicular to $AD$ and the line through $C$ perpendicular to $AD$ intersect $\ell$ at $H_1$ and $H_2$, respectively. If $AB = 13$, $BC = 14$, $CA = 15$, and $H_1H_2 = 1001$, find $CD$. [b]p10.[/b] Find the sum of all positive integers $k$ such that $$\frac21 -\frac{3}{2 \times 1}+\frac{4}{3\times 2\times 1} + ...+ (-1)^{k+1} \frac{k+1}{k\times (k - 1)\times ... \times 2\times 1} \ge 1 + \frac{1}{700^3}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

On a table there are several cards, some face up and others face down. The allowed operation is to choose 4 cards and turn them over. The goal is to get all the cards in the same state (all face up or all face down). Determine if the objective can be achieved through a sequence of permitted operations if initially there are: a) 101 cards face up and 102 face down; b) 101 cards face up and 101 face down.

In a one-round football tournament, three points were awarded for a victory. All the teams scored different numbers of points. If not three, but two points were given for a victory, then all teams would also have a different number of points, but each team's place would be different. What is the smallest number of teams for which this is possible? [i]Proposed by A. Zaslavsky[/i]

Let $S$ be a nonempty set of positive integers. We say that a positive integer $n$ is [i]clean[/i] if it has a unique representation as a sum of an odd number of distinct elements from $S$. Prove that there exist infinitely many positive integers that are not clean.

Players A and B play a game. They are given a box with $n=>1$ candies. A starts first. On a move, if in the box there are $k$ candies, the player chooses positive integer $l$ so that $l<=k$ and $(l, k) =1$, and eats $l$ candies from the box. The player who eats the last candy wins. Who has winning strategy, in terms of $n$.

Let $n$ and $k$ be positive integers such that $k\leq 2^n$. Banana and Corona are playing the following variant of the guessing game. First, Banana secretly picks an integer $x$ such that $1\leq x\leq n$. Corona will attempt to determine $x$ by asking some questions, which are described as follows. In each turn, Corona chooses $k$ distinct subsets of $\{1, 2, \ldots, n\}$ and, for each chosen set $S$, asks the question "Is $x$ in the set $S$?''. Banana picks one of these $k$ questions and tells both the question and its answer to Corona, who can then start another turn. Find all pairs $(n,k)$ such that, regardless of Banana's actions, Corona could determine $x$ in finitely many turns with absolute certainty. [i]Pitchayut Saengrungkongka, Thailand[/i]

Some club has 42 members. It’s known that among 31 arbitrary club members, we can find one pair of a boy and a girl that they know each other. Show that from club members we can choose 12 pairs of knowing each other boys and girls.

Let $X=(x_1,x_2,......,x_9)$ be a permutation of the set $\{1,2,\ldots,9\}$ and let $A$ be the set of all such $X$ . For any $X \in A$, denote $f(X)=x_1+2x_2+\cdots+9x_9$ and $ M=\{f(X)|X \in A \}$. Find $|M|$. ($|S|$ denotes number of members of the set $S$.)

$ n$ points (no three being collinear) are given in a plane. Some points are connected and they form $ k$ segments. If no three of these segments form triangle ( equiv. there are no three points, such that each two of them are connected) prove that $ k \leq \left \lfloor \frac {n^{2}}{4}\right\rfloor$

Alice is planning a trip from the Bay Area to one of $5$ possible destinations (each of which is serviced by only $1$ airport) and wants to book two flights, one to her destination and one returning. There are $3$ airports within the Bay Area from which she may leave and to which she may return. In how many ways may she plan her flight itinerary?

The degrees of all vertices of a graph are not less than 100 and not more than 200. Prove that its vertices can be divided into connected pairs and triples.

[b]p1.[/b] Suppose that $20\%$ of a number is $17$. Find $20\%$ of $17\%$ of the number. [b]p2.[/b] Let $A, B, C, D$ represent the numbers $1$ through $4$ in some order, with $A \ne 1$. Find the maximum possible value of $\frac{\log_A B}{C +D}$. Here, $\log_A B$ is the unique real number $X$ such that $A^X = B$. [b]p3. [/b]There are six points in a plane, no four of which are collinear. A line is formed connecting every pair of points. Find the smallest possible number of distinct lines formed. [b]p4.[/b] Let $a,b,c$ be real numbers which satisfy $$\frac{2017}{a}= a(b +c), \frac{2017}{b}= b(a +c), \frac{2017}{c}= c(a +b).$$ Find the sum of all possible values of $abc$. [b]p5.[/b] Let $a$ and $b$ be complex numbers such that $ab + a +b = (a +b +1)(a +b +3)$. Find all possible values of $\frac{a+1}{b+1}$. [b]p6.[/b] Let $\vartriangle ABC$ be a triangle. Let $X,Y,Z$ be points on lines $BC$, $CA$, and $AB$, respectively, such that $X$ lies on segment $BC$, $B$ lies on segment $AY$ , and $C$ lies on segment $AZ$. Suppose that the circumcircle of $\vartriangle XYZ$ is tangent to lines $AB$, $BC$, and $CA$ with center $I_A$. If $AB = 20$ and $I_AC = AC = 17$ then compute the length of segment $BC$. [b]p7. [/b]An ant makes $4034$ moves on a coordinate plane, beginning at the point $(0, 0)$ and ending at $(2017, 2017)$. Each move consists of moving one unit in a direction parallel to one of the axes. Suppose that the ant stays within the region $|x - y| \le 2$. Let N be the number of paths the ant can take. Find the remainder when $N$ is divided by $1000$. [b]p8.[/b] A $10$ digit positive integer $\overline{a_9a_8a_7...a_1a_0}$ with $a_9$ nonzero is called [i]deceptive [/i] if there exist distinct indices $i > j$ such that $\overline{a_i a_j} = 37$. Find the number of deceptive positive integers. [b]p9.[/b] A circle passing through the points $(2, 0)$ and $(1, 7)$ is tangent to the $y$-axis at $(0, r )$. Find all possible values of $ r$. [b]p10.[/b] An ellipse with major and minor axes $20$ and $17$, respectively, is inscribed in a square whose diagonals coincide with the axes of the ellipse. Find the area of the square. PS. You had better use hide for answers.

Eight points are chosen on the circumference of a circle, labelled $P_1$, $P_2$, ..., $P_8$ in clockwise order. A route is a sequence of at least two points $P_{a_1}$, $P_{a_2}$, $...$, $P_{a_n}$ such that if an ant were to visit these points in their given order, starting at $P_{a_1}$ and ending at $P_{a_n}$, by following $n-1$ straight line segments (each connecting each $P_{a_i}$ and $P_{a_{i+1}}$), it would never visit a point twice or cross its own path. Find the number of routes.