[u]Polyhedron Hopping[/u] [b]p1.[/b] Travis is hopping around on the vertices of a cube. Each minute he hops from the vertex he's currently on to the other vertex of an edge that he is next to. After four minutes, what is the probability that he is back where he started? [b]p2.[/b] In terms of $k$, for $k > 0$ how likely is he to be back where he started after $2k$ minutes? [b]p3.[/b] While Travis is having fun on cubes, Sherry is hopping in the same manner on an octahedron. An octahedron has six vertices and eight regular triangular faces. After ve minutes, how likely is Sherry to be one edge away from where she started? [b]p4.[/b] In terms of $k$, for $k > 0$, how likely is it that after $k$ minutes Sherry is at the vertex opposite the vertex where she started?

Nikees has a set $S$ of $n$ points on a plane and decides to colour them. All $\dbinom{n}{2}$ line segments are drawn and they have distinct lengths. Find the maximum number of colours that are used at least once, given that: (a) For each point $P$, the two endpoints of the longest line segment connecting $P$ must be of the same colour. (b) For each point $P$, the two endpoints of the shortest line segment connecting $P$ must be of the same colour.

Five girls and five boys randomly sit in ten seats that are equally spaced around a circle. The probability that there is at least one diameter of the circle with two girls sitting on opposite ends of the diameter is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

[hide=R stands for Ramanujan , P stands for Pascal]they had two problem sets under those two names[/hide] [u] Set 1[/u] [b]R1.1 / P1.1[/b] Find $291 + 503 - 91 + 492 - 103 - 392$. [b]R1.2[/b] Let the operation $a$ & $b$ be defined to be $\frac{a-b}{a+b}$. What is $3$ & $-2$? [b]R1.3[/b]. Joe can trade $5$ apples for $3$ oranges, and trade $6$ oranges for $5$ bananas. If he has $20$ apples, what is the largest number of bananas he can trade for? [b]R1.4[/b] A cone has a base with radius $3$ and a height of $5$. What is its volume? Express your answer in terms of $\pi$. [b]R1.5[/b] Guang brought dumplings to school for lunch, but by the time his lunch period comes around, he only has two dumplings left! He tries to remember what happened to the dumplings. He first traded $\frac34$ of his dumplings for Arman’s samosas, then he gave $3$ dumplings to Anish, and lastly he gave David $\frac12$ of the dumplings he had left. How many dumplings did Guang bring to school? [u]Set 2[/u] [b]R2.6 / P1.3[/b] In the recording studio, Kanye has $10$ different beats, $9$ different manuscripts, and 8 different samples. If he must choose $1$ beat, $1$ manuscript, and $1$ sample for his new song, how many selections can he make? [b]R2.7[/b] How many lines of symmetry does a regular dodecagon (a polygon with $12$ sides) have? [b]R2.8[/b] Let there be numbers $a, b, c$ such that $ab = 3$ and $abc = 9$. What is the value of $c$? [b]R2.9[/b] How many odd composite numbers are there between $1$ and $20$? [b]R2.10[/b] Consider the line given by the equation $3x - 5y = 2$. David is looking at another line of the form ax - 15y = 5, where a is a real number. What is the value of a such that the two lines do not intersect at any point? [u]Set 3[/u] [b]R3.11[/b] Let $ABCD$ be a rectangle such that $AB = 4$ and $BC = 3$. What is the length of BD? [b]R3.12[/b] Daniel is walking at a constant rate on a $100$-meter long moving walkway. The walkway moves at $3$ m/s. If it takes Daniel $20$ seconds to traverse the walkway, find his walking speed (excluding the speed of the walkway) in m/s. [b]R3.13 / P1.3[/b] Pratik has a $6$ sided die with the numbers $1, 2, 3, 4, 6$, and $12$ on the faces. He rolls the die twice and records the two numbers that turn up on top. What is the probability that the product of the two numbers is less than or equal to $12$? [b]R3.14 / P1.5[/b] Find the two-digit number such that the sum of its digits is twice the product of its digits. [b]R3.15[/b] If $a^2 + 2a = 120$, what is the value of $2a^2 + 4a + 1$? PS. You should use hide for answers. R16-30 /P6-10/ P26-30 have been posted [url=https://artofproblemsolving.com/community/c3h2786837p24497019]here[/url], and P11-25 [url=https://artofproblemsolving.com/community/c3h2786880p24497350]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

On a circumference at some points sit $12$ grasshoppers. The points divide the circumference into $12$ arcs. By a signal each grasshopper jumps from its point to the midpoint of its arc (in clockwise direction). In such way new arcs are created. The process repeats for a number of times. Can it happen that at least one of the grasshoppers returns to its initial point after a) $12$ jumps? (4) a) $13$ jumps? (3)

