We say that a string of digits from $0$ to $9$ is valid if the following conditions hold: First, for $2 \le k \le 4$, no consecutive run of $k$ digits sums to a multiple of $10$. Second, between any two $0$s, there are at least $3$ other digits. Find the last four digits of the number of valid strings of length $2020$.

The center of a square of side length $ 1$ is placed uniformly at random inside a circle of radius $ 1$. Given that we are allowed to rotate the square about its center, what is the probability that the entire square is contained within the circle for some orientation of the square?

A sequence $\{a_n\}_{n\geq0}$ obeys the recurrence $a_n=1+a_{n-1}+\alpha a_{n-2}$ for all $n\geq2$ and for some $\alpha>0$. Given that $a_0=1$ and $a_1=2$, compute the value of $\alpha$ for which $$\sum_{n=0}^{\infty}\frac{a_n}{2^n}=10$$

In the table shown in the figure, Zosia replaced eight numbers with their negatives. It turned out that each row and each column contained exactly two negative numbers. Prove that after this change, the sum of all sixteen numbers in the table is equal to $0$. [center] [img] https://wiki-images.artofproblemsolving.com//2/2e/17-3-5.png [/img] [/center]

As shown in figure , the inscribed circle of $ABC$ is intersects $BC$, $CA$, $AB$ at points $D$, $E$, $F$, repectively, and $P$ is a point inside the inscribed circle. The line segments $PA$, $PB$ and $PC$ intersect respectively the inscribed circle at points $X$, $Y$ and $Z$. Prove that the three lines $XD$, $YE$ and $ZF$ have a common point. [img]https://cdn.artofproblemsolving.com/attachments/e/9/bbfb0394b9db7aa5fb1e9a869134f0bca372c1.png[/img]

Let $S_n$ be the sum of the reciprocals of the non-zero digits of the integers from 1 to $10^n$ inclusive. Find the smallest positive integer $n$ for which $S_n$ is an integer.

For $0\leq t\leq 1$, define $f(t)=\int_0^{2\pi} |\sin x-t|dx.$ Evaluate $\int_0^1 f(t)dt.$

Define $\displaystyle{f(x) = x + \sqrt{x + \sqrt{x + \sqrt{x + \sqrt{x + \ldots}}}}}$. Find the smallest integer $x$ such that $f(x)\ge50\sqrt{x}$. (Edit: The official question asked for the "smallest integer"; the intended question was the "smallest positive integer".)

Can You fill the squares of the infinite cross-lined paper with integers so, that the sum of the numbers in every $4\times 6$ fields rectangle would be a) $10$? b) $1$?

Suppose that some real number $x$ satisfies \[\log_2 x + \log_8 x + \log_{64} x = \log_x 2 + \log_x 16 + \log_x 128.\] Given that the value of $\log_2 x + \log_x 2$ can be expressed as $\tfrac{a\sqrt{b}}{c}$, where $a$ and $c$ are coprime positive integers and $b$ is squarefree, compute $abc$.

The area of this figure is $ 100\text{ cm}^{2} $. Its perimeter is [asy] draw((0,2)--(2,2)--(2,1)--(3,1)--(3,0)--(1,0)--(1,1)--(0,1)--cycle,linewidth(1)); draw((1,2)--(1,1)--(2,1)--(2,0),dashed);[/asy] $ \text{(A)}\ \text{20 cm}\qquad\text{(B)}\ \text{25 cm}\qquad\text{(C)}\ \text{30 cm}\qquad\text{(D)}\ \text{40 cm}\qquad\text{(E)}\ \text{50 cm} $

Real number $C > 1$ is given. Sequence of positive real numbers $a_1, a_2, a_3, \ldots$, in which $a_1=1$ and $a_2=2$, satisfy the conditions \[a_{mn}=a_ma_n, \] \[a_{m+n} \leq C(a_m + a_n),\] for $m, n = 1, 2, 3, \ldots$. Prove that $a_n = n$ for $n=1, 2, 3, \ldots$.

