The square $ABCD$ is divided into $n^2$ equal small (elementary) squares by parallel lines to its sides, (see the figure for the case $n = 4$). A spider starts from point$ A$ and moving only to the right and up tries to arrive at point $C$. Every ” movement” of the spider consists of: ”$k$ steps to the right and $m$ steps up” or ”$m$ steps to the right and $k$ steps up” (which can be performed in any way). The spider first makes $l$ ”movements” and in then, moves to the right or up without any restriction. If $n = m \cdot l$, find all possible ways the spider can approach the point $C$, where $n, m, k, l$ are positive integers with $k < m$. [img]https://cdn.artofproblemsolving.com/attachments/2/d/4fb71086beb844ca7c492a30c7d333fa08d381.png[/img]

Let $X=\{1,2,3,...,10\}$. Find the number of pairs of $\{A,B\}$ such that $A\subseteq X, B\subseteq X, A\ne B$ and $A\cap B=\{2,3,5,7\}$.

[b]p1.[/b] What is the smallest positive integer divisible by $20$, $12$, and $13$? [b]p2.[/b] Two circles of radius $5$ are placed in the plane such that their centers are $7$ units apart. What is the largest possible distance between a point on one circle and a point on the other? [b]p3.[/b] In a magic square, all the numbers in the rows, columns, and diagonals sum to the same value. How many $2\times 2$ magic squares containing the integers $\{1, 2, 3, 4\}$ are there? [b]p4.[/b] Ethan's sock drawer contains two pairs of white socks and one pair of red socks. Ethan picks two socks at random. What is the probability that he picks two white socks? [b]p5.[/b] The sum of the time on a digital clock is the sum of the digits displayed on the screen. For example, the sum of the time at $10:23$ would be $6$. Assuming the clock is a $12$ hour clock, what is the greatest possible positive difference between the sum of the time at some time and the sum of the time one minute later? [b]p6.[/b] Given the expression $1 \div 2 \div 3 \div 4$, what is the largest possible resulting value if one were to place parentheses $()$ somewhere in the expression? [b]p7.[/b] At a convention, there are many astronomers, astrophysicists, and cosmologists. At $first$, all the astronomers and astrophysicists arrive. At this point, $\frac35$ of the people in the room are astronomers. Then, all the cosmologists come, so now, $30\%$ of the people in the room are astrophysicists. What fraction of the scientists are cosmologists? [b]p8.[/b] At $10:00$ AM, a minuteman starts walking down a $1200$-step stationary escalator at $40$ steps per minute. Halfway down, the escalator starts moving up at a constant speed, while the minuteman continues to walk in the same direction and at the same pace that he was going before. At $10:55$ AM, the minuteman arrives back at the top. At what speed is the escalator going up, in steps per minute? [b]p9.[/b] Given that $x_1 = 57$, $x_2 = 68$, and $x_3 = 32$, let $x_n = x_{n-1} -x_{n-2} +x_{n-3}$ for $n \ge 4$. Find $x_{2013}$. [b]p10.[/b] Two squares are put side by side such that one vertex of the larger one coincides with a vertex of the smaller one. The smallest rectangle that contains both squares is drawn. If the area of the rectangle is $60$ and the area of the smaller square is $24$, what is the length of the diagonal of the rectangle? [b]p11.[/b] On a dield trip, $2$ professors, $4$ girls, and $4$ boys are walking to the forest to gather data on butterflies. They must walk in a line with following restrictions: one adult must be the first person in the line and one adult must be the last person in the line, the boys must be in alphabetical order from front to back, and the girls must also be in alphabetical order from front to back. How many such possible lines are there, if each person has a distinct name? [b]p12.[/b] Flatland is the rectangle with vertices $A, B, C$, and $D$, which are located at $(0, 0)$, $(0, 5)$, $(5, 5)$, and $(5, 0)$, respectively. The citizens put an exact map of Flatland on the rectangular region with vertices $(1, 2)$, $(1, 3)$, $(2, 3)$, and $(2, 2)$ in such a way so that the location of $A$ on the map lies on the point $(1, 2)$ of Flatland, the location of $B$ on the map lies on the point $(1, 3)$ of Flatland, the location of C on the map lies on the point $(2, 3)$ of Flatland, and the location of D on the map lies on the point $(2, 2)$ of Flatland. Which point on the coordinate plane is thesame point on the map as where it actually is on Flatland? [b]p13.[/b] $S$ is a collection of integers such that any integer $x$ that is present in $S$ is present exactly $x$ times. Given that all the integers from $1$ through $22$ inclusive are present in $S$ and no others are, what is the average value of the elements in $S$? [b]p14.[/b] In rectangle $PQRS$ with $PQ < QR$, the angle bisector of $\angle SPQ$ intersects $\overline{SQ}$ at point $T$ and $\overline{QR }$ at $U$. If $PT : TU = 3 : 1$, what is the ratio of the area of triangle $PTS$ to the area of rectangle $PQRS$? [b]p15.[/b] For a function $f(x) = Ax^2 + Bx + C$, $f(A) = f(B)$ and $A + 6 = B$. Find all possible values of $B$. [b]p16.[/b] Let $\alpha$ be the sum of the integers relatively prime to $98$ and less than $98$ and $\beta$ be the sum of the integers not relatively prime to $98$ and less than $98$. What is the value of $\frac{\alpha}{\beta}$ ? [b]p17.[/b] What is the value of the series $\frac{1}{3} + \frac{3}{9} + \frac{6}{27} + \frac{10}{81} + \frac{15}{243} + ...$? [b]p18.[/b] A bug starts at $(0, 0)$ and moves along lattice points restricted to $(i, j)$, where $0 \le i, j \le 2$. Given that the bug moves $1$ unit each second, how many different paths can the bug take such that it ends at $(2, 2)$ after $8$ seconds? [b]p19.[/b] Let $f(n)$ be the sum of the digits of $n$. How many different values of $n < 2013$ are there such that $f(f(f(n))) \ne f(f(n))$ and $f(f(f(n))) < 10$? [b]p20.[/b] Let $A$ and $B$ be points such that $\overline{AB} = 14$ and let $\omega_1$ and $\omega_2$ be circles centered at $A$ and $B$ with radii $13$ and $15$, respectively. Let $C$ be a point on $\omega_1$ and $D$ be a point on $\omega_2$ such that $\overline{CD}$ is a common external tangent to $\omega_1$ and $\omega_2$. Let $P$ be the intersection point of the two circles that is closer to $\overline{CD}$. If $M$ is the midpoint of $\overline{CD}$, what is the length of segment $\overline{PM}$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n\ge 3$ be an integer and let $A_{1}, A_{2},\dots, A_{n}$ be $n$ distinct subsets of $S=\{1, 2,\dots, n\}$. Show that there exists $x\in S$ such that the n subsets $A_{i}-\{x\}, i=1,2,\dots n$ are also disjoint. what i have is [hide="this"]we may assume that the union of the $A_{i}$s is $S$. [/hide]