Let $S$ be a nonempty finite set, and $\mathcal {F}$ be a collection of subsets of $S$ such that the following conditions are met: (i) $\mathcal {F}$ $\setminus$ {$S$} $\neq$ $\emptyset$ ; (ii) if $F_1, F_2 \in \mathcal {F}$, then $F_1 \cap F_2 \in \mathcal {F}$ and $F_1 \cup F_2 \in \mathcal {F}$. Prove that there exists $a \in S$ which belongs to at most half of the elements of $\mathcal {F}$.

In a forest, there are $n$ different trees (considered as points), no three of which lie on the same line. John takes photographs of the forest such that all trees are visible (and no two trees are behind each other). What is the largest number of orders of in which the trees that can appear on the photos? [i]Proposed by Gábor Mészáros, Sunnyvale, Kalifornia[/i]

Nirajan is trapped in a magical dungeon. He has infinitely many magical cards with arbitrary MPs(Mana Points) which is always an integer $\mathbb{Z}$. To escape, he must give the dungeon keeper some magical cards whose MPs add up to an integer with at least $2024$ divisors. Can Nirajan always escape? [i]( Proposed by Vlad Spǎtaru, Romania)[/i]

$32$ real and $32$ fake coins are given the same appearance. All fake coins weigh equally and less than the real ones, which also all weigh the same. How to determine the type of at least seven coins in six weighings on a scale with two bowls?

[b]p1.[/b] There are eight different dominoes in the box (fig.), but the boundaries between them are not visible. Draw the boundaries. [img]https://cdn.artofproblemsolving.com/attachments/6/f/6352b18c25478d68a23820e32a7f237c9f2ba9.png[/img] [b]p2.[/b] The teacher drew a quadrilateral $ABCD$ on the board. Vanya and Vitya marked points $X$ and $Y$ inside it, from which all sides of the quadrilateral are visible at equal angles. What is the distance between points $X$ and $Y$? (From point $X$, side $AB$ is visible at angle $AXB$.) [b]pЗ.[/b] Several identical black squares, perhaps partially overlapping, were placed on a white plane. The result was a black polygonal figure, possibly with holes or from several pieces. Could it be that this figure does not have a single right angle? [b]p4.[/b] The bus ticket number consists of six digits (the first digits may be zeros). A ticket is called [i]lucky [/i] if the sum of the first three digits is equal to the sum of the last three. Prove that the sum of the numbers of all lucky tickets is divisible by $13$. [b]p5.[/b] The Meandrovka River, which has many bends, crosses a straight highway under thirteen bridges. Prove that there are two neighboring bridges along both the highway and the river. (Bridges are called river neighbors if there are no other bridges between them on the river section; bridges are called highway neighbors if there are no other bridges between them on the highway section.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c2416727_soros_olympiad_in_mathematics]here.[/url]

An integer $n > 2$ is given. Peter wants to draw $n{}$ arcs of length $\alpha{}$ of great circles on a unit sphere so that they do not intersect each other. Prove that [list=a] [*]for all $\alpha<\pi+2\pi/n$ it is possible; [*]for all $\alpha>\pi+2\pi/n$ it is impossible; [/list] [i]Ilya Bogdanov[/i]

