Given points $A, M, M_1$ and rational number $\lambda \neq -1$. Construct the triangle $ABC$, such that $M$ lies on $BC$ and $M_1$ lies on $B_1C_1$ ($B_1, C_1$ are the projections of $B, C$ on $AC, AB$ respectively), and $\frac{BM}{MC}=\frac{B_1M_1}{M_1C_1}=\lambda.$

Given a finite set of points in the plane, each with integer coordinates, is it always possible to color the points red or white so that for any straight line $L$ parallel to one of the coordinate axes the difference (in absolute value) between the numbers of white and red points on $L$ is not greater than $1$?

[b]p1.[/b] An $18$oz glass of apple juice is $6\%$ sugar and a $6$oz glass of orange juice is $12\%$ sugar. The two glasses are poured together to create a cocktail. What percent of the cocktail is sugar? [b]p2.[/b] Find the number of positive numbers that can be expressed as the difference of two integers between $-2$ and $2012$ inclusive. [b]p3.[/b] An annulus is defined as the region between two concentric circles. Suppose that the inner circle of an annulus has radius $2$ and the outer circle has radius $5$. Find the probability that a randomly chosen point in the annulus is at most $3$ units from the center. [b]p4.[/b] Ben and Jerry are walking together inside a train tunnel when they hear a train approaching. They decide to run in opposite directions, with Ben heading towards the train and Jerry heading away from the train. As soon as Ben finishes his $1200$ meter dash to the outside, the front of the train enters the tunnel. Coincidentally, Jerry also barely survives, with the front of the train exiting the tunnel as soon as he does. Given that Ben and Jerry both run at $1/9$ of the train’s speed, how long is the tunnel in meters? [b]p5.[/b] Let $ABC$ be an isosceles triangle with $AB = AC = 9$ and $\angle B = \angle C = 75^o$. Let $DEF$ be another triangle congruent to $ABC$. The two triangles are placed together (without overlapping) to form a quadrilateral, which is cut along one of its diagonals into two triangles. Given that the two resulting triangles are incongruent, find the area of the larger one. [b]p6.[/b] There is an infinitely long row of boxes, with a Ditto in one of them. Every minute, each existing Ditto clones itself, and the clone moves to the box to the right of the original box, while the original Ditto does not move. Eventually, one of the boxes contains over $100$ Dittos. How many Dittos are in that box when this first happens? [b]p7.[/b] Evaluate $$26 + 36 + 998 + 26 \cdot 36 + 26 \cdot 998 + 36 \cdot 998 + 26 \cdot 36 \cdot 998.$$ [b]p8. [/b]There are $15$ students in a school. Every two students are either friends or not friends. Among every group of three students, either all three are friends with each other, or exactly one pair of them are friends. Determine the minimum possible number of friendships at the school. [b]p9.[/b] Let $f(x) = \sqrt{2x + 1 + 2\sqrt{x^2 + x}}$. Determine the value of $$\frac{1}{f(1)}+\frac{1}{f(1)}+\frac{1}{f(3)}+...+\frac{1}{f(24)}.$$ [b]p10.[/b] In square $ABCD$, points $E$ and $F$ lie on segments $AD$ and $CD$, respectively. Given that $\angle EBF = 45^o$, $DE = 12$, and $DF = 35$, compute $AB$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A collection of $n$ squares on the plane is called tri-connected if the following criteria are satisfied: (i) All the squares are congruent. (ii) If two squares have a point $P$ in common, then $P$ is a vertex of each of the squares. (iii) Each square touches exactly three other squares. How many positive integers $n$ are there with $2018\leq n \leq 3018$, such that there exists a collection of $n$ squares that is tri-connected?

Suppose there are $m$ Martians and $n$ Earthlings at an intergalactic peace conference. To ensure the Martians stay peaceful at the conference, we must make sure that no two Martians sit together, such that between any two Martians there is always at least one Earthling. (a) Suppose all $m + n$ Martians and Earthlings are seated in a line. How many ways can the Earthlings and Martians be seated in a line? (b) Suppose now that the $m+n$ Martians and Earthlings are seated around a circular round-table. How many ways can the Earthlings and Martians be seated around the round-table?

Let $n$ be a positive integer. $n$ people take part in a certain party. For any pair of the participants, either the two are acquainted with each other or they are not. What is the maximum possible number of the pairs for which the two are not acquainted but have a common acquaintance among the participants?

