The set $\{1, 2, 3, 4\}$ can be partitioned into two subsets $A = \{1, 4\}$ and $B = \{3, 2\}$ with no common elements and such that the sum of the elements of $A$ is equal to the sum of the elements of B. Such a partition is impossible for the set $\{1, 2, 3, 4, 5\}$ and also for the set $\{1, 2, 3, 4, 5, 6\}$. Determine all values of $n$ for which the set of the first $n$ natural numbers can be partitioned into two subsets with no common elements such that the sum of the elements of each subset is the same.

Can the cells of a $2002 \times 2002$ table be filled with the numbers from $1$ to $2002^2$ (one per cell) so that for any cell we can find three numbers $a, b, c$ in the same row or column (or the cell itself) with $a = bc$?

Juty and Azgor plays the following game on a \((2n+1) \times (2n+1)\) board with Juty moving first. Initially all cells are colored white. On Juty's turn, she colors a white cell green and on Azgor's turn, he colors a white cell red. The game ends after they color all the cells of the board. Juty wins if all the green cells are connected, i.e. given any two green cells, there is at least one chain of neighbouring green cells connecting them (we call two cells [i]neighboring[/i] if they share at least one corner), otherwise Azgor wins. Determine which player has a winning strategy. [i]Proposed by Atonu Roy Chowdhury[/i]

If $A=(a_1,\cdots,a_n)$ , $B=(b_1,\cdots,b_n)$ be $2$ $n-$tuple that $a_i,b_i=0 \ or \ 1$ for $i=1,2,\cdots,n$, we define $f(A,B)$ the number of $1\leq i\leq n$ that $a_i\ne b_i$. For instance, if $A=(0,1,1)$ , $B=(1,1,0)$, then $f(A,B)=2$. Now, let $A=(a_1,\cdots,a_n)$ , $B=(b_1,\cdots,b_n)$ , $C=(c_1,\cdots,c_n)$ be 3 $n-$tuple, such that for $i=1,2,\cdots,n$, $a_i,b_i,c_i=0 \ or \ 1$ and $f(A,B)=f(A,C)=f(B,C)=d$. $a)$ Prove that $d$ is even. $b)$ Prove that there exists a $n-$tuple $D=(d_1,\cdots,d_n)$ that $d_i=0 \ or \ 1$ for $i=1,2,\cdots,n$, such that $f(A,D)=f(B,D)=f(C,D)=\frac{d}{2}$.

Each day, the price of the shares of the corporation “Soap Bubble, Limited” either increases or decreases by $n$ percent, where $n$ is an integer such that $0 < n < 100$. The price is calculated with unlimited precision. Does there exist an $n$ for which the price can take the same value twice?

In the Cartesian plane is given a polygon $P$ whose vertices have integer coordinates and with sides parallel to the coordinate axes. Show that if the length of each edge of $P$ is an odd integer, then the surface of P cannot be partitioned into $2\times 1$ rectangles.

