Edges of a planar graph $G$ are colored either with blue or red. Prove that there is a vertex like $v$ such that when we go around $v$ through a complete cycle, edges with the endpoint at $v$ change their color at most two times. Clarifications for complete cycle: If all the edges with one endpoint at $v$ are $(v,u_1),(v,u_2),\ldots,(v,u_k)$ such that $u_1,u_2,\ldots,u_k$ are clockwise with respect to $v$ then in the sequence of $(v,u_1),(v,u_2),\ldots,(v,u_k),(v,u_1)$ there are at most two $j$ such that colours of $(v,u_j),(v,u_{j+1})$ ($j \mod k$) differ.

[b]p1.[/b] If $a \diamond b = ab - a + b$, find $(3 \diamond 4) \diamond 5$ [b]p2.[/b] If $5$ chickens lay $5$ eggs in $5$ days, how many chickens are needed to lay $10$ eggs in $10$ days? [b]p3.[/b] As Alissa left her house to go to work one hour away, she noticed that her odometer read $16261$ miles. This number is a "special" number for Alissa because it is a palindrome and it contains exactly $1$ prime digit. When she got home that evening, it had changed to the next greatest "special" number. What was Alissa's average speed, in miles per hour, during her two hour trip? [b]p4.[/b] How many $1$ in by $3$ in by $8$ in blocks can be placed in a $4$ in by $4$ in by $9$ in box? [b]p5.[/b] Apple loves eating bananas, but she prefers unripe ones. There are $12$ bananas in each bunch sold. Given any bunch, if there is a $\frac13$ probability that there are $4$ ripe bananas, a $\frac16$ probability that there are $6$ ripe bananas, and a $\frac12$ probability that there are $10$ ripe bananas, what is the expected number of unripe bananas in $12$ bunches of bananas? [b]p6.[/b] The sum of the digits of a $3$-digit number $n$ is equal to the same number without the hundreds digit. What is the tens digit of $n$? [b]p7.[/b] How many ordered pairs of positive integers $(a, b)$ satisfy $a \le 20$, $b \le 20$, $ab > 15$? [b]p8.[/b] Let $z(n)$ represent the number of trailing zeroes of $n!$. What is $z(z(6!))?$ (Note: $n! = n\cdot (n-1) \cdot\cdot\cdot 2 \cdot 1$) [b]p9.[/b] On the Cartesian plane, points $A = (-1, 3)$, $B = (1, 8)$, and $C = (0, 10)$ are marked. $\vartriangle ABC$ is reflected over the line $y = 2x + 3$ to obtain $\vartriangle A'B'C'$. The sum of the $x$-coordinates of the vertices of $\vartriangle A'B'C'$ can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a$, $b$. Compute $a + b$. [b]p10.[/b] How many ways can Bill pick three distinct points from the figure so that the points form a non-degenerate triangle? [img]https://cdn.artofproblemsolving.com/attachments/6/a/8b06f70d474a071b75556823f70a2535317944.png[/img] [b]p11.[/b] Say piece $A$ is attacking piece $B$ if the piece $B$ is on a square that piece $A$ can move to. How many ways are there to place a king and a rook on an $8\times 8$ chessboard such that the rook isn't attacking the king, and the king isn't attacking the rook? Consider rotations of the board to be indistinguishable. (Note: rooks move horizontally or vertically by any number of squares, while kings move $1$ square adjacent horizontally, vertically, or diagonally). [b]p12.[/b] Let the remainder when $P(x) = x^{2020} - x^{2017} - 1$ is divided by $S(x) = x^3 - 7$ be the polynomial $R(x) = ax^2 + bx + c$ for integers $a$, $b$, $c$. Find the remainder when $R(1)$ is divided by $1000$. [b]p13.[/b] Let $S(x) = \left \lfloor \frac{2020}{x} \right\rfloor + \left \lfloor \frac{2020}{x + 1} \right\rfloor$. Find the number of distinct values $S(x)$ achieves for integers $x$ in the interval $[1, 2020]$. [b]p14.[/b] Triangle $\vartriangle ABC$ is inscribed in a circle with center $O$ and has sides $AB = 24$, $BC = 25$, $CA = 26$. Let $M$ be the midpoint of $\overline{AB}$. Points $K$ and $L$ are chosen on sides $\overline{BC}$ and $\overline{CA}$, respectively such that $BK < KC$ and $CL < LA$. Given that $OM = OL = OK$, the area of triangle $\vartriangle MLK$ can be expressed as $\frac{a\sqrt{b}}{c}$ where $a, b, c$ are positive integers, $gcd(a, c) = 1$ and $b$ is not divisible by the square of any prime. Find $a + b + c$. [b]p15.[/b] Euler's totient function, $\phi (n)$, is defined as the number of positive integers less than $n$ that are relatively prime to $n$. Let $S(n)$ be the set of composite divisors of $n$. Evaluate $$\sum^{50}_{k=1}\left( k - \sum_{d\in S(k)} \phi (d) \right)$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A social club has $101$ members, each of whom is fluent in the same $50$ languages. Any pair of members always talk to each other in only one language. Suppose that there were no three members such that they use only one language among them. Let $A$ be the number of three-member subsets such that the three distinct pairs among them use different languages. Find the maximum possible value of $A$.