The numbers from $1$ to $2017$ are written on a board. Deka and Farid play the following game : each of them, on his turn, erases one of the numbers. Anyone who erases a multiple of $2, 3$ or $5$ loses and the game is over. Is there a winning strategy for Deka ?

There are $2000$ components in a circuit, every two of which were initially joined by a wire. The hooligans Vasya and Petya cut the wires one after another. Vasya, who starts, cuts one wire on his turn, while Petya cuts two or three. The hooligan who cuts the last wire from some component loses. Who has the winning strategy?

2. Each of $n$ members of a club is given a different item of information. The members are allowed to share the information, but, for security reasons, only in the following way: A pair may communicate by telephone. During a telephone call only one member may speak. The member who speaks may tell the other member all the information (s)he knows. Determine the minimal number of phone calls that are required to convey all the information to each of the members. Hi, from my sketches I'm thinking the answer is $2n-2$ but I dont know how to prove that this number of calls is the smallest. Can anyone enlighten me? Thanks

A boy and a girl were sitting on a long bench. Then twenty more children one after another came to sit on the bench, each taking a place between already sitting children. Let us call a girl brave if she sat down between two boys, and let us call a boy brave if he sat down between two girls. It happened, that in the end all girls and boys were sitting in the alternating order. Is it possible to uniquely determine the number of brave children?

There are 2019 students in a school, and some of these students are members of different student clubs. Each student club has an advisory board consisting of 12 students who are members of that particular club. An {\em advisory meeting} (for a particular club) can be realized only when each participant is a member of that club, and moreover, each of the 12 students forming the advisory board are present among the participants. It is known that each subset of at least 12 students in this school can realize an advisory meeting for exactly one student club. Determine all possible numbers of different student clubs with exactly 27 members.

In a $2 \times 8$ squared board, you want to color each square red or blue in such a way that on each $2 \times 2$ sub-board there are at least $3$ boxes painted blue. In how many ways can this coloring be done? Note. A $2 \times 2$ board is a square made up of $4$ squares that have a common vertex.

Cut off a square carton by a straight line into two pieces, then cut one of two pieces into two small pieces by a straight line, ect. By cutting $2017$ times we obtain $2018$ pieces. We write number $2$ in every triangle, number 1 in every quadrilateral, and $0$ in the polygons. Is the sum of all inserted numbers always greater than $2017$?

As in the picture below, the rectangle on the left hand side has been divided into four parts by line segments which are parallel to a side of the rectangle. The areas of the small rectangles are $A,B,C$ and $D$. Similarly, the small rectangles on the right hand side have areas $A^\prime,B^\prime,C^\prime$ and $D^\prime$. It is known that $A\leq A^\prime$, $B\leq B^\prime$, $C\leq C^\prime$ but $D\leq B^\prime$. [asy] import graph; size(12cm); real lsf=0.5; pen dps=linewidth(0.7)+fontsize(10); defaultpen(dps); pen ds=black; real xmin=-4.3,xmax=12.32,ymin=-10.68,ymax=6.3; draw((0,3)--(0,0)); draw((3,0)--(0,0)); draw((3,0)--(3,3)); draw((0,3)--(3,3)); draw((2,0)--(2,3)); draw((0,2)--(3,2)); label("$A$",(0.86,2.72),SE*lsf); label("$B$",(2.38,2.7),SE*lsf); label("$C$",(2.3,1.1),SE*lsf); label("$D$",(0.82,1.14),SE*lsf); draw((5,2)--(11,2)); draw((5,2)--(5,0)); draw((11,0)--(5,0)); draw((11,2)--(11,0)); draw((8,0)--(8,2)); draw((5,1)--(11,1)); label("$A'$",(6.28,1.8),SE*lsf); label("$B'$",(9.44,1.82),SE*lsf); label("$C'$",(9.4,0.8),SE*lsf); label("$D'$",(6.3,0.86),SE*lsf); dot((0,3),linewidth(1pt)+ds); dot((0,0),linewidth(1pt)+ds); dot((3,0),linewidth(1pt)+ds); dot((3,3),linewidth(1pt)+ds); dot((2,0),linewidth(1pt)+ds); dot((2,3),linewidth(1pt)+ds); dot((0,2),linewidth(1pt)+ds); dot((3,2),linewidth(1pt)+ds); dot((5,0),linewidth(1pt)+ds); dot((5,2),linewidth(1pt)+ds); dot((11,0),linewidth(1pt)+ds); dot((11,2),linewidth(1pt)+ds); dot((8,0),linewidth(1pt)+ds); dot((8,2),linewidth(1pt)+ds); dot((5,1),linewidth(1pt)+ds); dot((11,1),linewidth(1pt)+ds); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); [/asy] Prove that the big rectangle on the left hand side has area smaller or equal to the area of the big rectangle on the right hand side, i.e. $A+B+C+D\leq A^\prime+B^\prime+C^\prime+D^\prime$.

