Say that a function $f : \{1, 2, . . . , 1001\} \to Z$ is [i]almost [/i] polynomial if there is a polynomial $p(x) = a_{200}x^{200} +... + a_1x + a_0$ such that each an is an integer with $|a_n| \le 201$, and such that $|f(x) - p(x)| \le 1$ for all $x \in \{1, 2, . . . , 1001\}$. Let $N$ be the number of almost polynomial functions. Compute the remainder upon dividing $N$ by $199$.

The sequence ($a_n$) is defined by $a_1 = a_2 = 1$ and $a_{n+2 }= a_{n+1} +a_n +k$, where $k$ is a positive integer. Find the least $k$ for which $a_{1991}$ and $1991$ are not coprime.

[asy]size(180); draw((1,0)--(2,0)--(2,10)--(1,10)--cycle); draw((3,0)--(4,0)--(4,8)--(3,8)--cycle); draw((5,0)--(6,0)--(6,6)--(5,6)--cycle); draw((7,0)--(8,0)--(8,6)--(7,6)--cycle); draw((9,0)--(10,0)--(10,10)--(9,10)--cycle); draw((0,2)--(-0.5,2)); draw((0,4)--(-0.5,4)); draw((0,6)--(-0.5,6)); draw((0,8)--(-0.5,8)); draw((0,10)--(-0.5,10)); draw((0,10)--(0,0)); draw((0,0)--(10,0)); label("1",(-0.5,2),W); label("2",(-0.5,4),W); label("3",(-0.5,6),W); label("4",(-0.5,8),W); label("5",(-0.5,10),W); label("A",(1.5,-0.5),S); label("B",(3.5,-0.5),S); label("C",(5.5,-0.5),S); label("D",(7.5,-0.5),S); label("F",(9.5,-0.5),S); label("Grade",(5,-3),S); label("$\#$ of Students",(-4,5),W);[/asy] The bar graph shows the grades in a mathematics class for the last grading period. If A, B, C, and D are satisfactory grades, what fraction of the grades shown in the graph are satisfactory? \[ \textbf{(A)}\ \frac{1}{2} \qquad \textbf{(B)}\ \frac{2}{3} \qquad \textbf{(C)}\ \frac{3}{4} \qquad \textbf{(D)}\ \frac{4}{5} \qquad \textbf{(E)}\ \frac{9}{10} \]

Each edge and each diagonal of the convex $ n$-gon $ (n\geq 3)$ is colored in red or blue. Prove that the vertices of the $ n$-gon can be labeled as $ A_1,A_2,...,A_n$ in such a way that one of the following two conditions is satisfied: (a) all segments $ A_1A_2,A_2A_3,...,A_{n\minus{}1}A_n,A_nA_1$ are of the same colour. (b) there exists a number $ k, 1<k<n$ such that the segments $ A_1A_2,A_2A_3,...,A_{k\minus{}1}A_k$ are blue, and the segments $ A_kA_{k\plus{}1},...,A_{n\minus{}1}A_n,A_nA_1$ are red.

Find the sum of all integers $n$ that fulfill the equation \[2^n(6-n)=8n.\]

Let $S$ be the sum of all numbers of the form $a/b,$ where $a$ and $b$ are relatively prime positive divisors of $1000.$ What is the greatest integer that does not exceed $S/10?$

Two circles intersect in points $A$ and $B$. Their common tangent nearer $B$ touches the circles at points $E$ and $F$, and intersects the extension of $AB$ at the point $M$. The point $K$ is chosen on the extention of $AM$ so that $KM = MA$. The line $KE$ intersects the circle containing $E$ again at the point $C$. The line $KF$ intersects the circle containing $F$ again at the point $D$. Prove that the points $A, C$ and $D$ are collinear.

Two distinct numbers $ a$ and $ b$ are chosen randomly from the set $ \{ 2, 2^2, 2^3, \ldots, 2^{25} \}$. What is the probability that $ \log_{a} b$ is an integer? $ \textbf{(A)}\ \frac {2}{25} \qquad \textbf{(B)}\ \frac {31}{300} \qquad \textbf{(C)}\ \frac {13}{100} \qquad \textbf{(D)}\ \frac {7}{50} \qquad \textbf{(E)}\ \frac {1}{2}$

6. The baker has baked a rectangular pancake. He then cut it into $n^{2}$ rectangles by making $n-1$ horizontal and $n-1$ vertical cuts. Being rounded to the closest integer, the areas of resulting rectangles equal to all positive integers from 1 to $n^{2}$ in some order. For which maximal $n$ could this happen? (Half-integers are rounded upwards.) Georgy Karavaev

Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a continuous function with the following property: for all $\alpha \in \mathbb{R}_{>0}$, the sequence $(a_n)_{n \in \mathbb{N}}$ defined as $a_n = f(n\alpha)$ satisfies $\lim_{n \to \infty} a_n = 0$. Is it necessarily true that $\lim_{x \to +\infty} f(x) = 0$?