[b]p1.[/b] Suppose $a_1 \cdot 2 = a_2 \cdot 3 = a_3$ and $a_1 + a_2 + a_3 = 66$. What is $a_3$? [b]p2.[/b] Ankit buys a see-through plastic cylindrical water bottle. However, in coming home, he accidentally hits the bottle against a wall and dents the top portion of the bottle (above the $7$ cm mark). Ankit now wants to determine the volume of the bottle. The area of the base of the bottle is $20$ cm$^2$ . He fills the bottle with water up to the $5$ cm mark. After flipping the bottle upside down, he notices that the height of the empty space is at the $7$ cm mark. Find the total volume (in cm$^3$) of this bottle. [img]https://cdn.artofproblemsolving.com/attachments/1/9/f5735c77b056aaf31b337ea1b777a591807819.png[/img] [b]p3.[/b] If $P$ is a quadratic polynomial with leading coefficient $ 1$ such that $P(1) = 1$, $P(2) = 2$, what is $P(10)$? [b]p4.[/b] Let ABC be a triangle with $AB = 1$, $AC = 3$, and $BC = 3$. Let $D$ be a point on $BC$ such that $BD =\frac13$ . What is the ratio of the area of $BAD$ to the area of $CAD$? [b]p5.[/b] A coin is flipped $ 12$ times. What is the probability that the total number of heads equals the total number of tails? Express your answer as a common fraction in lowest terms. [b]p6.[/b] Moor pours $3$ ounces of ginger ale and $ 1$ ounce of lime juice in cup $A$, $3$ ounces of lime juice and $ 1$ ounce of ginger ale in cup $B$, and mixes each cup well. Then he pours $ 1$ ounce of cup $A$ into cup $B$, mixes it well, and pours $ 1$ ounce of cup $B$ into cup $A$. What proportion of cup $A$ is now ginger ale? Express your answer as a common fraction in lowest terms. [b]p7.[/b] Determine the maximum possible area of a right triangle with hypotenuse $7$. Express your answer as a common fraction in lowest terms. [b]p8.[/b] Debbie has six Pusheens: $2$ pink ones, $2$ gray ones, and $2$ blue ones, where Pusheens of the same color are indistinguishable. She sells two Pusheens each to Alice, Bob, and Eve. How many ways are there for her to do so? [b]p9.[/b] How many nonnegative integer pairs $(a, b)$ are there that satisfy $ab = 90 - a - b$? [b]p10.[/b] What is the smallest positive integer $a_1...a_n$ (where $a_1, ... , a_n$ are its digits) such that $9 \cdot a_1 ... a_n = a_n ... a_1$, where $a_1$, $a_n \ne 0$? [b]p11.[/b] Justin is growing three types of Japanese vegetables: wasabi root, daikon and matsutake mushrooms. Wasabi root needs $2$ square meters of land and $4$ gallons of spring water to grow, matsutake mushrooms need $3$ square meters of land and $3$ gallons of spring water, and daikon need $ 1$ square meter of land and $ 1$ gallon of spring water to grow. Wasabi sell for $60$ per root, matsutake mushrooms sell for $60$ per mushroom, and daikon sell for $2$ per root. If Justin has $500$ gallons of spring water and $400$ square meters of land, what is the maximum amount of money, in dollars, he can make? [b]p12.[/b] A [i]prim [/i] number is a number that is prime if its last digit is removed. A [i]rime [/i] number is a number that is prime if its first digit is removed. Determine how many numbers between $100$ and $999$ inclusive are both prim and rime numbers. [b]p13.[/b] Consider a cube. Each corner is the intersection of three edges; slice off each of these corners through the midpoints of the edges, obtaining the shape below. If we start with a $2\times 2\times 2$ cube, what is the volume of the resulting solid? [img]https://cdn.artofproblemsolving.com/attachments/4/8/856814bf99e6f28844514158344477f6435a3a.png[/img] [b]p14.[/b] If a parallelogram with perimeter $14$ and area $ 12$ is inscribed in a circle, what is the radius of the circle? [b]p15.[/b] Take a square $ABCD$ of side length $1$, and draw $\overline{AC}$. Point $E$ lies on $\overline{BC}$ such that $\overline{AE}$ bisects $\angle BAC$. What is the length of $BE$? [b]p16.[/b] How many integer solutions does $f(x) = (x^2 + 1)(x^2 + 2) + (x^2 + 3)(x + 4) = 2017$ have? [b]p17.[/b] Alice, Bob, Carol, and Dave stand in a circle. Simultaneously, each player selects another player at random and points at that person, who must then sit down. What is the probability that Alice is the only person who remains standing? [b]p18.[/b] Let $x$ be a positive integer with a remainder of $2$ when divided by $3$, $3$ when divided by $4$, $4$ when divided by $5$, and $5$ when divided by $6$. What is the smallest possible such $x$? [b]p19[/b]. A circle is inscribed in an isosceles trapezoid such that all four sides of the trapezoid are tangent to the circle. If the radius of the circle is $ 1$, and the upper base of the trapezoid is $ 1$, what is the area of the trapezoid? [b]p20.[/b] Ray is blindfolded and standing $ 1$ step away from an ice cream stand. Every second, he has a $1/4$ probability of walking $ 1$ step towards the ice cream stand, and a $3/4$ probability of walking $ 1$ step away from the ice cream stand. When he is $0$ steps away from the ice cream stand, he wins. What is the probability that Ray eventually wins? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are $n^2$ empty boxes, each with a square base. The height and width of each box are integers between $1$ and $n$ inclusive, and no two boxes are identical. One box [i]fits inside[/i] another if its height and width are both smaller, and additionally, one of its dimensions is at least $2$ units smaller. In this way, we can form sequences of boxes (the first inside the second, the second inside the third, and so on). We place each of these sequences on a different shelf. How many shelves are needed to store all the boxes, with certainty?

