Find the self-intersection index of the surface $x^4+y^4=1$ in the projective plane $\text{CP}^2$.

[u]Round 1[/u] [b]p1.[/b] Five children, Aisha, Baesha, Cosha, Dasha, and Erisha, competed in running, jumping, and throwing. In each event, first place was won by someone from Renton, second place by someone from Seattle, and third place by someone from Tacoma. Aisha was last in running, Cosha was last in jumping, and Erisha was last in throwing. Could Baesha and Dasha be from the same city? [b]p2.[/b] Fifty-five Brits and Italians met in a coffee shop, and each of them ordered either coffee or tea. Brits tell the truth when they drink tea and lie when they drink coffee; Italians do it the other way around. A reporter ran a quick survey: Forty-four people answered “yes” to the question, “Are you drinking coffee?” Thirty-three people answered “yes” to the question, “Are you Italian?” Twenty-two people agreed with the statement, “It is raining outside.” How many Brits in the coffee shop are drinking tea? [b]p3.[/b] Doctor Strange is lost in a strange house with a large number of identical rooms, connected to each other in a loop. Each room has a light and a switch that could be turned on and off. The lights might initially be on in some rooms and off in others. How can Dr. Strange determine the number of rooms in the house if he is only allowed to switch lights on and off? [b]p4.[/b] Fifty street artists are scheduled to give solo shows with three consecutive acts: juggling, drumming, and gymnastics, in that order. Each artist will spend equal time on each of the three activities, but the lengths may be different for different artists. At least one artist will be drumming at every moment from dawn to dusk. A new law was just passed that says two artists may not drum at the same time. Show that it is possible to cancel some of the artists' complete shows, without rescheduling the rest, so that at least one show is going on at every moment from dawn to dusk, and the schedule complies with the new law. [b]p5.[/b] Alice and Bob split the numbers from $1$ to $12$ into two piles with six numbers in each pile. Alice lists the numbers in the first pile in increasing order as $a_1 < a_2 < a_3 < a_4 < a_5 < a_6$ and Bob lists the numbers in the second pile in decreasing order $b_1 > b_1 > b_3 > b_4 > b_5 > b_6$. Show that no matter how they split the numbers, $$|a_1 -b_1| + |a_2 -b_2| + |a_3 -b_3| + |a_4 -b_4| + |a_5 -b_5| + |a_6 -b_6| = 36.$$ [u]Round 2[/u] [b]p6.[/b] The Martian alphabet has ? letters. Marvin writes down a word and notices that within every sub-word (a contiguous stretch of letters) at least one letter occurs an odd number of times. What is the length of the longest possible word he could have written? [b]p7.[/b] For a long space journey, two astronauts with compatible personalities are to be selected from $24$ candidates. To find a good fit, each candidate was asked $24$ questions that required a simple yes or no answer. Two astronauts are compatible if exactly $12$ of their answers matched (that is, both answered yes or both answered no). Miraculously, every pair of these $24$ astronauts was compatible! Show that there were exactly $12$ astronauts whose answer to the question “Can you repair a flux capacitor?” was exactly the same as their answer to the question “Are you afraid of heights?” (that is, yes to both or no to both). PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $D,E,F$ be points on the sides $BC,CA,AB$ of a triangle $ABC$, respectively. Suppose $AD, BE,CF$ are concurrent at $P$. If $PF/PC =2/3, PE/PB = 2/7$ and $PD/PA = m/n$, where $m, n$ are positive integers with $gcd(m, n) = 1$, find $m + n$.

David, Hikmet, Jack, Marta, Rand, and Todd were in a $12$-person race with $6$ other people. Rand finished $6$ places ahead of Hikmet. Marta finished $1$ place behind Jack. David finished $2$ places behind Hikmet. Jack finished $2$ places behind Todd. Todd finished $1$ place behind Rand. Marta finished in $6$th place. Who finished in $8$th place? $\textbf{(A) } \text{David} \qquad\textbf{(B) } \text{Hikmet} \qquad\textbf{(C) } \text{Jack} \qquad\textbf{(D) } \text{Rand} \qquad\textbf{(E) } \text{Todd} $