The number $17^6$ when written out in base $10$ contains $8$ distinct digits from $1,2,\ldots,9,$ with no repeated digits or zeroes. Compute the missing nonzero digit.

In $\triangle ABC$, shown on the right, let $r$ denote the radius of the inscribed circle, and let $r_A$, $r_B$, and $r_C$ denote the radii of the smaller circles tangent to the inscribed circle and to the sides emanating from $A$, $B$, and $C$, respectively. Prove that $r \leq r_A + r_B + r_C$

Find all the real number triples $(x, y, z)$ satisfying the following system of inequalities under the condition $0 < x, y, z < \sqrt{2}$: $$y\sqrt{4-x^2y^2}\ge \frac{2}{\sqrt{xz}}$$ $$x\sqrt{4-x^2z^2}\ge \frac{2}{\sqrt{yz}}$$ $$z\sqrt{4-y^2z^2}\ge \frac{2}{\sqrt{xy}}$$.

Let $C, B, E$ be three points on a straight line $\ell$ in that order. Suppose that $A$ and $D$ are two points on the same side of $\ell$ such that (i) $\angle ACE = \angle CDE = 90^o$ and (ii) $CA = CB = CD$. Let $F$ be the point of intersection of the segment $AB$ and the circumcircle of $\vartriangle ADC$. Prove that $F$ is the incentre of $\vartriangle CDE$.

The Fibonacci numbers $F_0, F_1, F_2, . . .$ are defined inductively by $F_0=0, F_1=1$, and $F_{n+1}=F_n+F_{n-1}$ for $n \ge 1$. Given an integer $n \ge 2$, determine the smallest size of a set $S$ of integers such that for every $k=2, 3, . . . , n$ there exist some $x, y \in S$ such that $x-y=F_k$. [i]Proposed by Croatia[/i]

Let the inequality $$Aa(Bb + Cc) + Bb(Aa + Cc) + Cc(Aa + Bb) > \frac{ABc^2 + BCa^2 + CAb^2}{2}$$ with given $a > 0, b > 0, c > 0$ hold for all $A > 0, B > 0, C > 0$. Is it possible to construct a triangle with sides of lengths $a, b, c$?

