Let $k$ be a positive integer. Prove that one can partition the set $\{ 0,1,2,3, \cdots ,2^{k+1}-1 \}$ into two disdinct subsets $\{ x_1,x_2, \cdots, x_{2k} \}$ and $\{ y_1, y_2, \cdots, y_{2k} \}$ such that $\sum_{i=1}^{2^k} x_i^m =\sum_{i=1}^{2^k} y_i^m$ for all $m \in \{ 1,2, \cdots, k \}$.

[b]p1.[/b] Each box represents $1$ square unit. Find the area of the shaded region. [img]https://cdn.artofproblemsolving.com/attachments/0/0/f8f8ad6d771f3bbbc59b374a309017cecdce5a.png[/img] [b]p2.[/b] Evaluate $(3^3)\sqrt{5^2-2^4} -5 \cdot 9$. [b]p3.[/b] Find the last two digits of $21^3$. [b]p4.[/b] Let $L$, $M$, and $T$ be distinct prime numbers. Find the least possible odd value of$ L+M +T$ . [b]p5.[/b]Two circles have areas that sum to $20\pi$ and diameters that sum to $12$. Find the radius of the smaller circle. [b]p6.[/b] Zach and Evin each independently choose a date in the year $2022$, uniformly and randomly. The probability that at least one of the chosen dates is December $17$, $2022$ can be expressed as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $A$. [b]p7.[/b] Let $L$ be a list of $2023$ real numbers with medianm. When any two numbers are removed from $L$, its median is still $m$. Find the greatest possible number of distinct values in $L$. [b]p8.[/b] Some children and adults are eating a delicious pile of sand. Children comprise $20\%$ of the group and combined, they consume $80\%$ of the sand. Given that on average, each child consumes $N$ pounds of sand and on average, each adult consumes $M$ pounds of sand, find $\frac{N}{M}$. [b]p9.[/b] An integer $N$ is chosen uniformly and randomly from the set of positive integers less than $100$. The expectedm number of digits in the base-$10$-representation of $N$ can be expressed as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A+B$. [b]p10.[/b] Dunan is taking a calculus course in which the final exam counts for $15\%$ of the total grade. Dunan wishes to have an $A$ in the course, which is defined as a grade of $93\%$ or above. When counting everything but the final exam, he currently has a $92\%$ in the course. What is the minimum integer grade Dunan must get on the final exam in order to get an $A$ in the course? [b]p11.[/b] Norbert, Eorbert, Sorbert, andWorbert start at the origin of the Cartesian Plane and walk in the positive $y$, positive $x$, negative $y$, and negative $x$ directions respectively at speeds of $1$, $2$, $3$, and $4$ units per second respectively. After how many seconds will the quadrilateral with a vertex at each person’s location have area $300$? [b]p12.[/b] Find the sum of the unique prime factors of $1020201$. [b]p13.[/b] HacoobaMatata rewrites the base-$10$ integers from $0$ to $30$ inclusive in base $3$. How many times does he write the digit $1$? [b]p14.[/b] The fractional part of $x$ is $\frac17$. The greatest possible fractional part of $x^2$ can be written as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A+B$. [b]p15.[/b] For howmany integers $x$ is $-2x^2 +8 \ge x^2 -3x +2$? [b]p16.[/b] In the figure below, circle $\omega$ is inscribed in square $EFGH$, which is inscribed in unit square $ABCD$ such that $\overline{EB} = 2\overline{AE}$. If the minimum distance from a point on $\omega$ to $ABCD$ can be written as $\frac{P-\sqrt{Q}}{R}$ with $Q$ square-free, find $10000P +100Q +R$. [img]https://cdn.artofproblemsolving.com/attachments/a/1/c6e5400bc508ab14f34987c9f5f4039daaa4d6.png[/img] [b]p17.[/b] There are two base number systems in use in the LHS Math Team. One member writes “$13$ people usemy base, while $23$ people use the other, base $12$.” Another member writes “out of the $34$ people in the club, $10$ use both bases while $9$ use neither.” Find the sum of all possible numbers ofMath Team members, as a regular decimal number. [b]p18.[/b] Sam is taking a test with $100$ problems. On this test the questions gradually get harder in such a way that for question $i$ , Sam has a $\frac{(101-i)^2}{ 100} \%$ chance to get the question correct. Suppose the expected number of questions Sam gets correct can be written as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A+B$. [b]p19.[/b] In an ordered $25$-tuple, each component is an integer chosen uniformly and randomly from $\{1,2,3,4,5\}$. Ephram and Zach both copy this tuple into a $5\times 5$ grid, both starting from the top-left corner. Ephram writes five components from left to right to fill one row before continuing down to the next row. Zach writes five components from top to bottom to fill one column before continuing right to the next column. Find the expected number of spaces on their grids where Zach and Ephram have the same integer written. [b]p20.[/b] In $\vartriangle ABC$ with circumcenter $O$ and circumradius $8$, $BC = 10$. Let $r$ be the radius of the circle that passes through $O$ and is tangent to $BC$ at $C$. The value of $r^2$ can be written as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $1000m+n$. [b]p21.[/b] Find the number of integer values of $n$ between $1$ and $100$ inclusive such that the sum of the positive divisors of $2n$ is at least $220\%$ of the sum of the divisors of $n$. [b]p22.[/b] Twenty urns containing one ball each are arranged in a circle. Ernie then moves each ball either $1$, $2$ or $3$ urns clockwise, chosen independently, uniformly, and randomly. The expected number of empty urns after this process is complete can be expressed as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A+B$. [b]p23.[/b] Hannah the cat begins at $0$ on a number line. Every second, Hannah jumps $1$ unit in the positive or negative direction, chosen uniformly at random. After $7$ seconds,Hannah‘s expected distance from $0$, in units, can be expressed as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A+B$. [b]p24.[/b] Find the product of all primes $p < 30$ for which there exists an integer $n$ such that $p$ divides $n +(n +1)^{-1}\,\, (mod \,\,p)$. [b]p25.[/b] In quadrilateral $ABCD$, $\angle ABD = \angle CBD = \angle C AD$, $AB = 9$, $BC = 6$, and $AC = 10$. The area of $ABCD$ can be expressed as $\frac{P\sqrt{Q}}{R}$ with $Q$ squarefree and $P$ and $R$ relatively prime. Find $10000P +100Q +R$. [img]https://cdn.artofproblemsolving.com/attachments/4/8/28569605b262c8f26e685e27f5f261c70a396c.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $ABC$ be an acute-angled triangle with $\angle ACB = 60^o$ , and its heights $AD$ and $BE$ intersect at point $H$. Prove that the circumcenter of triangle $ABC$ lies on a line bisecting the angles $AHE$ and $BHD$.

