Of how many terms does the expansion of a determinant of order $ 2n$ consist if those and only those elements $ a_{ik}$ are non-zero for which $ i\minus{}k$ is divisible by $ n$?

Find all functions $f \colon \mathbb{R_{+}}\to \mathbb{R_{+}}$ satisfying : \[f ( f (x)-x) = 2x\] for all $x > 0$.

Rays $\ell, \ell_1, \ell_2$ have the same starting point $O$, such that the angle between $\ell$ and $\ell_2$ is acute and the ray $\ell_1$ lies inside this angle. The ray $\ell$ contains a fixed point of $F$ and an arbitrary point $L$. Circles passing through $F$ and $L$ and tangent to $\ell_1$ at $L_1$, and passing through $F$ and $L$ and tangent to $\ell_2$ at $L_2$. Prove that the circumcircle of $\triangle FL_1L_2$ passes through a fixed point other than $F$ independent on $L$.

[b]a)[/b] Give an example of function $ f:\mathbb{R}\longrightarrow\mathbb{R}_{>0 } $ that admits a primitive $ F:\mathbb{R}\longrightarrow\mathbb{R}_{>0 } $ having the property that $ F^e $ is a primitive of $ f^e. $ [b]b)[/b] Prove that there is no derivable function $ g:\mathbb{R}\longrightarrow\mathbb{R} $ that has a primitive $ G:\mathbb{R}\longrightarrow\mathbb{R} $ such that $ e^G $ is a primitive of $ e^g. $

Find all positive integers $a$ such that for any positive integer $n\ge 5$ we have $2^n-n^2\mid a^n-n^a$.

Nikolai and Peter are dividing a cake in the shape of a triangle. Firstly, Nikolai chooses one point $P$ inside the triangle and after that Peter cuts the cake by any line he chooses through $P$, then takes one of the pieces and leaves the other one for Nikolai. What’s the greatest portion of the cake Nikolai can be sure he could take, if he chooses $P$ in the best way possible?

Let $\{x_n\}$ be a Van Der Corput series,that is,if the binary representation of $n$ is $\sum a_{i}2^{i}$ then $x_n=\sum a_i2^{-i-1}$.Let $V$ be the set of points on the plane that have the form $(n,x_n)$.Let $G$ be the graph with vertex set $V$ that is connecting any two points $(p,q)$ if there is a rectangle $R$ which lies in parallel position with the axes and $R\cap V= \{p,q\}$.Prove that the chromatic number of $G$ is finite.

Suppose $\Delta$ is a fixed line and $F$ and $F'$ are two points with equal distance from $\Delta$ that are on two sides of $\Delta$. The circle $C$ is with center $P$ and radius $mPF$ where $m$ is a positive number not equal to $1$. The circle $C'$ is the circle that $PFF'$ is inscribed in it. a) What is the condition on $P$ such that $C$ and $C'$ intersect? b) If we denote the intersections of $C$ and $C'$ to be $M$ and $M'$ then what is the locus of $M$ and $M'$; c) Show that $C$ is always tangent to this locus.

Let $f(x,y)=(\cos x+y\sin x)^2$. We may express $\text{max}_xf(x,y)$, the maximum value of $f(x,y)$ over all values of $x$ for a given fixed value of $y$, as a function of $y$, call it $g(y)$. Let the smallest positive value $x$ which achieves this maximum value of $f(x,y)$ for a given $y$ be $h(y)$. Compute \[\int_1^{2+\sqrt{3}}\frac{h(y)}{g(y)}\text{d}y.\]

Problem 1. Let ω be the incircle of triangle ABC which is tangent to BC,CA,AB at points D,E,F, respectively. The altitudes of triangle DEF with respect to E,F meet AB,AC at points X,Y, respectively. Prove that the second intersection of the circumcircles of triangles AEX,AFY lies on the circle ω.