There are $n$ instruments in the laboratory, each two of them can be connected with a wire. Moreover, if four devices $A, B, C, D$, are such that wires of $AB$, $BC$ and $CD$ are connected but there is no connected pair between $CA$, $AD$ and $DB$, a collapse occurs. A professor invented a wiring diagram that does not collapse. Coming to the laboratory, he found that the collapse has not yet occurred, but the devices are connected not according to his scheme. Prove that he can implement his scheme, each time connecting or disconnecting a pair of devices, so that the collapse won’t happen anytime.

Determine whether there exists an arithimethical progression consisting of 40 terms and each of whose terms can be written in the form $ 2^m \plus{} 3^n$ or not. where $ m,n$ are nonnegative integers.

A cricket wants to move across a $2n \times 2n$ board that is entirely covered by dominoes, with no overlap. He jumps along the vertical lines of the board, always going from the midpoint of the vertical segment of a $1 \times 1$ square to another midpoint of the vertical segment, according to the rules: $(i)$ When the domino is horizontal, the cricket jumps to the opposite vertical segment (such as from $P_2$ to $P_3$); $(ii)$ When the domino is vertical downwards in relation to its position, the cricket jumps diagonally downwards (such as from $P_1$ to $P_2$); $(iii)$ When the domino is vertically upwards relative to its position, the cricket jumps diagonally upwards (such as from $P_3$ to $P_4$). The image illustrates a possible covering and path on the $4 \times 4$ board. Considering that the starting point is on the first vertical line and the finishing point is on the last vertical line, prove that, regardless of the covering of the board and the height at which the cricket starts its path, the path ends at the same initial height.

The set $S = \{ (a,b) \mid 1 \leq a, b \leq 5, a,b \in \mathbb{Z}\}$ be a set of points in the plane with integeral coordinates. $T$ is another set of points with integeral coordinates in the plane. If for any point $P \in S$, there is always another point $Q \in T$, $P \neq Q$, such that there is no other integeral points on segment $PQ$. Find the least value of the number of elements of $T$.

$1956$ points are chosen in a cube with edge $13$. Is it possible to fit inside the cube a cube with edge $1$ that would not contain any of the selected points?

Is it possible to divide the plane into polygons so that each polygon is transformed into itself under some rotation by $360/7$ degrees about some point? All sides of these polygons must be greater than $1$ cm. (A polygon is the part of a plane bounded by one non-self-intersect-ing closed broken line, not necessarily convex.) (A. Andjans, Riga)

Reimu has a wooden cube. In each step, she creates a new polyhedron from the previous one by cutting off a pyramid from each vertex of the polyhedron along a plane through the trisection point on each adjacent edge that is closer to the vertex. For example, the polyhedron after the first step has six octagonal faces and eight equilateral triangular faces. How many faces are on the polyhedron after the fifth step?

Suppose that n numbers $x_1, x_2, . . . , x_n$ are chosen randomly from the set $\{1, 2, 3, 4, 5\}$. Prove that the probability that $x_1^2+ x_2^2 +\cdots+ x_n^2 \equiv 0 \pmod 5$ is at least $\frac 15.$