There are two round tables with $n{}$ dwarves sitting at each table. Each dwarf has only two friends: his neighbours to the left and to the right. A good wizard wants to seat the dwarves at one round table so that each two neighbours are friends. His magic allows him to make any $2n$ pairs of dwarves into pairs of friends (the dwarves in a pair may be from the same or from different tables). However, he knows that an evil sorcerer will break $n{}$ of those new friendships. For which $n{}$ is the good wizard able to achieve his goal no matter what the evil sorcerer does? [i]Mikhail Svyatlovskiy[/i]

[b]p21[/b]. If $f = \cos(\sin (x))$. Calculate the sum $\sum^{2021}_{n=0} f'' (n \pi)$. [b]p22.[/b] Find all real values of $A$ that minimize the difference between the local maximum and local minimum of $f(x) = \left(3x^2 - 4\right)\left(x - A + \frac{1}{A}\right)$. [b]p23.[/b] Bessie is playing a game. She labels a square with vertices labeled $A, B, C, D$ in clockwise order. There are $7$ possible moves: she can rotate her square $90$ degrees about the center, $180$ degrees about the center, $270$ degrees about the center; or she can flip across diagonal $AC$, flip across diagonal $BD$, flip the square horizontally (flip the square so that vertices A and B are switched and vertices $C$ and $D$ are switched), or flip the square vertically (vertices $B$ and $C$ are switched, vertices $A$ and $D$ are switched). In how many ways can Bessie arrive back at the original square for the first time in $3$ moves? [b]p24.[/b] A positive integer is called [i]happy [/i] if the sum of its digits equals the two-digit integer formed by its two leftmost digits. Find the number of $5$-digit happy integers. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are seven rods erected at the vertices of a regular heptagonal area. The top of each rod is connected to the top of its second neighbor by a straight piece of wire so that, looking from above, one sees each wire crossing exactly two others. Is it possible to set the respective heights of the rods in such a way that no four tops of the rods are coplanar and each wire passes one of the crossings from above and the other one from below?

A meeting was attended by $n$ people. They are welcome to occupy the $k$ table provided $\left( k \le \frac{n}{2} \right)$. Each table is occupied by at least two people. When the meeting begins, the moderator selects two people from each table as representatives for talk to. Suppose that $A$ is the number of ways to choose representatives to speak. Determine the maximum value of $A$ that is possible.

