We wish to find the sum of $40$ given numbers utilizing $40$ processors. Initially, we have the number $0$ on the screen of each processor. Each processor adds the number on its screen with a number entered directly (only the given numbers could be entered directly to the processors) or transferred from another processor in a unit time. Whenever a number is transferred from a processor to another, the former processor resets. Find the least time needed to find the desired sum.

In a $2\times 2$ Domino game, each tile is square and divided into four spaces, as shown in the figure. In each box there is a number of points that varies from $0$ points (empty) to $6$ points. Two $2\times 2$ Domino tiles are equal if it is possible to rotate one of the two tiles until the other is obtained. In a $2\times 2$ Domino pack, what is the maximum number of different tiles that can be such that on each tile at least two squares have the same number of points? [img]https://cdn.artofproblemsolving.com/attachments/5/3/87efeaa24efc78a75a78e94c53f296dd078f71.png[/img]

For a pair of integers $a$ and $b$, with $0<a<b<1000$, a set $S\subset \begin{Bmatrix}1,2,3,...,2024\end{Bmatrix}$ $escapes$ the pair $(a,b)$ if for any elements $s_1,s_2\in S$ we have $\left|s_1-s_2\right| \notin \begin{Bmatrix}a,b\end{Bmatrix}$. Let $f(a,b)$ be the greatest possible number of elements of a set that escapes the pair $(a,b)$. Find the maximum and minimum values of $f$.

The streets of a town are arranged in three directions , dividing the town into blocks which are equilateral triangles of equal area. Traffic , when reaching an intersection, may only go straight ahead, or turn left or right through $120^0$ , as shown in the diagram. [img]https://cdn.artofproblemsolving.com/attachments/3/6/a100a5c39bf15116582bc0bceb76fcbae28af9.png[/img] No turns are permitted except the ones at intersections . One car departs for a certain nearby intersection and when it reaches it a second car starts moving toward it. From then on both cars continue travelling at the same speed (but do not necessarily take the same turns). Is it possible that there will be a time when they will encounter each other somewhere? ( N . N . Konstantinov , Moscow )