There are 2018 cards numbered from 1 to 2018. The numbers of the cards are visible at all times. Tito and Pepe play a game. Starting with Tito, they take turns picking cards until they're finished. Then each player sums the numbers on his cards and whoever has an even sum wins. Determine which player has a winning strategy and describe it. P.S. Proposed by yours truly :-D

Let $a$ and $S$ be the length of the side and the area of regular triangle inscribed in a circle of radius $1$. A closed broken line $A_1A_2...A_{51}A_1$ consisting of $51$ segments of the same length $a$ is placed inside the circle. Prove that the sum of areas of the $ 51$ triangles between the neighboring segments $$A_1A_2A_3, A_2A_3A_4,..., A_{49}A_{50}A_{51}, A_{50}A_{51}A_1, A_{51}A_1A_2$$ is not less than $3S$. (A. Berzinsh, Riga)

In the coordinate plane, consider the set of all segments of integer lengths whose endpoints have integer coordinates. Prove that no two of these segments form an angle of $45^o$. Are there such segments in coordinate space?

Sam and Jonathan play a game where they take turns flipping a weighted coin, and the game ends when one of them wins. The coin has a $\frac89$ chance of landing heads and a $\frac19$ chance of landing tails. Sam wins when he flips heads, and Jonathan wins when he flips tails. Find the probability that Samwins, given that he takes the first turn. [i]Proposed by Samuel Tsui[/i]

$N$ lines are drawn on the plane that divide it into a certain number for finite and endless parts. For which number of straight lines $n$ can there be more finite than infinite among the resulting level parts?

It is allowed to perform the following transformations in the plane with any integers $a$: (1) Transform every point $(x, y)$ to the corresponding point $(x + ay, y)$, (2) Transform every point $(x, y)$ to the corresponding point $(x, y + ax)$. Does there exist a non-square rhombus whose all vertices have integer coordinates and which can be transformed to: a) Vertices of a square, b) Vertices of a rectangle with unequal side lengths?

The numbers $1, 2,\ldots ,50$ are written on a blackboard. Ana performs the following operations: she chooses any three numbers $a, b$ and $c$ from the board and replaces them with their sum $a + b + c$ and writes the number $(a + b) (b + c) (c + a)$ in the notebook. Ana performs these operations until there are only two numbers left on the board ($24$ operations in total). Then, she calculates the sum of the numbers written down in her notebook. Let $M$ and $m$ be the maximum and minimum possible of the sums obtained by Ana. Find the value of $\frac{M}{m}$.

Find all integers $n > 1$ for which it is possible to fill the cells of an $n \times n$ grid with the integers from $1$ to $n^2$, without repetition, such that the average of the $n$ numbers in each row and each column is an integer.

Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties: [list=disc] [*]every term in the sequence is less than or equal to $2^{2023}$, and [*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\] [/list]

We consider graphs with vertices colored black or white. "Switching" a vertex means: coloring it black if it was formerly white, and coloring it white if it was formerly black. Consider a finite graph with all vertices colored white. Now, we can do the following operation: Switch a vertex and simultaneously switch all of its neighbours (i. e. all vertices connected to this vertex by an edge). Can we, just by performing this operation several times, obtain a graph with all vertices colored black? [It is assumed that our graph has no loops (a [i]loop[/i] means an edge connecting one vertex with itself) and no multiple edges (a [i]multiple edge[/i] means a pair of vertices connected by more than one edge).]

