Justine has a coin which will come up the same as the last flip $\frac23$ of the time and the other side $\frac13$ of the time. She flips it and it comes up heads. She then flips it $2010$ more times. What is the probability that the last flip is heads?

$(NET 4)$ A boy has a set of trains and pieces of railroad track. Each piece is a quarter of circle, and by concatenating these pieces, the boy obtained a closed railway. The railway does not intersect itself. In passing through this railway, the train sometimes goes in the clockwise direction, and sometimes in the opposite direction. Prove that the train passes an even number of times through the pieces in the clockwise direction and an even number of times in the counterclockwise direction. Also, prove that the number of pieces is divisible by $4.$

Let $n$ be a positive integer. We call $(a_1,a_2,\cdots,a_n)$ a [i]good[/i] $n-$tuple if $\sum_{i=1}^{n}{a_i}=2n$ and there doesn't exist a set of $a_i$s such that the sum of them is equal to $n$. Find all [i]good[/i] $n-$tuple. (For instance, $(1,1,4)$ is a [i]good[/i] $3-$tuple, but $(1,2,1,2,4)$ is not a [i]good[/i] $5-$tuple.)

Emilia and Julieta have a pile of 2024 cards and play the following game: they take turns, and each player removes a number of cards that must be a power of two, i.e., \(1, 2, 4, 8, \dots\). The player who removes the last card wins. Julieta starts the game. Prove that there exists a strategy for Julieta that guarantees her victory, no matter how Emilia plays.

Let $r$ be a positive integer, and let $a_0 , a_1 , \cdots $ be an infinite sequence of real numbers. Assume that for all nonnegative integers $m$ and $s$ there exists a positive integer $n \in [m+1, m+r]$ such that \[ a_m + a_{m+1} +\cdots +a_{m+s} = a_n + a_{n+1} +\cdots +a_{n+s} \] Prove that the sequence is periodic, i.e. there exists some $p \ge 1 $ such that $a_{n+p} =a_n $ for all $n \ge 0$.

An $n$ by $n$ table has an integer in each cell, such that no two cells within a row share the same number. Prove that it is possible to permute the elements within each row to obtain a table that has $n$ distinct numbers in each column.

Compute the number of ways to rearrange nine white cubes and eighteen black cubes into a $3\times 3\times 3$ cube such that each $1\times1\times3$ row or column contains exactly one white cube. Note that rotations are considered $\textit{distinct}$.

Is it possible to divide a polygon with $21$ sides into $2022$ triangles in such a way that among all the vertices there are not three collinear?

There are $n$ kids. From each two at least one of them has sent an SMS to the other. For each kid $A$, among the kids on which $A$ has sent an SMS, exactly 10% of them have sent an SMS to $A$. Determine the number of possible three-digit values of $n$.

The image that maps $x$ to $1 - x$ is called [i]complement[/i], the image that maps $x$ to $\frac{1}{x}$ is called [i]invert[/i]. Two numbers $x$ and $y$ are called related if they can be transferred into each other by means of [i]complementation [/i]and/or [i]inversion[/i]. A [i]family [/i] is a collection of numbers where every two elements are related. Determine the maximum size $n$ of such a family. Show that the number line can be divided into $n$ parts, such that each of those $n$ parts contains exactly one number from each $n$-number family.

More than five competitors participated in a chess tournament. Each competitor played exactly once against each of the other competitors. Five of the competitors they each lost exactly two games. All other competitors each won exactly three games. There were no draws in the tournament. Determine how many competitors there were and show a tournament that verifies all conditions.

A set $A$ of integers is called [i]sum-full[/i] if $A \subseteq A + A$, i.e. each element $a \in A$ is the sum of some pair of (not necessarily different) elements $b,c \in A$. A set $A$ of integers is said to be [i]zero-sum-free[/i] if $0$ is the only integer that cannot be expressed as the sum of the elements of a finite nonempty subset of $A$. Does there exist a sum-full zero-sum-free set of integers? [i]Romania (Dan Schwarz)[/i]

For some 2011 natural numbers, all the $\frac{2010\cdot 2011}{2}$ possible sums were written out on a board. Could it have happened that exactly one third of the written numbers were divisible by three and also exactly one third of them give a remainder of one when divided by three?

We are given twelve coins, one of which is a fake with a different mass from the other eleven. Determine that coin with three weighings and whether it is heavier or lighter than the others.

The rook, standing on the surface of the checkered cube, beats the cells, located in the same row as well as on the continuations of this series through one or even several edges. (The picture shows an example for a $4 \times 4 \times 4$ cube,visible cells that some beat the rook, shaded gray.) What is the largest number do not beat each other rooks can be placed on the surface of the cube $50 \times 50 \times 50$?

In a directed graph with $2013$ vertices, there is exactly one edge between any two vertices and for every vertex there exists an edge outwards this vertex. We know that whatever the arrangement of the edges, from every vertex we can reach $k$ vertices using at most two edges. Find the maximum value of $k$.