Given a convex polygon with 20 vertexes, there are many ways of traingulation it (as 18 triangles). We call the diagram of triangulation, meaning the 20 vertexes, with 37 edges(17 triangluation edges and the original 20 edges), a T-diagram. And the subset of this T-diagram with 10 edges which covers all 20 vertexes(meaning any two edges in the subset doesn't cover the same vertex) calls a "perfect matching" of this T-diagram. Among all the T-diagrams, find the maximum number of "perfect matching" of a T-diagram.

In the sixth-year exams of a Center, they pass Physics at least$70\%$ of the students, Mathematics at least $75\%$; Philosophy at least, the $90\%$ and the Language at least, $85\%$. How many students, at least, pass these four subjects?

A zig-zag in the plane consists of two parallel half-lines connected by a line segment. Find $z_n$, the maximum number of regions into which $n$ zig-zags can divide the plane. For example, $z_1=2,z_2=12$(see the diagram). Of these $z_n$ regions how many are bounded? [The zig-zags can be as narrow as you please.] Express your answers as polynomials in $n$ of degree not exceeding $2$. [asy] draw((30,0)--(-70,0), Arrow); draw((30,0)--(-20,-40)); draw((-20,-40)--(80,-40), Arrow); draw((0,-60)--(-40,20), dashed, Arrow); draw((0,-60)--(0,15), dashed); draw((0,15)--(40,-65),dashed, Arrow); [/asy]

A frog jumps around on the grid points in the plane, from one grid point to another. The frog starts at the point $(0, 0)$. Then it makes, successively, a jump of one step horizontally, a jump of $2$ steps vertically, a jump of $3$ steps horizontally, a jump of $4$ steps vertically, et cetera. Determine all $n > 0$ such that the frog can be back in $(0, 0)$ after $n$ jumps.

Squares of an $n \times n$ table ($n \ge 3$) are painted black and white as in a chessboard. A move allows one to choose any $2 \times 2$ square and change all of its squares to the opposite color. Find all such n that there is a finite number of the moves described after which all squares are the same color.

In a certain country there are $10$ cities connected by a network of one-way nonstop flights so that it is possible to fly (using one or more flights) from any city to any other. Let $n$ be the least number of flights needed to complete a trip starting from one of the cities, visiting all others and returning to the starting point. Find the greatest possible value of $n$.

A square is given. Lines divide it into $n$ polygons. What is he the largest possible sum of the internal angles of all polygons?

We divide $999\times 999$ square into the angles with $3$ cells. Prove, that number of ways is divided by $2^7$.( Angle is a figure, that we can get if we remove one cell from $2 \times 2$ square).

Is it possible to select $1000$ points in the plane so that $6000$ pairwise distances between them are equal?

In a lecture hall some chairs are placed in rows and columns, forming a rectangle. In each row there are $6$ boys sitting and in each column there are $8$ girls sitting, whereas $15$ places are not taken. What can be said about the number of rows and that of columns?

[b]p1.[/b] What is $2 \cdot 24 + 20 \cdot 24 + 202 \cdot 4 + 2024$? [b]p2.[/b] Jerry has $300$ legos. Tie can either make cars, which require $17$ legos, or bikes, which require $13$ legos. Assuming he uses all of his legos, how many ordered pairs $(a, b)$ are there such that he makes $a$ cars and $b$ bikes? [b]p3.[/b] Patrick has $7$ unique textbooks: $2$ Geometry books, $3$ Precalculus books and $2$ Algebra II books. How many ways can he arrange his books on a bookshelf such that all the books of the same subjects are adjacent to each other? [b]p4.[/b] After a hurricane, a $32$ meter tall flagpole at the Act on-Boxborough Regional High School snapped and fell over. Given that the snapped part remains in contact with the original pole, and the top of the polo falls $24$ meters away from the bottom of the pole, at which height did the polo snap? (Assume the flagpole is perpendicular to the ground.) [b]p5.[/b] Jimmy is selling lemonade. Iio has $200$ cups of lemonade, and he will sell them all by the end of the day. Being the ethically dubious individual he is, Jimmy intends to dilute a few of the cups of lemonade with water to conserve resources. Jimmy sells each cup for $\$4$. It costs him $\$ 1$ to make a diluted cup of lemonade, and it costs him $\$2.75$ to make a cup of normal lemonade. What is the minimum number of diluted cups Jimmy must sell to make a profit of over $\$400$? [b]p6.[/b] Jeffrey has a bag filled with five fair dice: one with $4$ sides, one with $6$ sides, one with $8$ sides, one with $12$ sides, and one with $20$ sides. The dice are numbered from $1$ to the number of sides on the die. Now, Marco will randomly pick a die from .Jeffrey's bag and roll it. The probability that Marco rolls a $7$ can be expressed as $\frac{a}{b}$ where $a$ and $b$ are relatively prime positive integers. Find $a+b$. [b]p7.[/b] What is the remainder when the sum of the first $2024$ odd numbers is divided by $6072$? [b]p8.[/b] A rhombus $ABCD$ with $\angle A = 60^o$ and $AB = 600$ cm is drawn on a piece of paper. Three ants start moving from point $A$ to the three other points on the rhombus. One ant walks from $A$ to $B$ at a leisurely speed of $10$ cm/s. The second ant runs from $A$ to $C$ at a slightly quicker pace of $6\sqrt3$ cm/s, arriving to $C$ $x$ seconds after the first ant. The third ant travels from $A$ to $B$ to $D$ at a constant speed, arriving at $D$ $x$ seconds after the second ant. The speed of the last ant can be written as $\frac{m}{n}$ cm/s, where $m$ and $n$ are relatively prime positive integers. Find $mn$. [b]p9.[/b] This year, the Apple family has harvested so many apples that they cannot sell them all! Applejack decides to make $40$ glasses of apple cider to give to her friends. If Twilight and Fluttershy each want $1$ or $2$ glasses; Pinkie Pic wants cither $2$, $14$, or $15$ glasses; Rarity wants an amount of glasses that is a power of three; and Rainbow Dash wants any odd number of glasses, then how many ways can Applejack give her apple cider to her friends? Note: $1$ is considered to be a power of $3$. [b]p10.[/b] Let $g_x$ be a geometric sequence with first term $27$ and successive ratio $2n$ (so $g_{x+1}/g_x = 2n$). Then, define a function $f$ as $f(x) = \log_n(g_x)$, where $n$ is the base of the logarithm. It is known that the sum of the first seven terms of $f(x)$ is $42$. Find $g_2$, the second term of the geometric sequence. Note: The logarithm base $b$ of $x$, denoted $\log_b(x)$ is equal to the value $y$ such that $b^y = x$. In other words, if $\log_b(x) = y$, then $b^y = x$. [b]p11.[/b] Let $\varepsilon$ be an ellipse centered around the origin, such that its minor axis is perpendicular to the $x$-axis. The length of the ellipse's major and minor axes is $8$ and $6$, respectively. Then, let $ABCD$ be a rectangle centered around the origin, such that $AB$ is parallel to the $x$-axis. The lengths of $AB$ and $BC$ are $8$ and $3\sqrt2$, respectively. The area outside the ellipse but inside the rectangle can be expressed as $a\sqrt{b}-c-d\pi$, for positive integers $a$, $b$, $c$, $d$ where $b$ is not divisible by a perfect square of any prime. Find $a + b + c + d$. [img]https://cdn.artofproblemsolving.com/attachments/e/c/9d943966763ee7830d037ef98c21139cf6f529.png[/img] [b]p12.[/b] Let $N = 2^7 \cdot 3^7 \cdot 5^5$. Find the number of ways to express $N$ as the product of squares and cubes, all of which are integers greater than $1$. [b]p13.[/b] Jerry and Eric are playing a $10$-card game where Jerry is deemed the ’’landlord" and Eric is deemed the ' peasant'’. To deal the cards, the landlord keeps one card to himself. Then, the rest of the $9$ cards are dealt out, such that each card has a $1/2$ chance to go to each player. Once all $10$ cards are dealt out, the landlord compares the number of cards he owns with his peasant. The probability that the landlord wins is the fraction of cards he has. (For example, if Jerry has $5$ cards and Eric has $2$ cards, Jerry has a$ 5/7$ ths chance of winning.) The probability that Jerry wins the game can be written as $\frac{p}{q}$ where $p$ and $q$ are relatively prime. Find $p + q$. [b]p14.[/b] Define $P(x) = 20x^4 + 24x^3 + 10x^2 + 21x+ 7$ to have roots $a$, $b$, $c$, and $d$. If $Q(x)$ has roots $\frac{1}{a-2}$,$\frac{1}{b-2}$,$ \frac{1}{c-2}$, $\frac{1}{d-2}$ and integer coefficients with a greatest common divisor of $1$, then find $Q(2)$. [b]p15.[/b] Let $\vartriangle ABC$ be a triangle with side lengths $AB = 14$, $BC = 13$, and $AC = 15$. The incircle of $\vartriangle ABC$ is drawn with center $I$, tangent to $\overline{AB}$ at $X$. The line $\overleftrightarrow{IX}$ intersects the incircle again at $Y$ and intersects $\overline{AC}$ at $Z$. The area of $\vartriangle AYZ$ can be expressed as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m + n$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are 20 people at a party. Each person holds some number of coins. Every minute, each person who has at least 19 coins simultaneously gives one coin to every other person at the party. (So, it is possible that $A$ gives $B$ a coin and $B$ gives $A$ a coin at the same time.) Suppose that this process continues indefinitely. That is, for any positive integer $n$, there exists a person who will give away coins during the $n$th minute. What is the smallest number of coins that could be at the party? [i]Proposed by Ray Li[/i]

On a chessboard, Po controls a white queen and plays, in alternate turns, against an invisible black king (there are only those two pieces on the board). The king cannot move to a square where he would be in check, neither capture the queen. Every time the king makes a move, Po receives a message from beyond that tells which direction the king has moved (up, right, up-right, etc). His goal is to make the king unable to make a movement. Can Po reach his goal with at most $150$ moves, regardless the starting position of the pieces?

Sixteen people for groups of four people such that each two groups have at most two members in common. Prove that there exists a set of six people in which every group is not properly contained in it.

Given is a graph $G$ of $n+1$ vertices, which is constructed as follows: initially there is only one vertex $v$, and one a move we can add a vertex and connect it to exactly one among the previous vertices. The vertices have non-negative real weights such that $v$ has weight $0$ and each other vertex has a weight not exceeding the avarage weight of its neighbors, increased by $1$. Prove that no weight can exceed $n^2$.

There are $n$ vertices and $m > n$ edges in a graph. Each edge is colored either red or blue. In each year, we are allowed to choose a vertex and flip the color of all edges incident to it. Prove that there is a way to color the edges (initially) so that they will never all have the same color

Let $\mathbb X$ be the set of all bijective functions from the set $S=\{1,2,\cdots, n\}$ to itself. For each $f\in \mathbb X,$ define \[T_f(j)=\left\{\begin{aligned} 1, \ \ \ & \text{if} \ \ f^{(12)}(j)=j,\\ 0, \ \ \ & \text{otherwise}\end{aligned}\right.\] Determine $\sum_{f\in\mathbb X}\sum_{j=1}^nT_{f}(j).$ (Here $f^{(k)}(x)=f(f^{(k-1)}(x))$ for all $k\geq 2.$)

In a row the numbers $1,2,...,2010$ have been written. Two players, taking turns, write $+$ or $\times$ between two consecutive numbers whenever possible. The first player wins if the algebraic sum obtained is divisible by $3$; otherwise, the second player wins. Find a winning strategy for one of the players.

For $i = 1,2, \ldots, 1991$, we choose $n_i$ points and write number $i$ on them (each point has only written one number on it). A set of chords are drawn such that: (i) They are pairwise non-intersecting. (ii) The endpoints of each chord have distinct numbers. If for all possible assignments of numbers the operation can always be done, find the necessary and sufficient condition the numbers $n_1, n_2, \ldots, n_{1991}$ must satisfy for this to be possible.

Prove that one can cut $a \times b$ rectangle, $\frac{b}{2} < a < b$, into three pieces and rearrange them into a square (without overlaps and holes).

Let $k$ be a fixed natural number. In the infinite number of real line, each integer is colored with color ..., red, green, blue, red, green, blue, ... and so on. A number of flea settles at first at integer points. On each turn, a flea will jump over the other tick so that the distance $k$ is the original distance. Formally, we may choose $2$ tails $A, B$ that are spaced $n$ and move $A$ to the different side of $B$ so the current distance is $kn$. Some fleas may occupy the same point because we consider the size of fleas very small. Determine all the values of $k$ so that, whatever the initial position of the ticks, we always get a position where all ticks land on the same color.