[u]Set 1[/u] [b]B1.[/b] Evaluate $2 + 0 - 2 \times 0$. [b]B2.[/b] It takes four painters four hours to paint four houses. How many hours does it take forty painters to paint forty houses? [b]B3.[/b] Let $a$ be the answer to this question. What is $\frac{1}{2-a}$? [u]Set 2[/u] [b]B4.[/b] Every day at Andover is either sunny or rainy. If today is sunny, there is a $60\%$ chance that tomorrow is sunny and a $40\%$ chance that tomorrow is rainy. On the other hand, if today is rainy, there is a $60\%$ chance that tomorrow is rainy and a $40\%$ chance that tomorrow is sunny. Given that today is sunny, the probability that the day after tomorrow is sunny can be expressed as n%, where n is a positive integer. What is $n$? [b]B5.[/b] In the diagram below, what is the value of $\angle DD'Y$ in degrees? [img]https://cdn.artofproblemsolving.com/attachments/0/8/6c966b13c840fa1885948d0e4ad598f36bee9d.png[/img] [b]B6.[/b] Christina, Jeremy, Will, and Nathan are standing in a line. In how many ways can they be arranged such that Christina is to the left of Will and Jeremy is to the left of Nathan? Note: Christina does not have to be next to Will and Jeremy does not have to be next to Nathan. For example, arranging them as Christina, Jeremy, Will, Nathan would be valid. [u]Set 3[/u] [b]B7.[/b] Let $P$ be a point on side $AB$ of square $ABCD$ with side length $8$ such that $PA = 3$. Let $Q$ be a point on side $AD$ such that $P Q \perp P C$. The area of quadrilateral $PQDB$ can be expressed in the form $m/n$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]B8.[/b] Jessica and Jeffrey each pick a number uniformly at random from the set $\{1, 2, 3, 4, 5\}$ (they could pick the same number). If Jessica’s number is $x$ and Jeffrey’s number is $y$, the probability that $x^y$ has a units digit of $1$ can be expressed as $m/n$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [b]B9.[/b] For two points $(x_1, y_1)$ and $(x_2, y_2)$ in the plane, we define the taxicab distance between them as $|x_1 - x_2| + |y_1 - y_2|$. For example, the taxicab distance between $(-1, 2)$ and $(3,\sqrt2)$ is $6-\sqrt2$. What is the largest number of points Nathan can find in the plane such that the taxicab distance between any two of the points is the same? [u]Set 4[/u] [b]B10.[/b] Will wants to insert some × symbols between the following numbers: $$1\,\,\,2\,\,\,3\,\,\,4\,\,\,6$$ to see what kinds of answers he can get. For example, here is one way he can insert $\times$ symbols: $$1 \times 23 \times 4 \times 6 = 552.$$ Will discovers that he can obtain the number $276$. What is the sum of the numbers that he multiplied together to get $276$? [b]B11.[/b] Let $ABCD$ be a parallelogram with $AB = 5$, $BC = 3$, and $\angle BAD = 60^o$ . Let the angle bisector of $\angle ADC$ meet $AC$ at $E$ and $AB$ at $F$. The length $EF$ can be expressed as $m/n$, where $m$ and $n$ are relatively prime positive integers. What is $m + n$? [b]B12.[/b] Find the sum of all positive integers $n$ such that $\lfloor \sqrt{n^2 - 2n + 19} \rfloor = n$. Note: $\lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$. [u]Set 5[/u] [b]B13.[/b] This year, February $29$ fell on a Saturday. What is the next year in which February $29$ will be a Saturday? [b]B14.[/b] Let $f(x) = \frac{1}{x} - 1$. Evaluate $$f\left( \frac{1}{2020}\right) \times f\left( \frac{2}{2020}\right) \times f\left( \frac{3}{2020}\right) \times \times ... \times f\left( \frac{2019}{2020}\right) .$$ [b]B15.[/b] Square $WXYZ$ is inscribed in square $ABCD$ with side length $1$ such that $W$ is on $AB$, $X$ is on $BC$, $Y$ is on $CD$, and $Z$ is on $DA$. Line $W Y$ hits $AD$ and $BC$ at points $P$ and $R$ respectively, and line $XZ$ hits $AB$ and $CD$ at points $Q$ and $S$ respectively. If the area of $WXYZ$ is $\frac{13}{18}$ , then the area of $PQRS$ can be expressed as $m/n$ for relatively prime positive integers $m$ and $n$. What is $m + n$? PS. You had better use hide for answers. Last sets have been posted [url=https://artofproblemsolving.com/community/c4h2777424p24371574]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Minor base $BC$ of trapezoid $ABCD$ is equal to side $AB$, and diagonal $AC$ is equal to base $AD$. The line passing through B and parallel to $AC$ intersects line $DC$ in point $M$. Prove that $AM$ is the bisector of angle $\angle BAC$. A.Blinkov, Y.Blinkov

Through the midpoints of the sides of the triangle $T$, straight lines are drawn perpendicular to the bisectors of the opposite angles of the triangle. These lines formed a triangle $T_1$. Prove that the center of the circle circumscribed about $T_1$ is in the midpoint of the segment formed by the center of the inscribed circle and the intersection point of the heights of triangle $T$.

$8$ singers take part in a festival. The organiser wants to plan $m$ concerts. For every concert there are $4$ singers who go on stage, with the restriction that the times of which every two singers go on stage in a concert are all equal. Find a schedule that minimises $m$.

A sequence $a_0, a_1, \dots , a_n, \dots$ of positive integers is constructed as follows: [list] [*] If the last digit of $a_n$ is less than or equal to $5$, then this digit is deleted and $a_{n+1}$ is the number consisting of the remaining digits. (If $a_{n+1}$ contains no digits, the process stops.) [*] Otherwise, $a_{n+1}= 9a_n$. [/list] Can one choose $a_0$ so that this sequence is infinite?

Let $a_{n}$ be the last nonzero digit in the decimal representation of the number $n!$. Does the sequence $a_{1}$, $a_{2}$, $a_{3}$, $\cdots$ become periodic after a finite number of terms?

Let $ABCD$ be a convex quadrilateral, and let $P$, $Q$, $R$, and $S$ be points on the sides $AB$, $BC$, $CD$, and $DA$, respectively. Let the line segment $PR$ and $QS$ meet at $O$. Suppose that each of the quadrilaterals $APOS$, $BQOP$, $CROQ$, and $DSOR$ has an incircle. Prove that the lines $AC$, $PQ$, and $RS$ are either concurrent or parallel to each other.

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

Circle $O$ has three chords, $AD$, $DF$, and $EF$. Point E lies along the arc $AD$. Point $C$ is the intersection of chords $AD$ and $EF$. Point $B$ lies on segment $AC$ such that $EB = EC = 8$. Given $AB = 6$, $BC = 10$, and $CD = 9$, find $DF$. [img]https://cdn.artofproblemsolving.com/attachments/f/c/c36bff9ad04f13f7e227c57bddb53a0bfc0569.png[/img]