For what values of $ n$ does there exist an $ n \times n$ array of entries -1, 0 or 1 such that the $ 2 \cdot n$ sums obtained by summing the elements of the rows and the columns are all different?

A rectangle $\mathcal{R}$ with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of $\mathcal{R}$ are either all odd or all even. [i]Proposed by Jeck Lim, Singapore[/i]

Determine the number of paths from $A$ to $B$ on the picture that go along gridlines only, do not pass through any point twice, and never go upwards? [img]https://cdn.artofproblemsolving.com/attachments/0/2/87868e24a48a2e130fb5039daeb85af42f4b9d.png[/img]

Every bacterium has a horizontal body with natural length and some nonnegative number of vertical feet, each with nonnegative (!) natural length, that lie below its body. In how many ways can these bacteria fill an $m\times n$ table such that no two of them overlap? [i]proposed by Mahyar Sefidgaran[/i]

The alphabet of language $BAU$ consists of letters $B, A$, and $U$. Independently of the choice of the $BAU$ word of length n from which to start, one can construct all the $BAU$ words with length n using iteratively the following rules: (1) invert the order of the letters in the word; (2) replace two consecutive letters: $BA \to UU, AU \to BB, UB \to AA, UU \to BA, BB \to AU$ or $AA \to UB$. Given that $BBAUABAUUABAUUUABAUUUUABB$ is a $BAU$ word, does $BAU$ have a) the word $BUABUABUABUABAUBAUBAUBAUB$ ? b) the word $ABUABUABUABUAUBAUBAUBAUBA$ ?

Consider a rectangular grid of $ 10 \times 10$ unit squares. We call a [i]ship[/i] a figure made up of unit squares connected by common edges. We call a [i]fleet[/i] a set of ships where no two ships contain squares that share a common vertex (i.e. all ships are vertex-disjoint). Find the greatest natural number that, for each its representation as a sum of positive integers, there exists a fleet such that the summands are exactly the numbers of squares contained in individual ships.

A boy write three times the natural number $n$ in a blackboard. He then performed an operation of the following type several times: He erased one of the numbers and wrote in its place the sum of the two others minus $1$. After several moves, one of the three numbers in the blackboard is $900$. Find all the posible values of $n$.

A [i]short-sighted[/i] rook is a rook that beats all squares in the same column and in the same row for which he can not go more than $60$-steps. What is the maximal amount of short-sighted rooks that don't beat each other that can be put on a $100\times 100$ chessboard.

Among the points corresponding to number $1,2,...,2n$ on the real line, $n$ are colored in blue and $n$ in red. Let $a_1,a_2,...,a_n$ be the blue points and $b_1,b_2,...,b_n$ be the red points. Prove that the sum $\mid a_1-b_1\mid+...+\mid a_n-b_n\mid$ does not depend on coloring , and compute its value. :roll:

Daniel, Ethan, and Zack are playing a multi-round game of Tetris. Whoever wins $11$ rounds first is crowned the champion. However Zack is trying to pull off a "reverse-sweep", where (at-least) one of the other two players first hits $10$ wins while Zack is still at $0$, but Zack still ends up being the first to reach $11$. How many possible sequences of round wins can lead to Zack pulling off a reverse sweep? [i]Proposed by Dilhan Salgado[/i]

After the schoolday is over, Juku must attend an extra math class. The teacher writes a quadratic equation $ x^2\plus{} p_1x\plus{}q_1 \equal{} 0$ with integer coefficients on the blackboard and Juku has to find its solutions. If they are not both integers, Jukumay go home. If the solutions are integers, then the teacher writes a new equation $ x^2 \plus{} p_2x \plus{} q_2 \equal{} 0,$ where $ p_2$ and $ q_2$ are the solutions of the previous equation taken in some order, and everything starts all over. Find all possible values for $ p_1$ and $ q_1$ such that the teacher can hold Juku at school forever.

Let us name a move of the chess knight horizontal if it moves two cells horizontally and one vertically, and vertical otherwise. It is required to place the knight on a cell of a ${46} \times {46}$ board and alternate horizontal and vertical moves. Prove that if each cell is visited not more than once then the number of moves does not exceed 2024. Alexandr Gribalko