[b]p1.[/b] Find the sum of all $3$-digit positive integers $\overline{abc}$ that satisfy $$\overline{abc} = {n \choose a}+{n \choose b}+ {n \choose c}$$ for some $n \le 10$. [b]p2.[/b] Feng and Trung play a game. Feng chooses an integer $p$ from $1$ to $90$, and Trung tries to guess it. In each round, Trung asks Feng two yes-or-no questions about $p$. Feng must answer one question truthfully and one question untruthfully. After $15$ rounds, Trung concludes there are n possible values for $p$. What is the least possible value of $n$, assuming Feng chooses the best strategy to prevent Trung from guessing correctly? [b]p3.[/b] A hypercube $H_n$ is an $n$-dimensional analogue of a cube. Its vertices are all the points $(x_1, .., x_n)$ that satisfy $x_i = 0$ or $1$ for all $1 \le i \le n$ and its edges are all segments that connect two adjacent vertices. (Two vertices are adjacent if their coordinates differ at exactly one $x_i$ . For example, $(0,0,0,0)$ and $(0,0,0,1)$ are adjacent on $H_4$.) Let $\phi (H_n)$ be the number of cubes formed by the edges and vertices of $H_n$. Find $\phi (H_4) + \phi (H_5)$. [b]p4.[/b] Denote the legs of a right triangle as $a$ and $b$, the radius of the circumscribed circle as $R$ and the radius of the inscribed circle as $r$. Find $\frac{a+b}{R+r}$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given two finite collections of pairs of real numbers It turned out that for any three pairs $(a_1, b_1)$, $(a_2, b_2)$ and $(a_3, b_3)$ from the first collection there is a pair $(c, d)$ from the second collection, such that the following three inequalities hold: \[ a_1c + b_1d \geq 0,a_2c + b_2c \geq 0 \text{ and } a_3c + b_3d \geq 0 \] Prove that there is a pair $(\gamma, \delta)$ in the second collection, such that for any pair $(\alpha, \beta)$ from the first collection inequality $\alpha \gamma + \beta \delta \geq 0$ holds.

Suppose that each point on a plane is colored with one of the colors red or yellow. Show that exist a convex pentagon with three right angles and all vertices are with same color.

A one player game is played on the triangular board shown on the picture. A token is placed on each circle. Each token is white on one side and black on the other. Initially, the token at one vertex of the triangle has the black side up, while the others have the white sides up. A move consists of removing a token with the black side up and turning over the adjacent tokens (two tokens are adjacent if they are joined by a segment). Is it possible to remove all the tokens by a sequence of moves? [img]https://cdn.artofproblemsolving.com/attachments/d/2/aabf82a0ddd6907482f27e6e0f1e1b56cd931d.png[/img]

Given $n\ge 4$ real numbers $a_{n}>...>a_{1} > 0$. For $r > 0$, let $f_{n}(r)$ be the number of triples $(i,j,k)$ with $1\leq i<j<k\leq n$ such that $\frac{a_{j}-a_{i}}{a_{k}-a_{j}}=r$. Prove that ${f_{n}(r)}<\frac{n^{2}}{4}$.

Let $2001$ given points on a circle be coloured either red or green. In one step all points are recoloured simultaneously in the following way: If both direct neighbours of a point $P$ have the same colour as $P$, then the colour of $P$ remains unchanged, otherwise $P$ obtains the other colour. Starting with the first colouring $F_1$, we obtain the colourings $F_2,F_3 ,\ldots .$ after several recolouring steps. Prove that there is a number $n_0\le 1000$ such that $F_{n_0}=F_{n_0 +2}$. Is the assertion also true if $1000$ is replaced by $999$?