The map of a town shows a plane divided into equal equilateral triangles. The sides of these triangles are streets and their vertices are intersections; $6$ streets meet at each junction. Two cars start simultaneously in the same direction and at the same speed from points $A$ and $B$ situated on the same street (the same side of a triangle). After any intersection an admissible route for each car is either to proceed in its initial direction or turn through $120^o$ to the right or to the left. Can these cars meet? (Either prove that these cars won’t meet or describe a route by which they will meet.) [img]https://cdn.artofproblemsolving.com/attachments/2/d/2c934bcd0c7fc3d9dca9cee0b6f015076abbdb.png[/img]

A round table has room for n diners ( $n\ge 2$). There are napkins in three different colours. In how many ways can the napkins be placed, one for each seat, so that no two neighbours get napkins of the same colour?

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.

We call a table of size $n \times n$ self-describing if each cell of the table contains the total number of even numbers in its row and column other than itself. How many self-describing tables of size a) $3 \times 3$ exist? b) $4 \times 4$ exist? c) $5 \times 5$ exist? Two tables are different if they differ in at least one cell.

Players $A$ and $B$ play a game on a blackboard that initially contains 2020 copies of the number 1 . In every round, player $A$ erases two numbers $x$ and $y$ from the blackboard, and then player $B$ writes one of the numbers $x+y$ and $|x-y|$ on the blackboard. The game terminates as soon as, at the end of some round, one of the following holds: $(1)$ one of the numbers on the blackboard is larger than the sum of all other numbers; $(2)$ there are only zeros on the blackboard. Player $B$ has to pay to player $A$ an amount in reais equivalent to the quantity of numbers left on the blackboard after the game ends. Show that player $A$ can earn at least 8 reais regardless of the moves taken by $B$ Ps.: Easier version of [url = https://artofproblemsolving.com/community/c6h2625868p22698110]ISL 2020 C8[/url]

Let $n$, $k$ be fixed integers. On a $n \times n$ board, label each square $0$ or $1$ such that in each $2k \times 2k$ sub-square of the board, the number of $0$'s and $1$'s written are the same. What is the largest possible sum of numbers written on the $n\times n$ board?

Let $n$ be a positive integer, and let $F$ be a family of subsets of $\{1, 2, ... , 2^n\}$ such that for any non-empty $ A\in F$ there exists $B \in F$ so that $|A| = |B| + 1$ and $B \subset A$. Suppose that F contains all $(2^n - 1)$-element subsets of $\{1, 2, ... , 2^n\}$ Determine the minimal possible value of $|F|$.

[b]p1.[/b] (a) Find three positive integers $a, b, c$ whose sum is $407$, and whose product (when written in base $10$) ends in six $0$'s. (b) Prove that there do NOT exist positive integers $a, b, c$ whose sum is $407$ and whose product ends in seven $0$'s. [b]p2.[/b] Three circles, each of radius $r$, are placed on a plane so that the center of each circle lies on a point of intersection of the other two circles. The region $R$ consists of all points inside or on at least one of these three circles. Find the area of $R$. [b]p3.[/b] Let $f_1(x) = a_1x^2+b_1x+c_1$, $f_2(x) = a_2x^2+b_2x+c_2$ and $f_3(x) = a_3x^2+b_3x+c_3$ be the equations of three parabolas such that $a_1 > a_2 > a-3$. Prove that if each pair of parabolas intersects in exactly one point, then all three parabolas intersect in a common point. [b]p4.[/b] Gigafirm is a large corporation with many employees. (a) Show that the number of employees with an odd number of acquaintances is even. (b) Suppose that each employee with an even number of acquaintances sends a letter to each of these acquaintances. Each employee with an odd number of acquaintances sends a letter to each non-acquaintance. So far, Leslie has received $99$ letters. Prove that Leslie will receive at least one more letter. (Notes: "acquaintance" and "non-acquaintance" refer to employees of Gigaform. If $A$ is acquainted with $B$, then $B$ is acquainted with $A$. However, no one is acquainted with himself.) [b]p5.[/b] (a) Prove that for every positive integer $N$, if $A$ is a subset of the numbers $\{1, 2, ...,N\}$ and $A$ has size at least $2N/3 + 1$, then $A$ contains a three-term arithmetic progression (i.e., there are positive integers $a$ and $b$ so that all three of the numbers $a$,$a + b$, and $a + 2b$ are elements of $A$). (b) Show that if $A$ is a subset of $\{1, 2, ..., 3500\}$ and $A$ has size at least $2003$, then $A$ contains a three-term arithmetic progression. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A rectangular building consists of $30$ square rooms situated like the cells of a $2 \times 15$ board. In each room there are three doors, each of which leads to another room (not necessarily different). How many ways are there to distribute the doors between the rooms so that it is possible to get from any room to any other one without leaving the building?