Three lights are placed horizontally on a line on the ceiling. All the lights are initially off. Every second, Neil picks one of the three lights uniformly at random to switch: if it is off, he switches it on; if it is on, he switches it off. When a light is switched, any lights directly to the left or right of that light also get turned on (if they were off) or off (if they were on). The expected number of lights that are on after Neil has flipped switches three times can be expressed in the form $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Compute $m + n$.

In the language of wolves has two letters $F$ and $P$, any finite sequence which forms a word. А word $Y$ is called 'subpart' of word $X$ if Y is obtained from X by deleting some letters (for example, the word $FFPF$ has 8 'subpart's: F, P, FF, FP, PF, FFP, FPF, FFF). Determine $n$ such that the $n$ is the greatest number of 'subpart's can have n-letter word language of wolves. F. Petrov, V. Volkov

Let $M$ be the set of all lattice points in the plane (i.e. points with integer coordinates, in a fixed Cartesian coordinate system). For any point $P=(x,y)\in M$ we call the points $(x-1,y)$, $(x+1,y)$, $(x,y-1)$, $(x,y+1)$ neighbors of $P$. Let $S$ be a finite subset of $M$. A one-to-one mapping $f$ of $S$ onto $S$ is called perfect if $f(P)$ is a neighbor of $P$, for any $P\in S$. Prove that if such a mapping exists, then there exists also a perfect mapping $g:S\to S$ with the additional property $g(g(P))=P$ for $P\in S$.

[b]p1.[/b] Alex and Sam have a friend Pat, who is younger than they are. Alex, Sam and Pat all share a birthday. When Pat was born, Alex’s age times Sam’s age was $42$. Now Pat’s age is $33$ and Alex’s age is a prime number. How old is Sam now? Show your work and justify your answer. (All ages are whole numbers.) [b]p2.[/b] Let $ABCD$ be a square with side length $2$. The four sides of $ABCD$ are diameters of four semicircles, each of which lies inside the square. The set of all points which lie on or inside two of these semicircles is a four petaled flower. Find (with proof) the area of this flower. [img]https://cdn.artofproblemsolving.com/attachments/5/5/bc724b9f74c3470434c322020997a533986d33.png[/img] [b]p3.[/b] A prime number is called [i]strongly prime[/i] if every integer obtained by permuting its digits is also prime. For example $113$ is strongly prime, since $113$, $131$, and $311$ are all prime numbers. Prove that there is no strongly prime number such that each of the digits $1, 3, 7$, and $9$ appears at least once in its decimal representation. [b]p4.[/b] Suppose $n$ is a positive integer. Let an be the number of permutations of $1, 2, . . . , n$, where $i$ is not in the $i$-th position, for all $i$ with $1 \le i \le n$. For example $a_3 = 2$, where the two permutations that are counted are $231$, and $312$. Let bn be the number of permutations of $1, 2, . . . , n$, where no $i$ is followed by $i + 1$, for all $i$ with $1 \le i \le n - 1$. For example $b_3 = 3$, where the three permutations that are counted are $132$, $213$, and $321$. For every $n \ge 1$, find (with proof) a simple formula for $\frac{a_{n+1}}{b_n}$. Your formula should not involve summations. Use your formula to evaluate $\frac{a_{2020}}{b_{2019}}$. [b]p5.[/b] Let $n \ge 2$ be an integer and $a_1, a_2, ... , a_n$ be positive real numbers such that $a_1 + a_2 +... + a_n = 1$. Prove that $$\sum^n_{k=1}\frac{a_k}{1 + a_{k+1} - a_{k-1}}\ge 1.$$ (Here $a_0 = a_n$ and $a_{n+1} = a_1$.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] In a $3$-person race, how many different results are possible if ties are allowed? [b]p2.[/b] An isosceles trapezoid has lengths $5$, $5$, $5$, and $8$. What is the sum of the lengths of its diagonals? [b]p3.[/b] Let $f(x) = (1 + x + x^2)(1 + x^3 + x^6)(1 + x^9 + x^{18})...$. Compute $f(4/5)$. [b]p4.[/b] Compute the largest prime factor of $3^{12} - 1$. [b]p5.[/b] Taren wants to throw a frisbee to David, who starts running perpendicular to the initial line between them at rate $1$ m/s. Taren throws the frisbee at rate $2$ m/s at the same instant David begins to run. At what angle should Taren throw the frisbee? [b]p6.[/b] The polynomial $p(x)$ leaves remainder $6$ when divided by $x-5$, and $5$ when divided by $x-6$. What is the remainder when $p(x)$ is divided by $(x - 5)(x - 6)$? [b]p7.[/b] Find the sum of the cubes of the roots of $x^{10} + x^9 + ... + x + 1 = 0$. [b]p8.[/b] A circle of radius $1$ is inscribed in a the parabola $y = x^2$. What is the $x$-coordinate of the intersection in the first quadrant? [b]p9.[/b] You are stuck in a cave with $3$ tunnels. The first tunnel leads you back to your starting point in $5$ hours, and the second tunnel leads you back there in $7$ hours. The third tunnel leads you out of the cave in $4$ hours. What is the expected number of hours for you to exit the cave, assuming you choose a tunnel randomly each time you come across your point of origin? [b]p10.[/b] What is the minimum distance between the line $y = 4x/7 + 1/5$ and any lattice point in the plane? (lattice points are points with integer coordinates) PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ and $k$ be two integers with $n>k\geqslant 1$. There are $2n+1$ students standing in a circle. Each student $S$ has $2k$ [i]neighbors[/i] - namely, the $k$ students closest to $S$ on the left, and the $k$ students closest to $S$ on the right. Suppose that $n+1$ of the students are girls, and the other $n$ are boys. Prove that there is a girl with at least $k$ girls among her neighbors. [i]Proposed by Gurgen Asatryan, Armenia[/i]