Each corner of a rectangular prism is cut off. Two (of the eight) cuts are shown. How many edges does the new figure have? [asy] draw((0,0)--(3,0)--(3,3)--(0,3)--cycle); draw((3,0)--(5,2)--(5,5)--(2,5)--(0,3)); draw((3,3)--(5,5)); draw((2,0)--(3,1.8)--(4,1)--cycle,linewidth(1)); draw((2,3)--(4,4)--(3,2)--cycle,linewidth(1));[/asy] $ \text{(A)}\ 24\qquad\text{(B)}\ 30\qquad\text{(C)}\ 36\qquad\text{(D)}\ 42\qquad\text{(E)}\ 48 $ [i]Assume that the planes cutting the prism do not intersect anywhere in or on the prism.[/i]

In the figure, the chord $[CD]$ is perpendicular to the diameter $[AB]$ and intersects it at $H$. Length of $AB$ is a two-digit natural number. Changing the order of these two digits gives length of $CD$. Knowing that distance from $H$ to the center $O$ is a positive rational number, calculate $AB$. [img]https://cdn.artofproblemsolving.com/attachments/5/f/eb9c61579a38118b4f753bbc19a9a50e0732dc.png[/img]

Let $\left[\sqrt{(n+1)^2 + n^2} \right], n = 1,2, \ldots,$ where $[x]$ denotes the integer part of $x.$ Prove that [b]i.)[/b] there are infinitely many positive integers $m$ such that $a_{m+1} - a_m > 1;$ [b]ii.)[/b] there are infinitely many positive integers $m$ such that $a_{m+1} - a_m = 1.$

Given is a triangle $ABC$ with its circumscribed circle and $| AC | <| AB |$. On the short arc $AC$, there is a variable point $D\ne A$. Let $E$ be the reflection of $A$ wrt the inner bisector of $\angle BDC$. Prove that the line $DE$ passes through a fixed point, regardless of point $D$.

Prove that if the real numbers $ a $, $ b $, $ c $ satisfy the inequalities $$a + b + c> 0,$$ $$ ab + bc + ca > 0$$ $$ abc > 0$$ then $a > 0, b > 0, c > 0$.

Natural numbers are written in the cells of of a $2014\times2014$ regular square grid such that every number is the average of the numbers in the adjacent cells. Describe and prove how the number distribution in the grid can be.

Andrew and Barry play the following game: there are two heaps with $a$ and $b$ pebbles, respectively. In the first round Barry chooses a positive integer $k,$ and Andrew takes away $k$ pebbles from one of the two heaps (if $k$ is bigger than the number of pebbles in the heap, he takes away the complete heap). In the second round, the roles are reversed: Andrew chooses a positive integer and Barry takes away the pebbles from one of the two heaps. This goes on, in each round the two players are reversing the roles. The player that takes the last pebble loses the game. Which player has a winning strategy? [i]Submitted by András Imolay, Budapest[/i]

A quadrilateral $ABCD$ is circumscribed about a circle. Lines $AC$ and $DC$ meet at point $E$ and lines $DA$ and $BC$ meet at $F$, where $B$ is between $A$ and $E$ and between $C$ and $F$. Let $I_1, I_2$ and $I_3$ be the incenters of triangles $AFB, BEC$ and $ABC$, respectively. The line $I_1I_3$ intersects $EA$ at $K$ and $ED$ at $L$, whereas the line $I_2I_3$ intersects $FC$ at $M$ and $FD$ at $N$. Prove that $EK = EL$ if and only if $FM = FN$

Alice, Bob, and Conway are playing rock-paper-scissors. Each player plays against each of the other $2$ players and each pair plays until a winner is decided (i.e. in the event of a tie, they play again). What is the probability that each player wins exactly once?

There are $n$ lamps $L_1, L_2, \dots, L_n$ arranged in a circle in that order. At any given time, each lamp is either [i]on[/i] or [i]off[/i]. Every second, each lamp undergoes a change according to the following rule: (a) For each lamp $L_i$, if $L_{i-1}, L_i, L_{i+1}$ have the same state in the previous second, then $L_i$ is [i]off[/i] right now. (Indices taken mod $n$.) (b) Otherwise, $L_i$ is [i]on[/i] right now. Initially, all the lamps are [i]off[/i], except for $L_1$ which is [i]on[/i]. Prove that for infinitely many integers $n$ all the lamps will be [i]off[/i] eventually, after a finite amount of time.

