Let $ n$ be a positive integer such that $ \tfrac{1}{2}\plus{}\tfrac{1}{3}\plus{}\tfrac{1}{7}\plus{}\tfrac{1}{n}$ is an integer. Which of the following statements is [b]not[/b] true? $ \textbf{(A)}\ 2\text{ divides }n \qquad \textbf{(B)}\ 3\text{ divides }n \qquad \textbf{(C)}\ 6\text{ divides }n \qquad \textbf{(D)}\ 7\text{ divides }n \\ \textbf{(E)}\ n>84$

A collection of circles in the upper half-plane, all tangent to the $x$-axis, is constructed in layers as follows. Layer $L_0$ consists of two circles of radii $70^2$ and $73^2$ that are externally tangent. For $k\geq 1$, the circles in $\textstyle\bigcup_{j=0}^{k-1} L_j$ are ordered according to their points of tangency with the $x$-axis. For every pair of consecutive circles in this order, a new circle is constructed externally tangent to each of the two circles in the pair. Layer $L_k$ consists of the $2^{k-1}$ circles constructed in this way. Let $S=\textstyle\bigcup_{j=0}^6 L_j$, and for every circle $C$ denote by $r(C)$ its radius. What is \[\sum_{C\in S}\dfrac1{\sqrt{r(C)}}?\] [asy] import olympiad; size(350); defaultpen(linewidth(0.7)); // define a bunch of arrays and starting points pair[] coord = new pair[65]; int[] trav = {32,16,8,4,2,1}; coord[0] = (0,73^2); coord[64] = (2*73*70,70^2); // draw the big circles and the bottom line path arc1 = arc(coord[0],coord[0].y,260,360); path arc2 = arc(coord[64],coord[64].y,175,280); fill((coord[0].x-910,coord[0].y)--arc1--cycle,gray(0.78)); fill((coord[64].x+870,coord[64].y+425)--arc2--cycle,gray(0.78)); draw(arc1^^arc2); draw((-930,0)--(70^2+73^2+850,0)); // We now apply the findCenter function 63 times to get // the location of the centers of all 63 constructed circles. // The complicated array setup ensures that all the circles // will be taken in the right order for(int i = 0;i<=5;i=i+1) { int skip = trav[i]; for(int k=skip;k<=64 - skip; k = k + 2*skip) { pair cent1 = coord[k-skip], cent2 = coord[k+skip]; real r1 = cent1.y, r2 = cent2.y, rn=r1*r2/((sqrt(r1)+sqrt(r2))^2); real shiftx = cent1.x + sqrt(4*r1*rn); coord[k] = (shiftx,rn); } // Draw the remaining 63 circles } for(int i=1;i<=63;i=i+1) { filldraw(circle(coord[i],coord[i].y),gray(0.78)); }[/asy] $\textbf{(A) }\dfrac{286}{35}\qquad\textbf{(B) }\dfrac{583}{70}\qquad\textbf{(C) }\dfrac{715}{73}\qquad\textbf{(D) }\dfrac{143}{14}\qquad\textbf{(E) }\dfrac{1573}{146}$

Real numbers $a_1 , a_2 , \dots, a_n$ add up to zero. Find the maximum of $a_1 x_1 + a_2 x_2 + \dots + a_n x_n$ in term of $a_i$'s, when $x_i$'s vary in real numbers such that $(x_1 - x_2)^2 + (x_2 - x_3)^2 + \dots + (x_{n-1} - x_n)^2 \leq 1$. (15 points)

Let $n$ be a natural number. Prove that the number $4 \cdot 3^{2^n}+ 3 \cdot4^{2^n}$ is divisible by $13$ if and only if $n$ is even.

Find all pairs of functions $ f, g: \mathbb R \to \mathbb R$ such that [list] (i) if $ x < y$, then $ f(x) < f(y)$; (ii) $ f(xy) \equal{} g(y)f(x) \plus{} f(y)$ for all $ x, y \in \mathbb R$. [/list]

Let $ a>0$ and $ f: [0,\infty) \to [0,a]$ be a continuous function on $ (0,\infty)$ and having Darboux property on $ [0,\infty)$. Prove that if $ f(0)\equal{}0$ and for all nonnegative $ x$ we have \[ xf(x) \geq \int^x_0 f(t) dt ,\] then $ f$ admits primitives on $ [0,\infty)$.

A quadratic polynomial with positive integer coefficients and rational roots can be written as $196x^2+Bx + 135$ for some integer $B.$ What is the sum of all possible values of $B$ such that $\gcd(B, 196 \cdot 135) = 1$?

Let $ABC$ be a scalene triangle with circle $\Gamma$. Let $P,Q,R,S$ distinct points on the $BC$ side, in that order, such that $\angle BAP = \angle CAS$ and $\angle BAQ = \angle CAR$. Let $U, V, W, Z$ be the intersections, distinct from $A$, of the $AP, AQ, AR$ and $AS$ with $\Gamma$, respectively. Let $X = UQ \cap SW$, $Y = PV \cap ZR$, $T = UR \cap VS$ and $K = PW \cap ZQ$. Suppose that the points $M$ and $N$ are well determined, such that $M = KX \cap TY$ and $N = TX \cap KY$. Show that $M, N, A$ are collinear.