For $n$ an odd positive integer, the unit squares of an $n\times n$ chessboard are coloured alternately black and white, with the four corners coloured black. A it tromino is an $L$-shape formed by three connected unit squares. For which values of $n$ is it possible to cover all the black squares with non-overlapping trominos? When it is possible, what is the minimum number of trominos needed?

Of the numbers $1, 2,3,..,2006$, ten different ones must be selected. Show that you can pick ten different numbers with a sum greater than $10039$ in more ways than you can select ten different numbers with a sum less than $10030$.

Given a digits {$0,1,2,...,9$} . Find the number of numbers of 6 digits which cantain $7$ or $7$'s digit and they is permulated(For example 137456 and 314756 is one numbers).

[b]p1.[/b] Let $f$ be a function such that $f(x + y) = f(x) + f(y)$ for all $x$ and $y$. Assume $f(5) = 9$. Compute $f(2015)$. [b]p2.[/b] There are six cards, with the numbers $2, 2, 4, 4, 6, 6$ on them. If you pick three cards at random, what is the probability that you can make a triangles whose side lengths are the chosen numbers? [b]p3. [/b]A train travels from Berkeley to San Francisco under a tunnel of length $10$ kilometers, and then returns to Berkeley using a bridge of length $7$ kilometers. If the train travels at $30$ km/hr underwater and 60 km/hr above water, what is the train’s average speed in km/hr on the round trip? [b]p4.[/b] Given a string consisting of the characters A, C, G, U, its reverse complement is the string obtained by first reversing the string and then replacing A’s with U’s, C’s with G’s, G’s with C’s, and U’s with A’s. For example, the reverse complement of UAGCAC is GUGCUA. A string is a palindrome if it’s the same as its reverse. A string is called self-conjugate if it’s the same as its reverse complement. For example, UAGGAU is a palindrome and UAGCUA is self-conjugate. How many six letter strings with just the characters A, C, G (no U’s) are either palindromes or self-conjugate? [b]p5.[/b] A scooter has $2$ wheels, a chair has $6$ wheels, and a spaceship has $11$ wheels. If there are $10$ of these objects, with a total of $50$ wheels, how many chairs are there? [b]p6.[/b] How many proper subsets of $\{1, 2, 3, 4, 5, 6\}$ are there such that the sum of the elements in the subset equal twice a number in the subset? [b]p7.[/b] A circle and square share the same center and area. The circle has radius $1$ and intersects the square on one side at points $A$ and $B$. What is the length of $\overline{AB}$ ? [b]p8. [/b]Inside a circle, chords $AB$ and $CD$ intersect at $P$ in right angles. Given that $AP = 6$, $BP = 12$ and $CD = 15$, find the radius of the circle. [b]p9.[/b] Steven makes nonstandard checkerboards that have $29$ squares on each side. The checkerboards have a black square in every corner and alternate red and black squares along every row and column. How many black squares are there on such a checkerboard? [b]p10.[/b] John is organizing a race around a circular track and wants to put $3$ water stations at $9$ possible spots around the track. He doesn’t want any $2$ water stations to be next to each other because that would be inefficient. How many ways are possible? [b]p11.[/b] In square $ABCD$, point $E$ is chosen such that $CDE$ is an equilateral triangle. Extend $CE$ and $DE$ to $F$ and $G$ on $AB$. Find the ratio of the area of $\vartriangle EFG$ to the area of $\vartriangle CDE$. [b]p12.[/b] Let $S$ be the number of integers from $2$ to $8462$ (inclusive) which does not contain the digit $1,3,5,7,9$. What is $S$? [b]p13.[/b] Let x, y be non zero solutions to $x^2 + xy + y^2 = 0$. Find $\frac{x^{2016} + (xy)^{1008} + y^{2016}}{(x + y)^{2016}}$ . [b]p14.[/b] A chess contest is held among $10$ players in a single round (each of two players will have a match). The winner of each game earns $2$ points while loser earns none, and each of the two players will get $1$ point for a draw. After the contest, none of the $10$ players gets the same score, and the player of the second place gets a score that equals to $4/5$ of the sum of the last $5$ players. What is the score of the second-place player? [b]p15.[/b] Consider the sequence of positive integers generated by the following formula $a_1 = 3$, $a_{n+1} = a_n + a^2_n$ for $n = 2, 3, ...$ What is the tens digit of $a_{1007}$? [b]p16.[/b] Let $(x, y, z)$ be integer solutions to the following system of equations $x^2z + y^2z + 4xy = 48$ $x^2 + y^2 + xyz = 24$ Find $\sum x + y + z$ where the sum runs over all possible $(x, y, z)$. [b]p17.[/b] Given that $x + y = a$ and $xy = b$ and $1 \le a, b \le 50$, what is the sum of all a such that $x^4 + y^4 - 2x^2y^2$ is a prime squared? [b]p18.[/b] In $\vartriangle ABC$, $M$ is the midpoint of $\overline{AB}$, point $N$ is on side $\overline{BC}$. Line segments $\overline{AN}$ and $\overline{CM}$ intersect at $O$. If $AO = 12$, $CO = 6$, and $ON = 4$, what is the length of $OM$? [b]p19.[/b] Consider the following linear system of equations. $1 + a + b + c + d = 1$ $16 + 8a + 4b + 2c + d = 2$ $81 + 27a + 9b + 3c + d = 3$ $256 + 64a + 16b + 4c + d = 4$ Find $a - b + c - d$. [b]p20.[/b] Consider flipping a fair coin $ 8$ times. How many sequences of coin flips are there such that the string HHH never occurs? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We have a line and $1390$ points around it such that the distance of each point to the line is less than $1$ centimeters and the distance between any two points is more than $2$ centimeters. prove that there are two points such that their distance is at least $10$ meters ($1000$ centimeters).