$\frac{15^{30}}{45^{15}}=$ $ \textbf{(A)}\ \left(\frac{1}{3}\right)^{15} \qquad\textbf{(B)}\ \left(\frac{1}{3}\right)^2 \qquad\textbf{(C)}\ 1 \qquad\textbf{(D)}\ 3^{15} \qquad\textbf{(E)}\ 5^{15}$

Actually, this is an MO I participated in :) but it's really hard to get problems from this year if you don't know some people. P1. Let $f$ be a function satisfying $f(x + 1) + f(x - 1) = \sqrt{2} f(x)$, for all reals $x$. If $f(x - 1) = a$ and $f(x) = b$, determine the value of $f(x + 4)$. [hide=Remarks]We found out that this is the modified version of a problem from LMNAS UGM 2008, Senior High School Level, on its First Round. This is also the same with Arthur Engel's "Problem Solving Strategies" Book, Example Problem E2.[/hide] P2. The sequence of "Sanga" numbers is formed by the following procedure. i. Pick a positive integer $n$. ii. The first term of the sequence $(U_1)$ is $9n$. iii. For $k \geq 2$, $U_k = U_{k-1} - 17$. Sanga$[r]$ is the "Sanga" sequence whose smallest positive term is $r$. As an example, for $n = 3$, the "Sanga" sequence which is formed is $27, 10, -7, -24, -41, \ldots.$ Since the smallest positive term of such sequence is $10$, for $n = 3$, the sequence formed is called Sanga$[10]$. For $n \leq 100$, determine the sum of all $n$ which makes the sequence Sanga$[4]$. P3. The cube $ABCD.EFGH$ has an edge length of 6 cm. Point $R$ is on the extension of line (segment) $EH$ with $EH : ER = 1 : 2$, such that triangle $AFR$ cuts edge $GH$ at point $P$ and cuts edge $DH$ at $Q$. Determine the area of the region bounded by the quadrilateral $AFPQ$. [url=https://artofproblemsolving.com/community/q1h2395046p19649729]P4[/url]. Ten skydivers are planning to form a circle formation when they are in the air by holding hands with both adjacent skydivers. If each person has 2 choices for the colour of his/her uniform to be worn, that is, red or white, determine the number of different colour formations that can be constructed. P5. After pressing the start button, a game machine works according to the following procedure. i. It picks 7 numbers randomly from 1 to 9 (these numbers are integers, not stated but corrected) without showing it on screen. ii. It shows the product of the seven chosen numbes on screen. iii. It shows a calculator menu (it does not function as a calculator) on screen and asks the player whether the sum of the seven chosen numbers is odd or even. iv. Shows the seven chosen numbers and their sum and products. v. Releases a prize if the guess of the player was correct or shows the message "Try again" on screen if the guess by the player was incorrect. (Although the player is not allowed to guess with those numbers, and the machine's procedures are started all over again.) Kiki says that this game is really easy since the probability of winning is greater than $90$%. Explain, whether you agree with Kiki.

For a positive integer $n \ge 1,$ let $a_n=\lfloor \sqrt[3]{n}+\tfrac{1}{2}\rfloor.$ Given a positive integer $N \ge 1,$ let $\mathcal{F}_N$ denote the set of positive integers $n \ge 1$ such that $a_n \le N.$ Let $S_N = \sum_{n \in \mathcal{F}_N} \tfrac{1}{a_n^2}.$ As $N$ goes to infinity, the quantity $S_N - 3N$ tends to $\tfrac{a\pi^2}{b}$ for relatifvely prime positive integers $a,b.$ Given that $\sum_{k=1}^{\infty} \tfrac{1}{k^2} = \tfrac{\pi^2}{6},$ find $a+b.$

Determine all functions $f:(0,\infty)\to\mathbb{R}$ satisfying $$\left(x+\frac{1}{x}\right)f(y)=f(xy)+f\left(\frac{y}{x}\right)$$ for all $x,y>0$.