The polynomials $ P(x)$ and $ Q(x)$ are given. It is known that for a certain polynomial $ R(x, y)$ the identity $ P(x) \minus{} P(y) \equal{} R(x, y) (Q(x) \minus{} Q(y))$ applies. Prove that there is a polynomial $ S(x)$ so that $ P(x) \equal{} S(Q(x)) \quad \forall x.$

Let $A$ be the greatest possible value of a product of positive integers that sums to $2014$. Compute the sum of all bases and exponents in the prime factorization of $A$. For example, if $A=7\cdot 11^5$, the answer would be $7+11+5=23$.

A pentagon (not necessarily convex) has all sides of length $1$ and its product of cosine of any four angles equal to zero. Find all possible values of the area of such a pentagon.

Consider a scalene triangle $ ABC $ with $ AB <AC <BC. $ The $ AB $ side mediator cuts the $ B $ side at the $ K $ point and the $ AC $ prolongation at the $ U. $ point. $ AC $ side cuts $ BC $ side at $ O $ point and $ AB $ side extension at $ G$ point. Prove that the $ GOKU $ quad is cyclic, meaning its four vertices are at same circumference

Find all real $x$ in the interval $[0, 2\pi)$ such that \[27 \cdot 3^{3 \sin x} = 9^{\cos^2 x}.\]

Given a prime $p$, show that there exists a positive integer $n$ such that the decimal representation of $p^n$ has a block of $2002$ consecutive zeros.

Determine the greatest positive integer $ n$ such that in three-dimensional space, there exist n points $ P_{1},P_{2},\cdots,P_{n},$ among $ n$ points no three points are collinear, and for arbitary $ 1\leq i < j < k\leq n$, $ P_{i}P_{j}P_{k}$ isn't obtuse triangle.

Each vertex of convex pentagon $ABCDE$ is to be assigned a color. There are $6$ colors to choose from, and the ends of each diagonal must have different colors. How many different colorings are possible? $ \textbf{(A)}\ 2520\qquad\textbf{(B)}\ 2880\qquad\textbf{(C)}\ 3120\qquad\textbf{(D)}\ 3250\qquad\textbf{(E)}\ 3750 $

The set $S = \{1, 2, \dots, 2022\}$ is to be partitioned into $n$ disjoint subsets $S_1, S_2, \dots, S_n$ such that for each $i \in \{1, 2, \dots, n\}$, exactly one of the following statements is true: (a) For all $x, y \in S_i$, with $x \neq y, \gcd(x, y) > 1.$ (b) For all $x, y \in S_i$, with $x \neq y, \gcd(x, y) = 1.$ Find the smallest value of $n$ for which this is possible.

Grade8 P5 of Sharygin 2019 Finals

A classroom consists of a $5\times5$ array of desks, to be filled by anywhere from 0 to 25 students, inclusive. No student will sit at a desk unless either all other desks in its row or all others in its column are filled (or both). Considering only the set of desks that are occupied (and not which student sits at each desk), how many possible arrangements are there?

A long thin strip of paper is 1024 units in length, 1 unit in width, and is divided into 1024 unit squares. The paper is folded in half repeatedly. For the first fold, the right end of the paper is folded over to coincide with and lie on top of the left end. The result is a 512 by 1 strip of double thickness. Next, the right end of this strip is folded over to coincide with and lie on top of the left end, resulting in a 256 by 1 strip of quadruple thickness. This process is repeated 8 more times. After the last fold, the strip has become a stack of 1024 unit squares. How many of these squares lie below the square that was originally the 942nd square counting from the left?

Prove that for any prime number $p > 3$ exist integers $x, y, k$ that meet conditions: $0 < 2k < p$ and $kp + 3 = x^2 + y^2$.

Smallville is populated by unmarried men and women, some of which are acquainted. The two City Matchmakers know who is acquainted with whom. One day, one of the matchmakers claimed: "I can arrange it so that every red haired man will marry a woman with who he is acquainted." The other matchmaker claimed: "I can arrange it so that every blonde woman will marry a man with whom she is acquainted." An amateur mathematician overheard this conversation and said: "Then it can be arranged so that every red haired man will marry a woman with whom he is acquainted and at the same time very blonde woman will marry a man with who she is acquainted." Is the mathematician right?

In $\vartriangle ABC$ points $D, E$, and $F$ lie on side $\overline{BC}$ such that $\overline{AD}$ is an angle bisector of $\angle BAC$, $\overline{AE}$ is a median, and $\overline{AF}$ is an altitude. Given that $AB = 154$ and $AC = 128$, and $9 \times DE = EF,$ find the side length $BC$.

The base of a convex pyramid has an odd number of edges. The lateral edges of the pyramid are all equal, and the angles between neighbouring faces are all equal. Show that the base must be a regular polygon.

Estimate the number of ordered pairs $(p,q)$ of positive integers at most $2020$ such that the cubic equation $x^3-px-q=0$ has three distinct real roots. If your estimate is $E$ and the answer is $A$, your score for this problem will be \[\Big\lfloor15\min\Big(\frac{A}{E},\frac{E}{A}\Big)\Big\rfloor.\] [i]Proposed by Alex Li[/i]