Consider horizontal and vertical segments in the plane that may intersect each other. Let $n$ denote their total number. Suppose that we have $m$ curves starting from the origin that are pairwise disjoint except for their endpoints. Assume that each curve intersects exactly two of the segments, a different pair for each curve. Prove that $m=O(n)$.

We call a permutation $ \left(a_1, a_2, ..., a_n\right)$ of $ \left(1, 2, ..., n\right)$ [i]quadratic[/i] if there exists at least a perfect square among the numbers $ a_1$, $ a_1 \plus{} a_2$, $ ...$, $ a_1 \plus{} a_2 \plus{} ... \plus{} a_n$. Find all natural numbers $ n$ such that all permutations in $ S_n$ are quadratic. [i]Remark.[/i] $ S_{n}$ denotes the $ n$-th symmetric group, the group of permutations on $ n$ elements.

There are 51 senators in a senate. The senate needs to be divided into $n$ committees so that each senator is on one committee. Each senator hates exactly three other senators. (If senator A hates senator B, then senator B does [i]not[/i] necessarily hate senator A.) Find the smallest $n$ such that it is always possible to arrange the committees so that no senator hates another senator on his or her committee.

$f(n)$ is the least number that there exist a $f(n)-$mino that contains every $n-$mino. Prove that $10000\leq f(1384)\leq960000$. Find some bound for $f(n)$

Given are 100 different positive integers. We call a pair of numbers [i]good[/i] if the ratio of these numbers is either 2 or 3. What is the maximum number of good pairs that these 100 numbers can form? (A number can be used in several pairs.) [i]Proposed by Alexander S. Golovanov, Russia[/i]

The numbers from $1$ to $64$ are written on the squares of a chessboard (from $1$ to $8$ from left to right on the first row , from $9$ to $16$ from left to right on the second row , and so on). Pluses are written before some of the numbers, and minuses are written before the remaining numbers in such a way that there are $4$ pluses and $4$ minuses in each row and in each column . Prove that the sum of the written numbers is equal to zero.

Given a board with size $25\times 25$. Some $1\times 1$ squares are marked, so that for each $13\times 13$ and $4\times 4$ sub-boards, there are atleast $\frac{1}{2}$ marked parts of the sub-board. Find the least possible amount of marked squares in the entire board.

Let $ X_n\equal{}\{1,2,...,n\}$,where $ n \geq 3$. We define the measure $ m(X)$ of $ X\subset X_n$ as the sum of its elements.(If $ |X|\equal{}0$,then $ m(X)\equal{}0$). A set $ X \subset X_n$ is said to be even(resp. odd) if $ m(X)$ is even(resp. odd). (a)Show that the number of even sets equals the number of odd sets. (b)Show that the sum of the measures of the even sets equals the sum of the measures of the odd sets. (c)Compute the sum of the measures of the odd sets.

There are $15$ magazines on a table, and they cover the surface of the table entirely. Prove that one can always take away $7$ magazines in such a way that the remaining ones cover at least $\dfrac{8}{15}$ of the area of the table surface

$20$ numbers are written on the board $1, 2, ... ,20$. Two players are putting signs before the numbers in turn ($+$ or $-$). The first wants to obtain the minimal possible absolute value of the sum. What is the maximal value of the absolute value of the sum that can be achieved by the second player?

Let $ n$ be an integer, $ n\geq 2$. Find all sets $ A$ with $ n$ integer elements such that the sum of any nonempty subset of $ A$ is not divisible by $ n\plus{}1$.

Two players in turn paint cells of the $7\times7$ table each using own color. A player can't paint a cell if its row or its column contains a cell painted by the other player. The game stops when one of the players can't make his turn. What maximal number of the cells can remain unpainted when the game stops?