Some bugs are sitting on squares of $10\times 10$ board. Each bug has a direction associated with it [b](up, down, left, right)[/b]. After 1 second, the bugs jump one square in [b]their associated [/b]direction. When the bug reaches the edge of the board, the associated direction reverses (up becomes down, left becomes right, down becomes up, and right becomes left) and the bug moves in that direction. It is observed that it is [b]never[/b] the case that two bugs are on same square. What is the maximum number of bugs possible on the board?

[u]Round 4[/u] [b]p13.[/b] What is the units digit of the number $(2^1 + 1)(2^2 - 1)(2^3 + 1)(2^4 - 1)...(2^{2010} - 1)$? [b]p14.[/b] Mr. Fat noted that on January $2$, $2010$, the display of the day is $01/02/2010$, and the sequence $01022010$ is a palindrome (a number that reads the same forwards and backwards). How many days does Mr. Fat need to wait between this palindrome day and the last palindrome day of this decade? [b]p15.[/b] Farmer Tim has a $30$-meter by $30$-meter by $30\sqrt2$-meter triangular barn. He ties his goat to the corner where the two shorter sides meet with a 60-meter rope. What is the area, in square meters, of the land where the goat can graze, given that it cannot get inside the barn? [b]p16.[/b] In triangle $ABC$, $AB = 3$, $BC = 4$, and $CA = 5$. Point $P$ lies inside the triangle and the distances from $P$ to two of the sides of the triangle are $ 1$ and $2$. What is the maximum distance from $P$ to the third side of the triangle? [u]Round 5[/u] [b]p17.[/b] Let $Z$ be the answer to the third question on this guts quadruplet. If $x^2 - 2x = Z - 1$, find the positive value of $x$. [b]p18.[/b] Let $X$ be the answer to the first question on this guts quadruplet. To make a FATRON2012, a cubical steel body as large as possible is cut out from a solid sphere of diameter $X$. A TAFTRON2013 is created by cutting a FATRON2012 into $27$ identical cubes, with no material wasted. What is the length of one edge of a TAFTRON2013? [b]p19.[/b] Let $Y$ be the smallest integer greater than the answer to the second question on this guts quadruplet. Fred posts two distinguishable sheets on the wall. Then, $Y$ people walk into the room. Each of the Y people signs up on $0, 1$, or $2$ of the sheets. Given that there are at least two people in the room other than Fred, how many possible pairs of lists can Fred have? [b]p20.[/b] Let $A, B, C$, be the respective answers to the first, second, and third questions on this guts quadruplet. At the Robot Design Convention and Showcase, a series of robots are programmed such that each robot shakes hands exactly once with every other robot of the same height. If the heights of the $16$ robots are $4$, $4$, $4$, $5$, $5$, $7$, $17$, $17$, $17$, $34$, $34$, $42$, $100$, $A$, $B$, and $C$ feet, how many handshakes will take place? [u]Round 6[/u] [b]p21.[/b] Determine the number of ordered triples $(p, q, r)$ of primes with $1 < p < q < r < 100$ such that $q - p = r - q$. [b]p22.[/b] For numbers $a, b, c, d$ such that $0 \le a, b, c, d \le 10$, find the minimum value of $ab + bc + cd + da - 5a - 5b - 5c - 5d$. [b]p23.[/b] Daniel has a task to measure $1$ gram, $2$ grams, $3$ grams, $4$ grams , ... , all the way up to $n$ grams. He goes into a store and buys a scale and six weights of his choosing (so that he knows the value for each weight that he buys). If he can place the weights on either side of the scale, what is the maximum value of $n$? [b]p24.[/b] Given a Rubik’s cube, what is the probability that at least one face will remain unchanged after a random sequence of three moves? (A Rubik’s cube is a $3$ by $3$ by $3$ cube with each face starting as a different color. The faces ($3$ by $3$) can be freely turned. A move is defined in this problem as a $90$ degree rotation of one face either clockwise or counter-clockwise. The center square on each face–six in total–is fixed.) PS. You should use hide for answers. First rounds have been posted [url=https://artofproblemsolving.com/community/c4h2766534p24230616]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose that the positive numbers $a_1, a_2,.. , a_n$ form an arithmetic progression; hence $a_{k+1}- a_k = d,$ for $k = 1, 2,... , n - 1.$ Prove that \[\frac{1}{a_1a_2}+\frac{1}{a_2a_3}+...+\frac{1}{a_{n-1}a_n}=\frac{n-1}{a_1a_n}.\]

A student steps onto a stationary elevator and stands on a bathroom scale. The elevator then travels from the top of the building to the bottom. The student records the reading on the scale as a function of time. How tall is the building? $\textbf{(A) } 50 \text{ m}\\ \textbf{(B) } 80 \text{ m}\\ \textbf{(C) } 100 \text{ m}\\ \textbf{(D) } 150 \text{ m}\\ \textbf{(E) } 400 \text{ m}$

$a_{1}=1$ and for all $n \geq 1$, \[ (a_{n+1}-2a_{n})\cdot \left (a_{n+1} - \dfrac{1}{a_{n}+2} \right )=0.\] If $a_{k}=1$, which of the following can be equal to $k$? $ \textbf{(A)}\ 6 \qquad\textbf{(B)}\ 8 \qquad\textbf{(C)}\ 10 \qquad\textbf{(D)}\ 12 \qquad\textbf{(E)}\ \text{None of the preceding} $

Write $\displaystyle{\frac{1}{\sqrt[5]{2} - 1} = a + b\sqrt[5]{2} + c\sqrt[5]{4} + d\sqrt[5]{8} + e\sqrt[5]{16}}$, with $a$, $b$, $c$, $d$, and $e$ integers. Find $a^2 + b^2 + c^2 + d^2 + e^2$.

Alberto wants to organize a poker game with his friends this evening. Bruno and Barbara together go to gym once in three evenings, whereas Carla, Corrado, Dario and Davide are busy once in two evenings (not necessarily the same day). Moreover, Dario is not willing to play with Davide, since they have a quarrel over a girl. A poker game requires at least four persons (including Alberto). What is the probability that the game will be played?

Does the set of real numbers have a well-order $\prec$ such that the intersection of the subset $\{(x,y) : x\prec y\}$ of the plane with every line is Lebesgue measurable on the line?

Pyramid $EARLY$ is placed in $(x,y,z)$ coordinates so that $E=(10,10,0),A=(10,-10,0)$, $R=(-10,-10,0)$, $L=(-10,10,0)$, and $Y=(0,0,10)$. Tunnels are drilled through the pyramid in such a way that one can move from $(x,y,z)$ to any of the $9$ points $(x,y,z-1)$, $(x\pm 1,y,z-1)$, $(x,y\pm 1, z-1)$, $(x\pm 1, y\pm 1, z-1)$. Sean starts at $Y$ and moves randomly down to the base of the pyramid, choosing each of the possible paths with probability $\dfrac{1}{9}$. What is the probability that he ends up at the point $(8,9,0)$?

Bob, having little else to do, rolls a fair $6$-sided die until the sum of his rolls is greater than or equal to $700$. What is the expected number of rolls needed? Any answer within $.0001$ of the correct answer will be accepted.

Fix an integer $n \ge 2$ and let $A$ be an $n\times n$ array with $n$ cells cut out so that exactly one cell is removed out of every row and every column. A [i]stick [/i] is a $1\times k$ or $k\times 1$ subarray of $A$, where $k$ is a suitable positive integer. (a) Determine the minimal number of [i]sticks [/i] $A$ can be dissected into. (b) Show that the number of ways to dissect $A$ into a minimal number of [i]sticks [/i] does not exceed $100^n$. proposed by Palmer Mebane and Nikolai Beluhov [hide=a few comments]a variation of part a, was [url=https://artofproblemsolving.com/community/c6h1389637p7743073]problem 5[/url] a variation of part b, was posted [url=https://artofproblemsolving.com/community/c6h1389663p7743264]here[/url] this post was made in order to complete the post collection of RMM Shortlist 2017[/hide]

Determine that all $ k \in \mathbb{Z}$ such that $ \forall n$ the numbers $ 4n\plus{}1$ and $ kn\plus{}1$ have no common divisor.

A weighted complete graph with distinct positive wights is given such that in every triangle is [i]degenerate [/i] that is wight of an edge is equal to sum of two other. Prove that one can assign values to the vertexes of this graph such that the wight of each edge is the difference between two assigned values of the endpoints. [i]Proposed by Morteza Saghafian [/i]

Let $ABC$ be a triangle, and let $D$, $E$, $F$ be 3 points on the sides $BC$, $CA$ and $AB$ respectively, such that the inradii of the triangles $AEF$, $BDF$ and $CDE$ are equal with half of the inradius of the triangle $ABC$. Prove that $D$, $E$, $F$ are the midpoints of the sides of the triangle $ABC$.

A cube of integral dimensions is given in space so that all four vertices of one of the faces are lattice points. Prove that the other four vertices are also lattice points.

[b]H[/b]orizontal parallel segments $AB=10$ and $CD=15$ are the bases of trapezoid $ABCD$. Circle $\gamma$ of radius $6$ has center within the trapezoid and is tangent to sides $AB$, $BC$, and $DA$. If side $CD$ cuts out an arc of $\gamma$ measuring $120^{\circ}$, find the area of $ABCD$.

Find all polynomials P(x) such that P(x)+P(1/x)=x+1/x

Let $ p$ and $ q$ be relatively prime positive integers. A subset $ S$ of $ \{0, 1, 2, \ldots \}$ is called [b]ideal[/b] if $ 0 \in S$ and for each element $ n \in S,$ the integers $ n \plus{} p$ and $ n \plus{} q$ belong to $ S.$ Determine the number of ideal subsets of $ \{0, 1, 2, \ldots \}.$

Guy has 17 cards. Each of them has an integer written on it (the numbers are not necessarily positive, and not necessarily different from each other). Guy noticed that for each card, the square of the number written on it equals the sum of the numbers on the 16 other cards. What are the numbers on Guy's cards? Find all of the options.

Given two positive integers $m$ and $n$, find the largest $k$ in terms of $m$ and $n$ such that the following condition holds: Any tree graph $G$ with $k$ vertices has two (possibly equal) vertices $u$ and $v$ such that for any other vertex $w$ in $G$, either there is a path of length at most $m$ from $u$ to $w$, or there is a path of length at most $n$ from $v$ to $w$. [i]Proposed by Ivan Chan Kai Chin[/i]

Prove that every integer $k > 1$ has a multiple less than $k^4$ whose decimal expension has at most four distinct digits.

[b]2.[/b] Construct a sequence $(a_n)_{n=1}^{\infty}$ of complex numbers such that, for every $l>0$, the series $\sum_{n=1}^{\infty} \mid a_n \mid ^{l}$ be divergent, but for almost all $\theta$ in $(0,2\pi)$, $\prod_{n=1}^{\infty} (1+a_n e^{i\theta})$ be convergent. [b](S. 11)[/b]