Let $n, k$ be natural numbers, $1 \leq k < n$. In each vertex of a regular polygon with $n$ sides is written $1$ or $-1$. At each step we choose $k$ consecutive vertices and change their signs. Is it possible that, starting from a certain configuration and by doing the operation a few times to obtain any other configuration?

A $m \times n$ table is filled with signs $"+"$ and $"-"$. A table is called irreducible if one cannot reduce it to the table filled with $"+"$, applying the following operations (as many times as one wishes). $a)$ It is allowed to flip all the signs in a row or in a column. Prove that an irreducible table contains an irreducible $2\times 2$ sub table. $b)$ It is allowed to flip all the signs in a row or in a column or on a diagonal (corner cells are diagonals of length $1$). Prove that an irreducible table contains an irreducible $4\times 4$ sub table.

Inside a convex $1000$-gon, $500$ points are selected so that no three of the $1500$ points — the ones selected and the vertices of the polygon — lie on the same straight line. This $1000$-gon is then divided into triangles so that all $1500$ points are vertices of the triangles, and so that these triangles have no other vertices. How many triangles will there be?

Every point of the plane is painted with one of three colors. Can we always find two points a distance $1$ cm apart which are of the same color?

Let $ l,d,k$ be natural numbers. We want to prove that for large numbers $ n$, for each $ k$-coloring of the $ n$-dimensional cube with side length $ l$, there is a $ d$-dimensional subspace that all of its vertices have the same color. Let $ H(l,d,k)$ be the least number such that for $ n\geq H(l,d,k)$ the previus statement holds. a) Prove that: \[ H(l,d \plus{} 1,k)\leq H(l,1,k) \plus{} H(l,d,k^l)^{H(l,1,k)} \] b) Prove that \[ H(l \plus{} 1,1,k \plus{} 1)\leq H(l,1 \plus{} H(l \plus{} 1,1,k),k \plus{} 1) \] c) Prove the statement of problem. d) Prove Van der Waerden's Theorem.

Let $q$ be a positive integer. Prove there exists a constant $C_q$ such that the following inequality holds for any finite set $A$ of integers: \[|A+qA|\ge (q+1)|A|-C_q.\] [i]Proposed by Antal Balog.[/i]

Coins are placed in some squares on a $n\times n$ board. Each coin can be moved towards the square symmetrical with respect to either of the two diagonals, as long as that square is empty. The initial coin setup is said to be [i]good [/i], if any coin can make the first move. (a) Determine the maximum number of coins $M$ that can be placed on the $n\times n$ board, such that the configuration is good. (b) Calculate the total number of good configurations that have exactly $M$ coins.

$n$ diameters divide a disk into $2n$ equal sectors. $n$ of the sectors are coloured blue , and the other $n$ are coloured red (in arbitrary order) . Blue sectors are numbered from $1$ to $n$ in the anticlockwise direction, starting from an arbitrary blue sector, and red sectors are numbered from $1$ to $n$ in the clockwise direction, starting from an arbitrary red sector. Prove that there is a semi-disk containing sectors with all numbers from $1$ to $n$. (V Proizvolov)

Eight people are sitting at a circular table, it is known that any three consecutive people at the table have an odd number of coins (among the three people), show that each person has at least one coin.

In each square of an $m \times n$ rectangular board there is a nought or a cross. Let $f(m,n)$ be the number of such arrangements that contain a row or a column consisting of noughts only. Let $g(m,n)$ be the number of arrangements that contain a row consisting of noughts only, or a column consisting of crosses only. Which of the numbers $f(m,n)$ and $g(m,n)$ is larger?

Prove that the number of orientations of a connected $3$-regular graph on $2n$ vertices where the number of vertices with indegree $0$ and outdegree $0$ are equal, is exactly $2^{n+1}$ $ {2n} \choose {n}$.

Is it possible to fill a $3 \times 3$ grid with each of the numbers $1,2,\ldots,9$ once each such that the sum of any two numbers sharing a side is prime?