Among a group of programmers, every two either know each other or do not know each other. Eleven of them are geniuses. Two companies hire them one at a time, alternately, and may not hire someone already hired by the other company. There are no conditions on which programmer a company may hire in the first round. Thereafter, a company may only hire a programmer who knows another programmer already hired by that company. Is it possible for the company which hires second to hire ten of the geniuses, no matter what the hiring strategy of the other company may be?

On a circle are given the points $A_1, B_1, A_2, B_2, \cdots, A_9, B_9$ in this order. All the segments $A_iB_j (i, j=1, 2, \cdots, 9$ must be colored in one of $k$ colors, so that no two segments from the same color intersect (inside the circle) and for every $i$ there is a color, such that no segments with an end $A_i$, nor $B_i$ is colored such. What is the least possible $k$?

In a school there are $n$ classes and $k$ student. We know that in this school every two students have attended exactly in one common class. Also due to smallness of school each class has less than $k$ students. If $k-1$ is not a perfect square, prove that there exist a student that has attended in at least $\sqrt k$ classes. [i]Proposed by Mohammad Moshtaghi Far, Kian Shamsaie[/i] [b]Rated 4[/b]

How many 3-digit numbers have the property that the sum of their digits is even?

You have a list of $2023$ numbers, where each one can be $-1$, $0$, $1$ or $2$. The sum of all numbers is $19$ and the sum of their squares is $99$. What are the minimum and maximum values of the sum of the cubes of those $2023$ numbers?

Cucumber river in the Flower city has parallel banks with the distance between them $1$ metre. It has some islands with the total perimeter $8$ metres. Mr. Know-All claims that it is possible to cross the river in a boat from the arbitrary point, and the trajectory will not exceed $3$ metres. Is he right?

What is the greatest amount of rooks that can be placed on an $n\times n$ board, such that each rooks beats an even number of rooks? A rook is considered to beat another rook, if they lie on one vertical or one horizontal line and no rooks are between them. [I]Proposed by D. Karpov[/i]

A set $A$ of squares is given on a chessboard which is infinite in all directions. On each square of this chessboard which does not belong to $A$ there is a king. On a command all kings may be moved in such a way that each king either remains on its square or is moved to an adjacent square, which may have been occupied by another king before the command. Each square may be occupied by at most one king. Does there exist such a number $k$ and such a way of moving the kings that after $k$ moves the kings will occupy all squares of the chessboard? Consider the following cases: (a) $A$ is the set of all squares, both of whose coordinates are multiples of $100$. (There is a horizontal line numbered by the integers from $-\infty$ to $+\infty$, and a similar vertical line. Each square of the chessboard may be denoted by two numbers, its coordinates with respect to these axes.) (b) $A$ is the set of all squares which are covered by $100$ fixed arbitrary queens (i.e. each square covered by at least one queen). Remark: If $A$ consists of just one square, then $k = 1$ and the required way is the following: all kings to the left of the square of $A$ make one move to the right.

[u]Set 1[/u] [b]G1.[/b] The Daily Challenge office has a machine that outputs the number $2.75$ when operated. If it is operated $12$ times, then what is the sum of all $12$ of the machine outputs? [b]G2.[/b] A car traveling at a constant velocity $v$ takes $30$ minutes to travel a distance of $d$. How long does it take, in minutes, for it travel $10d$ with a constant velocity of $2.5v$? [b]G3.[/b] Andy originally has $3$ times as many jelly beans as Andrew. After Andrew steals 15 of Andy’s jelly beans, Andy now only has $2$ times as many jelly beans as Andrew. Find the number of jelly beans Andy originally had. [u]Set 2[/u] [b]G4.[/b] A coin is weighted so that it is $3$ times more likely to come up as heads than tails. How many times more likely is it for the coin to come up heads twice consecutively than tails twice consecutively? [b]G5.[/b] There are $n$ students in an Areteem class. When 1 student is absent, the students can be evenly divided into groups of $5$. When $8$ students are absent, the students can evenly be divided into groups of $7$. Find the minimum possible value of $n$. [b]G6.[/b] Trapezoid $ABCD$ has $AB \parallel CD$ such that $AB = 5$, $BC = 4$ and $DA = 2$. If there exists a point $M$ on $CD$ such that $AM = AD$ and $BM = BC$, find $CD$. [u]Set 3[/u] [b]G7.[/b] Angeline has $10$ coins (either pennies, nickels, or dimes) in her pocket. She has twice as many nickels as pennies. If she has $62$ cents in total, then how many dimes does she have? [b]G8.[/b] Equilateral triangle $ABC$ has side length $6$. There exists point $D$ on side $BC$ such that the area of $ABD$ is twice the area of $ACD$. There also exists point $E$ on segment $AD$ such that the area of $ABE$ is twice the area of $BDE$. If $k$ is the area of triangle $ACE$, then find $k^2$. [b]G9.[/b] A number $n$ can be represented in base $ 6$ as $\underline{aba}_6$ and base $15$ as $\underline{ba}_{15}$, where $a$ and $b$ are not necessarily distinct digits. Find $n$. PS. You should use hide for answers. Sets 4-6 have been posted [url=https://artofproblemsolving.com/community/c3h3131305p28367080]here[/url] and 7-9 [url=https://artofproblemsolving.com/community/c3h3131308p28367095]here[/url].Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Alice starts with an empty string and randomly appends one of the digits $2$, $0$, $1$, or $8$ until the string ends with $2018$. What is the probability Alice appends less than $9$ digits before stopping?

The beaver is chess piece that move to $2$ cells by horizontal or vertical. Every cell of $100 \times 100$ chessboard colored in some color,such that we can not get from one cell to another with same color with one move of beaver or knight. What minimal color do we need?

Let $x_1,x_2,\ldots,x_n$ be real numbers satisfying $x_1^2+x_2^2+\ldots+x_n^2=1$. Prove that for every integer $k\ge2$ there are integers $a_1,a_2,\ldots,a_n$, not all zero, such that $|a_i|\le k-1$ for all $i$, and $|a_1x_1+a_2x_2+\ldots+a_nx_n|\le{(k-1)\sqrt n\over k^n-1}$.

Two people write a $2k$-digit number, using only the numbers $1, 2, 3, 4$ and $5$. The first number on the left is written by the first of them, the second - the second, the third - the first, etc. Can the second one achieve this so that the resulting number is divisible by $9$, if the first seeks to interfere with it? Consider the cases $k = 10$ and $k = 15$.

A book contains $30$ stories. Each story has a different number of pages under $31$. The first story starts on page $1$ and each story starts on a new page. What is the largest possible number of stories that can begin on odd page numbers?

We are given two point sets $A$ and $B$ which are both composed of finite disjoint arcs on the unit circle. Moreover, the length of each arc in $B$ is equal to $\dfrac{\pi}{m}$ ($m \in \mathbb{N}$). We denote by $A^j$ the set obtained by a counterclockwise rotation of $A$ about the center of the unit circle for $\dfrac{j\pi}{m}$ ($j=1,2,3,\dots$). Show that there exists a natural number $k$ such that $l(A^k\cap B)\ge \dfrac{1}{2\pi}l(A)l(B)$.(Here $l(X)$ denotes the sum of lengths of all disjoint arcs in the point set $X$)

We consider the ways to divide a $1$ by $1$ square into rectangles (of which the sides are parallel to those of the square). All rectangles must have the same circumference, but not necessarily the same shape. a) Is it possible to divide the square into 20 rectangles, each having a circumference of $2:5$? b) Is it possible to divide the square into 30 rectangles, each having a circumference of $2$?

The numbers $2,4,\ldots,2^{100}$ are written on a board. At a move, one may erase the numbers $a,b$ from the board and replace them with $ab/(a+b).$ Prove that the last numer on the board will be greater than 1. [i]From the folklore[/i]