Let $D, E, F$ be points on the sides $BC, CA, AB$ of a triangle $ABC$, respectively such that the lines $AD, BE, CF$ are concurrent at the point $P$. Let a line $\ell$ through $A$ intersect the rays $[DE$ and $[DF$ at the points $Q$ and $R$, respectively. Let $M$ and $N$ be points on the rays $[DB$ and $[DC$, respectively such that the equation \[ \frac{QN^2}{DN}+\frac{RM^2}{DM}=\frac{(DQ+DR)^2-2\cdot RQ^2+2\cdot DM\cdot DN}{MN} \] holds. Show that the lines $AD$ and $BC$ are perpendicular to each other.

For how many pairs of sequences of nonnegative integers $(b_1,b_2,\ldots, b_{2018})$ and $(c_1,c_2,\ldots, c_{2018})$ does there exist a sequence of nonnegative integers $(a_0,\ldots, a_{2018})$ with the following properties: [list] [*] For $0\leq i\leq 2018,$ $a_i<2^{2018}.$ [*] For $1\leq i \leq 2018, b_i=a_{i-1}+a_i$ and $c_i=a_{i-1}|a_i$; [/list] where $|$ denotes the bitwise or operation?

Last summer $30\%$ of the birds living on Town Lake were geese, $25\%$ were swans, $10\%$ were herons, and $35\%$ were ducks. What percent of the birds that were not swans were geese? $ \textbf{(A)}\ 20 \qquad\textbf{(B)}\ 30 \qquad\textbf{(C)}\ 40\qquad\textbf{(D)}\ 50\qquad\textbf{(E)}\ 60 $

The opposite sides of a quadrilateral inscribed in a circle intersect at points $K$ and $L$. Let $F$ be the midpoint of $KL$, $E$ and $G$ be the midpoints of the diagonals of the given quadrilateral. It is known that $FE = a$, $FG = b$. Calculate $KL$ in terms of $a$ and $b.$ (It is known that the points $F$, $E$ and $G$ lie on the same straight line. This is true for any quadrilateral, not necessarily inscribed. The indicated straight line is sometimes called the Newton−Gauss line. This fact can be used without proof in proving the problem, as it is known).

Triangle $\triangle ABC$ has $\angle{A}=90^\circ$ with $BC=12$. Square $BCDE$ is drawn such that $A$ is in its interior. The line through $A$ tangent to the circumcircle of $\triangle ABC$ intersects $CD$ and $BE$ at $P$ and $Q$, respectively. If $PA=4\cdot QA$, and the area of $\triangle ABC$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$, then compute $m+n$. [i]Proposed by Andy Xu[/i]

Prove that for every $ x $ such that $ \sin x \neq 0 $, exists natural $ n $ such that $ | \sin nx | \geq \frac {\sqrt {3}} {2} $.

Let $a$, $b$, $c$ be real numbers such that $0 < a \le b \le c$. Prove that $(a + 3b)(b + 4c)(c + 2a) \ge 60abc$. When does equality hold?

How many non-intersecting pairs of paths we have from (0,0) to (n,n) so that path can move two ways:top or right?

The diagonals of quadrilateral $ABCD$ intersect in point $E$. Given that $|AB| =|CE|$, $|BE| = |AD|$, and $\angle AED = \angle BAD$, determine the ratio $|BC|:|AD|$.

The polynomial $1976(x+x^2+ \cdots +x^n)$ is decomposed into a sum of polynomials of the form $a_1x + a_2x^2 + \cdots + a_nx^n$, where $a_1, a_2, \ldots , a_n$ are distinct positive integers not greater than $n$. Find all values of $n$ for which such a decomposition is possible.

The height $SO$ of a regular quadrangular pyramid $SABCD$ forms an angle $60^o$ with a side edge , the volume of this pyramid is equal to $18$ cm$^3$ . The vertex of the second regular quadrangular pyramid is at point $S$, the center of the base is at point $C$, and one of the vertices of the base lies on the line $SO$. Find the volume of the common part of these pyramids. (The common part of the pyramids is the set of all such points in space that lie inside or on the surface of both pyramids).