Consider $2009$ cards, each having one gold side and one black side, lying on parallel on a long table. Initially all cards show their gold sides. Two player, standing by the same long side of the table, play a game with alternating moves. Each move consists of choosing a block of $50$ consecutive cards, the leftmost of which is showing gold, and turning them all over, so those which showed gold now show black and vice versa. The last player who can make a legal move wins. (a) Does the game necessarily end? (b) Does there exist a winning strategy for the starting player? [i]Proposed by Michael Albert, Richard Guy, New Zealand[/i]

Let $S=\{1928,1929,1930,\cdots,1949\}.$ We call one of $S$’s subset $M$ is a [i]red[/i] subset, if the sum of any two different elements of $M$ isn’t divided by $4.$ Let $x,y$ be the number of the [i]red[/i] subsets of $S$ with $4$ and $5$ elements,respectively. Determine which of $x,y$ is greater and prove that.

[i]20 problems for 25 minutes.[/i] [b]p1.[/b] Compute the value of $2 + 20 + 201 + 2016$. [b]p2.[/b] Gleb is making a doll, whose prototype is a cube with side length $5$ centimeters. If the density of the toy is $4$ grams per cubic centimeter, compute its mass in grams. [b]p3.[/b] Find the sum of $20\%$ of $16$ and $16\%$ of $20$. [b]p4.[/b] How many times does Akmal need to roll a standard six-sided die in order to guarantee that two of the rolled values sum to an even number? [b]p5.[/b] During a period of one month, there are ten days without rain and twenty days without snow. What is the positive difference between the number of rainy days and the number of snowy days? [b]p6.[/b] Joanna has a fully charged phone. After using it for $30$ minutes, she notices that $20$ percent of the battery has been consumed. Assuming a constant battery consumption rate, for how many additional minutes can she use the phone until $20$ percent of the battery remains? [b]p7.[/b] In a square $ABCD$, points $P$, $Q$, $R$, and $S$ are chosen on sides $AB$, $BC$, $CD$, and $DA$ respectively, such that $AP = 2PB$, $BQ = 2QC$, $CR = 2RD$, and $DS = 2SA$. What fraction of square $ABCD$ is contained within square $PQRS$? [b]p8.[/b] The sum of the reciprocals of two not necessarily distinct positive integers is $1$. Compute the sum of these two positive integers. [b]p9.[/b] In a room of government officials, two-thirds of the men are standing and $8$ women are standing. There are twice as many standing men as standing women and twice as many women in total as men in total. Find the total number of government ocials in the room. [b]p10.[/b] A string of lowercase English letters is called pseudo-Japanese if it begins with a consonant and alternates between consonants and vowels. (Here the letter "y" is considered neither a consonant nor vowel.) How many $4$-letter pseudo-Japanese strings are there? [b]p11.[/b] In a wooden box, there are $2$ identical black balls, $2$ identical grey balls, and $1$ white ball. Yuka randomly draws two balls in succession without replacement. What is the probability that the first ball is strictly darker than the second one? [b]p12.[/b] Compute the real number $x$ for which $(x + 1)^2 + (x + 2)^2 + (x + 3)^2 = (x + 4)^2 + (x + 5)^2 + (x + 6)^2$. [b]p13.[/b] Let $ABC$ be an isosceles right triangle with $\angle C = 90^o$ and $AB = 2$. Let $D$, $E$, and $F$ be points outside $ABC$ in the same plane such that the triangles $DBC$, $AEC$, and $ABF$ are isosceles right triangles with hypotenuses $BC$, $AC$, and $AB$, respectively. Find the area of triangle $DEF$. [b]p14.[/b] Salma is thinking of a six-digit positive integer $n$ divisible by $90$. If the sum of the digits of n is divisible by $5$, find $n$. [b]p15.[/b] Kiady ate a total of $100$ bananas over five days. On the ($i + 1$)-th day ($1 \le i \le 4$), he ate i more bananas than he did on the $i$-th day. How many bananas did he eat on the fifth day? [b]p16.[/b] In a unit equilateral triangle $ABC$; points $D$,$E$, and $F$ are chosen on sides $BC$, $CA$, and $AB$, respectively. If lines $DE$, $EF$, and $FD$ are perpendicular to $CA$, $AB$ and $BC$, respectively, compute the area of triangle $DEF$. [b]p17.[/b] Carlos rolls three standard six-sided dice. What is the probability that the product of the three numbers on the top faces has units digit 5? [b]p18.[/b] Find the positive integer $n$ for which $n^{n^n}= 3^{3^{82}}$. [b]p19.[/b] John folds a rope in half five times then cuts the folded rope with four knife cuts, leaving five stacks of rope segments. How many pieces of rope does he now have? [b]p20.[/b] An integer $n > 1$ is conglomerate if all positive integers less than n and relatively prime to $n$ are not composite. For example, $3$ is conglomerate since $1$ and $2$ are not composite. Find the sum of all conglomerate integers less than or equal to $200$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$A$ and $B$ are any two subsets of $\{1, 2,...,n - 1\}$ such that $|A| +|B|> n - 1$. Prove that one can find $a$ in $A$ and $b$ in $B$ such that $a + b = n$.

Two people $A$ and $B$ play the following game: They take from $\{0, 1, 2, 3,..., 1024\}$ alternately $512$, $256$, $128$, $64$, $32$, $16$, $8$, $4$, $2$, $1$, numbers away where $A$ first removes $512$ numbers, $B$ removes $256$ numbers etc. Two numbers $a, b$ remain ($a < b$). $B$ pays $A$ the amount $b - a$. $A$ would like to win as much as possible, $B$ would like to lose as little as possible. What profit does $A$ make if does every player play optimally according to their goals? The result must be justified.

How many integers are there in $\{0,1, 2,..., 2014\}$ such that $C^x_{2014} \ge C^{999}{2014}$ ? (A): $15$, (B): $16$, (C): $17$, (D): $18$, (E) None of the above. Note: $C^{m}_{n}$ stands for $\binom {m}{n}$

2500 chess kings have to be placed on a $100 \times 100$ chessboard so that [b](i)[/b] no king can capture any other one (i.e. no two kings are placed in two squares sharing a common vertex); [b](ii)[/b] each row and each column contains exactly 25 kings. Find the number of such arrangements. (Two arrangements differing by rotation or symmetry are supposed to be different.) [i]Proposed by Sergei Berlov, Russia[/i]