[u]Round 5[/u] [b]5.1.[/b] Julia baked a pie for herself to celebrate pi day this year. If Julia bakes anyone pie on pi day, the following year on pi day she bakes a pie for herself with $1/3$ probability, she bakes her friend a pie with $1/6$ probability, and she doesn't bake anyone a pie with $1/2$ probability. However, if Julia doesn't make pie on pi day, the following year on pi day she bakes a pie for herself with $1/2$ probability, she bakes her friend a pie with $1/3$ probability, and she doesn't bake anyone a pie with $1/6$ probability. The probability that Julia bakes at least $2$ pies on pi day in the next $5$ years can be expressed as $p/q$, for relatively prime positive integers $p$ and $q$. Compute $p + q$. [b]5.2.[/b] Steven is flipping a coin but doesn't want to appear too lucky. If he ips the coin $8$ times, the probability he only gets sequences of consecutive heads or consecutive tails that are of length $4$ or less can be expressed as $p/q$, for relatively prime positive integers $p$ and $q$. Compute $p + q$. [b]5.3.[/b] Let $ABCD$ be a square with side length $3$. Further, let $E$ be a point on side$ AD$, such that $AE = 2$ and $DE = 1$, and let $F$ be the point on side $AB$ such that triangle $CEF$ is right with hypotenuse $CF$. The value $CF^2$ can be expressed as $m/n$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$. [u]Round 6[/u] [b]6.1.[/b] Let $P$ be a point outside circle $\omega$ with center $O$. Let $A,B$ be points on circle $\omega$ such that $PB$ is a tangent to $\omega$ and $PA = AB$. Let $M$ be the midpoint of $AB$. Given $OM = 1$, $PB = 3$, the value of $AB^2$ can be expressed as $m/n$ for relatively prime positive integers $m, n$. Find $m + n$. [b]6.2.[/b] Let $a_0, a_1, a_2,...$with each term defined as $a_n = 3a_{n-1} + 5a_{n-2}$ and $a_0 = 0$, $a_1 = 1$. Find the remainder when $a_{2020}$ is divided by $360$. [b]6.3.[/b] James and Charles each randomly pick two points on distinct sides of a square, and they each connect their chosen pair of points with a line segment. The probability that the two line segments intersect can be expressed as $m/n$ for relatively prime positive integers $m, n$. Find $m + n$. [u]Round 7[/u] [b]7.1.[/b] For some positive integers $x, y$ let $g = gcd (x, y)$ and $\ell = lcm (2x, y)$: Given that the equation $xy+3g+7\ell = 168$ holds, find the largest possible value of $2x + y$. [b]7.2.[/b] Marco writes the polynomials $$f(x) = nx^4 +2x^3 +3x^2 +4x+5$$ and $$g(x) = a(x-1)^4 +b(x-1)^3 +6(x-1)^2 + d(x - 1) + e,$$ where $n, a, b, d, e$ are real numbers. He notices that $g(i) = f(i) - |i|$ for each integer $i$ satisfying $-5 \le i \le -1$. Then $n^2$ can be expressed as $p/q$ for relatively prime positive integers $p, q$. Find $p + q$. [b]7.3. [/b]Equilateral $\vartriangle ABC$ is inscribed in a circle with center $O$. Points $D$ and $E$ are chosen on minor arcs $AB$ and $BC$, respectively. Segment $\overline{CD}$ intersects $\overline{AB}$ and $\overline{AE}$ at $Y$ and $X$, respectively. Given that $\vartriangle DXE$ and $\vartriangle AXC$ have equal area, $\vartriangle AXY$ has area $ 1$, and $\vartriangle ABC$ has area $52$, find the area of $\vartriangle BXC$. [u]Round 8[/u] [b]8.[/b] Let $A$ be the number of total webpage visits our website received last month. Let $B$ be the number photos in our photo collection from ABMC onsite 2017. Let $M$ be the mean speed round score. Further, let $C$ be the number of times the letter c appears in our problem bank. Estimate $$A \cdot B + M \cdot C.$$Your answer will be scored according to the following formula, where $X$ is the correct answer and $I$ is your input. $$max \left\{ 0, \left\lceil min \left\{13 - \frac{|I-X|}{0.05 |I|}, 13 - \frac{|I-X|}{0.05 |I-2X|} \right\} \right\rceil \right\}$$ PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2766251p24226451]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Each of the $24$ students in Mr. Friedman's class cut up a $7\times 7$ grid of squares while he read them short stories by Mark Twain. While not all of the students cut their squares up in the same way, each of them cut their $7\times 7$ square into at most the three following types (shapes) of pieces. [asy] size(350); defaultpen(linewidth(0.8)); real r = 4.5, s = 9; filldraw(origin--(2,0)--(2,1)--(1,1)--(1,2)--(0,2)--cycle,blue); draw((0,1)--(1,1)--(1,0)); filldraw((r,0)--(r+2,0)--(r+2,2)--(r,2)--cycle,green); draw((r+1,0)--(r+1,2)^^(r,1)--(r+2,1)); filldraw((s,0)--(s+2,0)--(s+2,1)--(s+3,1)--(s+3,2)--(s+1,2)--(s+1,1)--(s,1)--cycle,red); draw((s+1,0)--(s+1,1)--(s+2,1)--(s+2,2)); [/asy] Let $a$, $b$, and $c$ be the number of total pieces of each type from left to right respectively after all $24$ $7\times 7$ squares are cut up. How many ordered triples $(a,b,c)$ are possible?

Prove that there exist $0 < \alpha< \beta<1$ numbers have the following properties. (i) for any sufficiently large n, n points can be specified in $\Bbb R^3$ , so that each point is equidistant from at least $n^\alpha$ other points. (ii) the above statement is no longer true with $n^\beta$ instead of $n^\alpha$

Define the minimum real $C$ where for any reals $0 = a_0 < a_{1} < \dots < a_{1000}$ then $$\min_{0 \le k \le 1000} (a_{k}^2 + (1000-k)^2) \le C(a_1+ \dots + a_{1000})$$ holds. Find $\lfloor 100C \rfloor.$

Consider the statements: $ \textbf{(1)}\ \text{p and q are both true} \qquad \textbf{(2)}\ \text{p is true and q is false} \qquad \textbf{(3)}\ \text{p is false and q is true} \qquad \textbf{(4)}\ \text{p is false and q is false.}$ How many of these imply the negative of the statement "p and q are both true?" $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 3 \qquad \textbf{(E)}\ 4$

Dertemine integers $a_{1},a_{2},...,a_{99}=a_{0}$ satisfying $|a_{k}-a_{k-1}|\geq 1996$ for all $k=1,2,...,99$, such that $m=\max_{1\leq k\leq 99} |a_{k}-a_{k-1}|$ is minimum possible, and find the minimum value $m^{*}$ of $m$.