A quadrilateral is called $\textit{innovative}$ if its diagonals divide it into $4$ triangles, having the same sets of angle measures. Find the angle measures of an $\textit{innovative}$ quadrilateral, given that one of its angles has measure $13^{\circ}$.

Amandine and Brennon play a turn-based game, with Amadine starting. On their turn, a player must select a positive integer which cannot be represented as a sum of multiples of any of the previously selected numbers. For example, if $3, 5$ have been selected so far, only $1, 2, 4, 7$ are available to be picked; if only $3$ has been selected so far, all numbers not divisible by three are eligible. A player loses immediately if they select the integer $1$. Call a number $n$ [i]feminist[/i] if $\gcd(n, 6) = 1$ and if Amandine wins if she starts with $n$. Compute the sum of the [i]feminist[/i] numbers less than $40$. [i]Proposed by Ashwin Sah[/i]

Let $ABC$ be a triangle such that $AB=AC$ and $\angle BAC$ is obtuse. Point $O$ is the circumcenter of triangle $ABC$, and $M$ is the reflection of $A$ in $BC$. Let $D$ be an arbitrary point on line $BC$, such that $B$ is in between $D$ and $C$. Line $DM$ cuts the circumcircle of $ABC$ in $E,F$. Circumcircles of triangles $ADE$ and $ADF$ cut $BC$ in $P,Q$ respectively. Prove that $DA$ is tangent to the circumcircle of triangle $OPQ$.

The figure on the right shows the ellipse $\frac{(x-19)^2}{19}+\frac{(x-98)^2}{98}=1998$. Let $R_1,R_2,R_3,$ and $R_4$ denote those areas within the ellipse that are in the first, second, third, and fourth quadrants, respectively. Determine the value of $R_1-R_2+R_3-R_4$. [asy] defaultpen(linewidth(0.7)); pair c=(19,98); real dist = 30; real a = sqrt(1998*19),b=sqrt(1998*98); xaxis("x",c.x-a-dist,c.x+a+3*dist,EndArrow); yaxis("y",c.y-b-dist*2,c.y+b+3*dist,EndArrow); draw(ellipse(c,a,b)); label("$R_1$",(100,200)); label("$R_2$",(-80,200)); label("$R_3$",(-60,-150)); label("$R_4$",(70,-150));[/asy]

Let be an infinite sequence $ \left( c_n \right)_{n\ge 1} $ of positive real numbers, with $ c_1=1, $ and satisfying $$ c_{n+1}-\frac{1}{c_{n+1}} =c_n+\frac{1}{c_n} , $$ for all natural numbers $ n. $ Prove that: [b]a)[/b] there exists a natural number $ k $ such that the sequence $ \left( c_n^k+\frac{1}{c_n^k} \right)_{n\ge 1} $ is an arithmetic one. [b]b)[/b] there exist two sequences $ \left( u_n \right)_{n\ge 1} ,\left( v_n \right)_{n\ge 1} $ of nonegative integers such that $ c_n=\sqrt{u_n} +\sqrt{v_n} , $ for any natural number $ n. $

Let $ABC$ be a triangle with orthocenter $H$, incenter $I$ and centroid $S$, and let $d$ be the diameter of the circumcircle of triangle $ABC$. Prove the inequality \[9\cdot HS^2+4\left(AH\cdot AI+BH\cdot BI+CH\cdot CI\right)\geq 3d^2,\] and determine when equality holds.

Let $m, n \ge 2$ be integers. Carl is given $n$ marked points in the plane and wishes to mark their centroid.* He has no standard compass or straightedge. Instead, he has a device which, given marked points $A$ and $B$, marks the $m-1$ points that divide segment $\overline{AB}$ into $m$ congruent parts (but does not draw the segment). For which pairs $(m,n)$ can Carl necessarily accomplish his task, regardless of which $n$ points he is given? *Here, the [i]centroid[/i] of $n$ points with coordinates $(x_1, y_1), \dots, (x_n, y_n)$ is the point with coordinates $\left( \frac{x_1 + \dots + x_n}{n}, \frac{y_1 + \dots + y_n}{n}\right)$. [i]Proposed by Holden Mui and Carl Schildkraut[/i]

[b]p1.[/b] Find the smallest whole number $n \ge 2$ such that the product $(2^2 - 1)(3^2 - 1) ... (n^2 - 1)$ is the square of a whole number. [b]p2.[/b] The figure below shows a $ 10 \times 10$ square with small $2 \times 2$ squares removed from the corners. What is the area of the shaded region? [img]https://cdn.artofproblemsolving.com/attachments/7/5/a829487cc5d937060e8965f6da3f4744ba5588.png[/img] [b]p3.[/b] Three cars are racing: a Ford $[F]$, a Toyota $[T]$, and a Honda $[H]$. They began the race with $F$ first, then $T$, and $H$ last. During the race, $F$ was passed a total of $3$ times, $T$ was passed $5$ times, and $H$ was passed $8$ times. In what order did the cars finish? [b]p4.[/b] There are $11$ big boxes. Each one is either empty or contains $8$ medium-sized boxes inside. Each medium box is either empty or contains $8$ small boxes inside. All small boxes are empty. Among all the boxes, there are a total of $102$ empty boxes. How many boxes are there altogether? [b]p5.[/b] Ann, Mary, Pete, and finally Vlad eat ice cream from a tub, in order, one after another. Each eats at a constant rate, each at his or her own rate. Each eats for exactly the period of time that it would take the three remaining people, eating together, to consume half of the tub. After Vlad eats his portion there is no more ice cream in the tube. How many times faster would it take them to consume the tub if they all ate together? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In a triangle $ABC$ with $AB\not = AC$, the incircle touches the sides $BC, CA, AB$ at $D, E, F$ , respectively. Line $AD$ meets the incircle again at $P$ . The line $EF$ and the line through $P$ perpendicular to $AD$ meet at $Q$. Line $AQ$ intersects $DE$ at $X$ and $DF$ at $Y$ . Prove that $A$ is the midpoint of $XY$.

