In an apartment block there live only couples of parents with children. It is known that every couple has at least one child, that every child has exactly two parents, that every little boy in this building has a sister, and that among the children there are more boys than girls. You may also assume that there are no grandparents living in the building. Is it possible that there are more parents than children in the building? Explain your reasoning.

How many possible arrangements of bishops are there on a $8 \times 8$ chessboard such that no bishop threatens a square on which another lies and the maximum number of bishops are used? (Note that a bishop threatens any square along a diagonal containing its square.)

With $21$ pieces, some white and some black, a rectangle is formed of $3 \times 7$. Prove that there are always four pieces of the same color located at the vertices of a rectangle.

Integers $1$ to $36$ are written in each "Neuro-Millions" bulletin. A bet on "Neuro-Millions" consists of choosing $6$ of these $36$ numbers. Then, $6$ numbers between $1$ and $36$ are drawn, and these constitute the key to "Neuro-Milh˜oes". A bet is awarded if it does not contain any of the key numbers. How many bets, at least, are necessary to guarantee a prize?

The circle contains a closed $100$-part broken line, such that no three segments pass through one point. All its corners are obtuse, and their sum in degrees is divided by $720$. Prove that this broken line has an odd number of self-intersection points.

Ten million fireflies are glowing in $\mathbb{R}^3$ at midnight. Some of the fireflies are friends, and friendship is always mutual. Every second, one firefly moves to a new position so that its distance from each one of its friends is the same as it was before moving. This is the only way that the fireflies ever change their positions. No two fireflies may ever occupy the same point. Initially, no two fireflies, friends or not, are more than a meter away. Following some finite number of seconds, all fireflies find themselves at least ten million meters away from their original positions. Given this information, find the greatest possible number of friendships between the fireflies. [i]Nikolai Beluhov[/i]

In how many ways rooks can be placed on a $8$ by $8$ chess board such that every row and every column has at least one rook? (Any number of rooks are available,each square can have at most one rook and there is no relation of attacking between them)

Consider $2011^2$ points arranged in the form of a $2011 \times 2011$ grid. What is the maximum number of points that can be chosen among them so that no four of them form the vertices of either an isosceles trapezium or a rectangle whose parallel sides are parallel to the grid lines?

All the chairs in a classroom are arranged in a square $n\times n$ array (in other words, $n$ columns and $n$ rows), and every chair is occupied by a student. The teacher decides to rearrange the students according to the following two rules: (a) Every student must move to a new chair. (b) A student can only move to an adjacent chair in the same row or to an adjacent chair in the same column. In other words, each student can move only one chair horizontally or vertically. (Note that the rules above allow two students in adjacent chairs to exchange places.) Show that this procedure can be done if $n$ is even, and cannot be done if $n$ is odd.

Jason and Valerie agree to meet for game night, which runs from $4:00$ PM to $5:00$ PM. Jason and Valerie each choose a random time from $4:00$ PM to $5:00$ PM to show up. If Jason arrives first, he will wait $20$ minutes for Valerie before leaving. If Valerie arrives first, she will wait $10$ minutes for Jason before leaving. What is the probability that Jason and Valerie successfully meet each other for game night?

A $\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and $$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$

The deputies in a parliament were split into $10$ fractions. According to regulations, no fraction may consist of less than five people, and no two fractions may have the same number of members. After the vacation, the fractions disintegrated and several new fractions arose instead. Besides, some deputies became independent. It turned out that no two deputies that were in the same fraction before the vacation entered the same fraction after the vacation. Find the smallest possible number of independent deputies after the vacation.

Lucy starts by writing $s$ integer-valued $2022$-tuples on a blackboard. After doing that, she can take any two (not necessarily distinct) tuples $\mathbf{v}=(v_1,\ldots,v_{2022})$ and $\mathbf{w}=(w_1,\ldots,w_{2022})$ that she has already written, and apply one of the following operations to obtain a new tuple: \begin{align*} \mathbf{v}+\mathbf{w}&=(v_1+w_1,\ldots,v_{2022}+w_{2022}) \\ \mathbf{v} \lor \mathbf{w}&=(\max(v_1,w_1),\ldots,\max(v_{2022},w_{2022})) \end{align*} and then write this tuple on the blackboard. It turns out that, in this way, Lucy can write any integer-valued $2022$-tuple on the blackboard after finitely many steps. What is the smallest possible number $s$ of tuples that she initially wrote?

Smallville is populated by unmarried men and women, some of them are acquainted. Two city’s matchmakers are aware of all acquaintances. Once, one of matchmakers claimed: “I could arrange that every brunette man would marry a woman he was acquainted with”. The other matchmaker claimed “I could arrange that every blonde woman would marry a man she was acquainted with”. An amateur mathematician overheard their conversation and said “Then both arrangements could be done at the same time! ” Is he right?