[i]20 problems for 25 minutes.[/i] [b]p1.[/b] What is $2018 - 3018 + 4018$? [b]p2.[/b] What is the smallest integer greater than $100$ that is a multiple of both $6$ and $8$? [b]p3.[/b] What positive real number can be expressed as both $\frac{b}{a}$ and $a:b$ in base $10$ for nonzero digits $a$ and $b$? Express your answer as a decimal. [b]p4.[/b] A non-degenerate triangle has sides of lengths $1$, $2$, and $\sqrt{n}$, where $n$ is a positive integer. How many possible values of $n$ are there? [b]p5.[/b] When three integers are added in pairs, and the results are $20$, $18$, and $x$. If all three integers sum to $31$, what is $x$? [b]p6.[/b] A cube's volume in cubic inches is numerically equal to the sum of the lengths of all its edges, in inches. Find the surface area of the cube, in square inches. [b]p7.[/b] A $12$ hour digital clock currently displays$ 9 : 30$. Ignoring the colon, how many times in the next hour will the clock display a palindrome (a number that reads the same forwards and backwards)? [b]p8.[/b] SeaBay, an online grocery store, offers two different types of egg cartons. Small egg cartons contain $12$ eggs and cost $3$ dollars, and large egg cartons contain $18$ eggs and cost $4$ dollars. What is the maximum number of eggs that Farmer James can buy with $10$ dollars? [b]p9.[/b] What is the sum of the $3$ leftmost digits of $\underbrace{999...9}_{2018\,\,\ 9' \,\,s}\times 12$? [b]p10.[/b] Farmer James trisects the edges of a regular tetrahedron. Then, for each of the four vertices, he slices through the plane containing the three trisection points nearest to the vertex. Thus, Farmer James cuts off four smaller tetrahedra, which he throws away. How many edges does the remaining shape have? [b]p11.[/b] Farmer James is ordering takeout from Kristy's Krispy Chicken. The base cost for the dinner is $\$14.40$, the sales tax is $6.25\%$, and delivery costs $\$3.00$ (applied after tax). How much did Farmer James pay, in dollars? [b]p12.[/b] Quadrilateral $ABCD$ has $ \angle ABC = \angle BCD = \angle BDA = 90^o$. Given that $BC = 12$ and $CD = 9$, what is the area of $ABCD$? [b]p13.[/b] Farmer James has $6$ cards with the numbers $1-6$ written on them. He discards a card and makes a $5$ digit number from the rest. In how many ways can he do this so that the resulting number is divisible by $6$? [b]p14.[/b] Farmer James has a $5 \times 5$ grid of points. What is the smallest number of triangles that he may draw such that each of these $25$ points lies on the boundary of at least one triangle? [b]p15.[/b] How many ways are there to label these $15$ squares from $1$ to $15$ such that squares $1$ and $2$ are adjacent, squares $2$ and $3$ are adjacent, and so on? [img]https://cdn.artofproblemsolving.com/attachments/e/a/06dee288223a16fbc915f8b95c9e4f2e4e1c1f.png[/img] [b]p16.[/b] On Farmer James's farm, there are three henhouses located at $(4, 8)$, $(-8,-4)$, $(8,-8)$. Farmer James wants to place a feeding station within the triangle formed by these three henhouses. However, if the feeding station is too close to any one henhouse, the hens in the other henhouses will complain, so Farmer James decides the feeding station cannot be within 6 units of any of the henhouses. What is the area of the region where he could possibly place the feeding station? [b]p17.[/b] At Eggs-Eater Academy, every student attends at least one of $3$ clubs. $8$ students attend frying club, $12$ students attend scrambling club, and $20$ students attend poaching club. Additionally, $10$ students attend at least two clubs, and $3$ students attend all three clubs. How many students are there in total at Eggs-Eater Academy? [b]p18.[/b] Let $x, y, z$ be real numbers such that $8^x = 9$, $27^y = 25$, and $125^z = 128$. What is the value of $xyz$? [b]p19.[/b] Let $p$ be a prime number and $x, y$ be positive integers. Given that $9xy = p(p + 3x + 6y)$, find the maximum possible value of $p^2 + x^2 + y^2$. [b]p20.[/b] Farmer James's hens like to drop eggs. Hen Hao drops $6$ eggs uniformly at random in a unit square. Farmer James then draws the smallest possible rectangle (by area), with sides parallel to the sides of the square, that contain all $6$ eggs. What is the probability that at least one of the $6$ eggs is a vertex of this rectangle? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $E$ be a finite set, $P_E$ the family of its subsets, and $f$ a mapping from $P_E$ to the set of non-negative reals, such that for any two disjoint subsets $A,B$ of $E$, $f(A\cup B)=f(A)+f(B)$. Prove that there exists a subset $F$ of $E$ such that if with each $A \subset E$, we associate a subset $A'$ consisting of elements of $A$ that are not in $F$, then $f(A)=f(A')$ and $f(A)$ is zero if and only if $A$ is a subset of $F$.

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