In the rectangle there is a broken line, the neighboring links of which are perpendicular and equal to the smaller side of the rectangle (see the figure). Find the ratio of the sides of the rectangle. [img]https://2.bp.blogspot.com/-QYj53KiPTJ8/XT_mVIw876I/AAAAAAAAKbE/gJ1roU4Bx-kfGVfJxYMAuLE0Ax0glRbegCK4BGAYYCw/s1600/oral%2Bmoscow%2B2016%2B8.9%2Bp2.png[/img]

A sequence of positive integers $(a_n)_{n \ge 1}$ is of [i]Fibonacci type[/i] if it satisfies the recursive relation $a_{n + 2} = a_{n + 1} + a_n$ for all $n \ge 1$. Is it possible to partition the set of positive integers into an infinite number of Fibonacci type sequences? [i]Proposed by Ivan Borsenco[/i]

In the triangle $ABC$ on the sides $AB$ and $AC$, points $D$ and E are chosen, respectively. Can the segments $CD$ and $BE$ divide $ABC$ into four parts of the same area? [img]https://cdn.artofproblemsolving.com/attachments/1/c/3bbadab162b22530f1b254e744ecd068dea65e.png[/img]

Nine distinct positive integers summing to $74$ are put into a $3 \times 3$ grid. Simultaneously, the number in each cell is replaced with the sum of the numbers in its adjacent cells. (Two cells are adjacent if they share an edge.) After this, exactly four of the numbers in the grid are $23$. Determine, with proof, all possible numbers that could have been originally in the center of the grid.

For a given positive integer $ k$ denote the square of the sum of its digits by $ f_1(k)$ and let $ f_{n\plus{}1}(k) \equal{} f_1(f_n(k)).$ Determine the value of $ f_{1991}(2^{1990}).$

There are $n>1$ cities in Jansonland, with two-way roads joining certain pairs of cities. Janson will send a few robots one-by-one to build more roads. The robots operate as such: 1. Janson first selects an integer $k$ and a list of cities $a_0, a_1, \dots, a_k$ (cities can repeat). 2. The robot begins at $a_0$ and goes to $a_1$, then $a_2$, and so on until $a_k$. 3. When the robot goes from $a_i$ to $a_{i+1}$, if there is no road then the robot builds a road, but if there is a road then the robot destroys the road. In terms of $n$, determine the smallest constant $k$ such that Janson can always achieve a configuration such that every pair of cities has a road connecting them using no more than $k$ robots. [i](Proposed by Ho Janson)[/i]

Let $a,b,c,d$ be real positive numbers such that $a^2+b^2+c^2+d^2 = 1$. Prove that $(1-a)(1-b)(1-c)(1-d) \geq abcd$.

$a, b, c$ are real positive numbers for which $a+b+c=3$. Prove that $a^{12}+b^{12}+c^{12}+8(ab+bc+ca) \geq 27$

A one-player game is played as follows: There is a bowl at each integer on the $Ox$-axis. All the bowls are initially empty, except for that at the origin, which contains $n \geq 2$ stones. A move is either (A) to remove two stones from a bowl and place one in each of the two adjacent bowls, or (B) to remove a stone from each of two adjacent bowls and to add one stone to the bowl immediately to their left. Show that only a finite number of moves can be made and that the final position (when no more moves are possible) is independent of the moves made (for a given $n$).

Show that the equation $x^4 +y^4 +4z^4 =1$ has infinitely many rational solutions.

Determine all prime numbers $p, q$ and $r$ with $p + q^2 = r^4$. [i](Karl Czakler)[/i]

To any triangle with side lengths $a,b,c$ and the corresponding angles $\alpha, \beta, \gamma$ (measured in radians), the 6-tuple $(a,b,c,\alpha, \beta, \gamma)$ is assigned. Find the minimum possible number $n$ of distinct terms in the 6-tuple assigned to a scalene triangle.

A palindrome in base $b$ is a positive integer whose base-$b$ digits read the same backwards and forwards; for example, $2002$ is a $4$-digit palindrome in base $10$. Note that $200$ is not a palindrome in base $10$, but it is a $3$-digit palindrome: $242$ in base $9$, and $404$ in base $7$. Prove that there is an integer which is a $3$-digit palindrome in base $b$ for at least $2002$ different values of $b$.

In quadrilateral $ABCD$, $AB \parallel CD$ and $BC \perp AB$. Lines $AC$ and $BD$ intersect at $E$. If $AB = 20$, $BC = 2016$, and $CD = 16$, find the area of $\triangle BCE$. [i]Proposed by Harrison Wang[/i]

As shown in the figure, given $\vartriangle ABC$ with $\angle B$, $\angle C$ acute angles, $AD \perp BC$, $DE \perp AC$, $M$ midpoint of $DE$, $AM \perp BE$. Prove that $\vartriangle ABC$ is isosceles. [img]https://cdn.artofproblemsolving.com/attachments/a/8/f553c33557979f6f7b799935c3bde743edcc3c.png[/img]

Consider a triangle $\vartriangle ABC$ with $AB = 5$ and $BC = 4$. Let $G$ be the centroid of the triangle, and let $P$ lie on line $AG$ such that $AG = GP$ and $P\ne A$. Suppose that $P$ lies on the circumcircle of $\vartriangle ABC$. Compute $CA$.