$n$ is a given positive integer, such that it’s possible to weigh out the mass of any product weighing $1,2,3,\cdots ,ng$ with a counter balance without sliding poise and $k$ counterweights, which weigh $x_ig(i=1,2,\cdots ,k),$ respectively, where $x_i\in \mathbb{N}^*$ for any $i \in \{ 1,2,\cdots ,k\}$ and $x_1\leq x_2\leq\cdots \leq x_k.$ $(1)$Let $f(n)$ be the least possible number of $k$. Find $f(n)$ in terms of $n.$ $(2)$Find all possible number of $n,$ such that sequence $x_1,x_2,\cdots ,x_{f(n)}$ is uniquely determined.

A school has three senior classes of $M$ students each. Every student knows at least $\frac{3}{4}M$ people in each of the other two classes. Prove that the school can send $M$ non-intersecting teams to the olympiad so that each team consists of $3$ students from different classes who know each other. [i]Proposed by C. Magyar, R. Martin[/i]

Given are two sets of positive numbers with the same sum. The first set has $m$ numbers and the second $n$. Prove that you can find a set of less than $m+n$ positive numbers which can be arranged to part fill an $m \times n$ array, so that the row and column sums are the two given sets.

Alice is wandering in the country of Wanderland. Wanderland consists of a finite number of cities, some of which are connected by two-way trains, such that Wanderland is connected: given any two cities, there is always a way to get from one to the other through a series of train rides. Alice starts at Riverbank City and wants to end up at Conscious City. Every day, she picks a train going out of the city she is in uniformly at random among all of the trains, and then boards that train to the city it leads to. Show that the expected number of days it takes for her to reach Conscious City is finite.

There are $n > 1$ points on the plane. Two take turns connecting more an unconnected pair of points by a vector of one of two possible directions. If after the next move of a player the sum of all drawn vectors is zero, then the second one wins; if it's another move is impossible, and there was no zero sum, then the first one wins. Who wins when played correctly?

Ninety-nine points are given on one of the diagonals of a unit square. Prove that there is at most one vertex of the square such that the average squared distance from a given point to the vertex is less than or equal to $1/2$.

There is a row with $2024$ cells. Ana and Beto take turns playing, with Ana going first. On each turn, the player selects an empty cell and places a digit in that space. Once all $2024$ cells are filled, the number obtained from reading left to right is considered, ignoring any leading zeros. Beto wins if the resulting number is a multiple of $99$, otherwise Ana wins. Determine which of the two players has a winning strategy and describe it.

Let $n$ be a positive integer. We start with $n$ piles of pebbles, each initially containing a single pebble. One can perform moves of the following form: choose two piles, take an equal number of pebbles from each pile and form a new pile out of these pebbles. Find (in terms of $n$) the smallest number of nonempty piles that one can obtain by performing a finite sequence of moves of this form.

300 bureaucrats are split into three comissions of 100 people. Each two bureaucrats are either familiar to each other or non familiar to each other. Prove that there exists two bureaucrats from two distinct commissions such that the third commission contains either 17 bureaucrats familiar to both of them, or 17 bureaucrats familiar to none of them. _________________________________________ This problem is taken from Russian Olympiad 2007-2008 district round 9.8 $ Tipe$