[b]p9.[/b] The frozen yogurt machine outputs yogurt at a rate of $5$ froyo$^3$/second. If the bowl is described by $z = x^2+y^2$ and has height $5$ froyos, how long does it take to fill the bowl with frozen yogurt? [b]p10.[/b] Prankster Pete and Good Neighbor George visit a street of $2021$ houses (each with individual mailboxes) on alternate nights, such that Prankster Pete visits on night $1$ and Good Neighbor George visits on night $2$, and so on. On each night $n$ that Prankster Pete visits, he drops a packet of glitter in the mailbox of every $n^{th}$ house. On each night $m$ that Good Neighbor George visits, he checks the mailbox of every $m^{th}$ house, and if there is a packet of glitter there, he takes it home and uses it to complete his art project. After the $2021^{th}$ night, Prankster Pete becomes enraged that none of the houses have yet checked their mail. He then picks three mailboxes at random and takes out a single packet of glitter to dump on George’s head, but notices that all of the mailboxes he visited had an odd number of glitter packets before he took one. In how many ways could he have picked these three glitter packets? Assume that each of these three was from a different house, and that he can only visit houses in increasing numerical order. [b]p11. [/b]The taxi-cab length of a line segment with endpoints $(x_1, y_1)$ and $(x_2, y_2)$ is $|x_1 - x_2| + |y_1- y_2|$. Given a series of straight line segments connected head-to-tail, the taxi-cab length of this path is the sum of the taxi-cab lengths of its line segments. A goat is on a rope of taxi-cab length $\frac72$ tied to the origin, and it can’t enter the house, which is the three unit squares enclosed by $(-2, 0)$,$(0, 0)$,$(0, -2)$,$(-1, -2)$,$(-1, -1)$,$(-2, -1)$. What is the area of the region the goat can reach? (Note: the rope can’t ”curve smoothly”-it must bend into several straight line segments.) [b]p12.[/b] Parabola $P$, $y = ax^2 + c$ has $a > 0$ and $c < 0$. Circle $C$, which is centered at the origin and lies tangent to $P$ at $P$’s vertex, intersects $P$ at only the vertex. What is the maximum value of a, possibly in terms of $c$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Julia is placing identical $1$-by-$1$ tiles on the $2$-by-$2$ grid pictured, one piece at a time, so that every piece she places after the first is adjacent to, but not on top of, some piece she’s already placed. Determine the number of ways that Julia can complete the grid. [img]https://cdn.artofproblemsolving.com/attachments/4/6/4a585593b9301ddb0e4ac3ceced212c378c9f8.png[/img]

We say that a set $S$ of $3$ unit squares is \textit{commutable} if $S = \{s_1,s_2,s_3\}$ for some $s_1,s_2,s_3$ where $s_2$ shares a side with each of $s_1,s_3$. How many ways are there to partition a $3\times 3$ grid of unit squares into $3$ pairwise disjoint commutable sets? [i]Proposed by Srinivasan Sathiamurthy[/i]

Several napkins of equal size and of shape of a unit disc were placed on a table (with overlappings). Is it always possible to hammer several point-sized nails so that all the napkins will be thus attached to the table with the same number of nails? (The nails cannot be hammered into the borders of the discs). Vladimir Dolnikov, Pavel Kozhevnikov

There are $12$ points that are vertices of a regular polygon with $12$ sides. Rafael must draw segments that have their two ends at two of the points drawn. He is allowed to have each point be an endpoint of more than one segment and for the segments to intersect, but he is prohibited from drawing three segments that are the three sides of a triangle in which each vertex is one of the $12$ starting points. Find the maximum number of segments Rafael can draw and justify why he cannot draw a greater number of segments.

[b]R[/b]thea, a distant planet, is home to creatures whose DNA consists of two (distinguishable) strands of bases with a fixed orientation. Each base is one of the letters H, M, N, T, and each strand consists of a sequence of five bases, thus forming five pairs. Due to the chemical properties of the bases, each pair must consist of distinct bases. Also, the bases H and M cannot appear next to each other on the same strand; the same is true for N and T. How many possible DNA sequences are there on Rthea?

Given positive integers $m$ and $n \ge m$, determine the largest number of dominoes ($1\times2$ or $2 \times 1$ rectangles) that can be placed on a rectangular board with $m$ rows and $2n$ columns consisting of cells ($1 \times 1$ squares) so that: (i) each domino covers exactly two adjacent cells of the board; (ii) no two dominoes overlap; (iii) no two form a $2 \times 2$ square; and (iv) the bottom row of the board is completely covered by $n$ dominoes.

Draw a regular hexagon. Then make a square from each edge of the hexagon. Then form equilateral triangles by drawing an edge between every pair of neighboring squares. If this figure is continued symmetrically off to infinity, what is the ratio between the number of triangles and the number of squares?