[i]25 problems for 30 minutes[/i] [b]p1.[/b] Compute the sum $2019 + 201 + 20 + 2$. [b]p2.[/b] The sequence $100, 102, 104,..., 996$ and $998$ is the sequence of all three-digit even numbers. How many three digit even numbers are there? [b]p3.[/b] Find the units digit of $25\times 37\times 113\times 22$. [b]p4.[/b] Samuel has a number in his head. He adds $4$ to the number and then divides the result by $2$. After doing this, he ends up with the same number he had originally. What is his original number? [b]p5.[/b] According to Shay's Magazine, every third president is terrible (so the third, sixth, ninth president and so on were all terrible presidents). If there have been $44$ presidents, how many terrible presidents have there been in total? [b]p6.[/b] In the game Tic-Tac-Toe, a player wins by getting three of his or her pieces in the same row, column, or diagonal of a $3\times 3$ square. How many configurations of $3$ pieces are winning? Rotations and reflections are considered distinct. [b]p7.[/b] Eddie is a sad man. Eddie is cursed to break his arm $4$ times every $20$ years. How many times would he break his arm by the time he reaches age $100$? [b]p8. [/b]The figure below is made from $5$ congruent squares. If the figure has perimeter $24$, what is its area? [img]https://cdn.artofproblemsolving.com/attachments/1/9/6295b26b1b09cacf0c32bf9d3ba3ce76ddb658.png[/img] [b]p9.[/b] Sancho Panza loves eating nachos. If he eats $3$ nachos during the first minute, $4$ nachos during the second, $5$ nachos during the third, how many nachos will he have eaten in total after $15$ minutes? [b]p10.[/b] If the day after the day after the day before Wednesday was two days ago, then what day will it be tomorrow? [b]p11.[/b] Neetin the Rabbit and Poonam the Meerkat are in a race. Poonam can run at $10$ miles per hour, while Neetin can only hop at $2$ miles per hour. If Neetin starts the race $2$ miles ahead of Poonam, how many minutes will it take for Poonam to catch up with him? [b]p12.[/b] Dylan has a closet with t-shirts: $3$ gray, $4$ blue, $2$ orange, $7$ pink, and $2$ black. Dylan picks one shirt at random from his closet. What is the probability that Dylan picks a pink or a gray t-shirt? [b]p13.[/b] Serena's brain is $200\%$ the size of Eric's brain, and Eric's brain is $200\%$ the size of Carlson's. The size of Carlson's brain is what percent the size of Serena's? [b]p14.[/b] Find the sum of the coecients of $(2x + 1)^3$ when it is fully expanded. [b]p15. [/b]Antonio loves to cook. However, his pans are weird. Specifically, the pans are rectangular prisms without a top. What is the surface area of the outside of one of Antonio's pans if their volume is $210$, and their length and width are $6$ and $5$, respectively? [b]p16.[/b] A lattice point is a point on the coordinate plane with $2$ integer coordinates. For example, $(3, 4)$ is a lattice point since $3$ and $4$ are both integers, but $(1.5, 2)$ is not since $1.5$ is not an integer. How many lattice points are on the graph of the equation $x^2 + y^2 = 625$? [b]p17.[/b] Jonny has a beaker containing $60$ liters of $50\%$ saltwater ($50\%$ salt and $50\%$ water). Jonny then spills the beaker and $45$ liters pour out. If Jonny adds $45$ liters of pure water back into the beaker, what percent of the new mixture is salt? [b]p18.[/b] There are exactly 25 prime numbers in the set of positive integers between $1$ and $100$, inclusive. If two not necessarily distinct integers are randomly chosen from the set of positive integers from $1$ to $100$, inclusive, what is the probability that at least one of them is prime? [b]p19.[/b] How many consecutive zeroes are at the end of $12!$ when it is expressed in base $6$? [b]p20.[/b] Consider the following figure. How many triangles with vertices and edges from the following figure contain exactly $1$ black triangle? [img]https://cdn.artofproblemsolving.com/attachments/f/2/a1c400ff7d06b583c1906adf8848370e480895.png[/img] [b]p21.[/b] After Akshay got kicked o the school bus for rowdy behavior, he worked out a way to get home from school with his dad. School ends at $2:18$ pm, but since Akshay walks slowly he doesn't get to the front door until $2:30$. His dad doesn't like to waste time, so he leaves home everyday such that he reaches the high school at exactly $2:30$ pm, instantly picks up Akshay and turns around, then drives home. They usually get home at $3:30$ pm. However, one day Akshay left school early at exactly $2:00$ pm because he was expelled. Trying to delay telling his dad for as long as possible, Akshay starts jogging home. His dad left home at the regular time, saw Akshay on the way, picked him up and turned around instantly. They then drove home while Akshay's dad yelled at him for being a disgrace. They reached home at $3:10$ pm. How long had Akshay been walking before his dad picked him up? [b]p22.[/b] In quadrilateral $ABCD$, diagonals $AC$ and $BD$ intersect at $O$. Then $\angle BOC = \angle BCD$, $\angle COD =\angle BAD$, $AB = 4$, $DC = 6$, and $BD = 5$. What is the length of $BO$? [b]p23.[/b] A standard six-sided die is rolled. The number that comes up first determines the number of additional times the die will be rolled (so if the first number is $3$, then the die will be rolled $3$ more times). Each time the die is rolled, its value is recorded. What is the expected value of the sum of all the rolls? [b]p24.[/b] Dora has a peculiar calculator that can only perform $2$ operations: either adding $1$ to the current number or squaring the current number. Each minute, Dora randomly chooses an operation to apply to her number. She starts with $0$. What is the expected number of minutes it takes Dora's number to become greater than or equal to $10$? [b]p25.[/b] Let $\vartriangle ABC$ be such that $AB = 2$, $BC = 1$, and $\angle ACB = 90^o$. Let points $D$ and $E$ be such that $\vartriangle ADE$ is equilateral, $D$ is on segment $\overline{BC}$, and $D$ and $E$ are not on the same side of $\overline{AC}$. Segment $\overline{BE}$ intersects the circumcircle of $\vartriangle ADE$ at a second point $F$. If $BE =\sqrt{6}$, find the length of $\overline{BF}$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Kelvin the Frog is hopping on a number line (extending to infinity in both directions). Kelvin starts at $0$. Every minute, he has a $\frac{1}{3}$ chance of moving $1$ unit left, a $\frac{1}{3}$ chance of moving $1$ unit right, and $\frac{1}{3}$ chance of getting eaten. Find the expected number of times Kelvin returns to $0$ (not including the start) before he gets eaten.