2013 is the first year since the Middle Ages that consists of four consecutive digits. How many such years are there still to come after 2013 (and before 10000)?

You have a 1 by 2024 grid of squares in a column, vertices labelled with coordinates $(0,0)$ to $(1,2024)$. Place a weed at $(0,0)$. When a weed is attempting to be placed at coordinates $(x,y)$, it will be placed with a $50\%$ probability if and only if exactly one of the vertices $(x-1, y)$ or $(x, y-1)$ has a weed on it, otherwise the attempt will fail with probability $1$. The placement attempts are made in the following order: For each vertex with $x$ coordinate $0$, attempt a placement for each vertex starting from $y$ coordinate $0$, incrementing by $1$ until $2024$. Then, attempts will be made on the vertices with $x$ coordinate $1$ in the same fashion. Each placement attempt is made exactly once. The probability that a weed appears on $(1,2024)$ after placing the weed at $(0,0)$ and attempting to place weeds on every vertex is $p$. Estimate $9p\cdot2^{2025}$ to the nearest integer. \\\\ Your score will be calculated by the function $\max(0, \lfloor\frac{2000\log_{10}A}{(A - S)^2+100\log_{10}A}\rfloor)$, where $S$ is your submission and $A$ is the true answer. [i]Lightning 5.2[/i]

a) Prove that the line dividing the triangle onto two polygons with equal perimeters and equal areas passes through the centre of the inscribed circle. b) Prove the same statement for the arbitrary tangential polygon. c) Prove that all the lines halving its perimeter and area simultaneously, intersect in one point.

Prove that for each $n\geq 3$ the equation: $x^n+y^n+z^n+u^n=v^{n-1}$ has infinitely many solutions in natural numbers.

Let $C_1$ and $C_2$ be two different circles , and let their radii be $r_1$ and $r_2$ , the two circles are passing through the two points $A$ and $B$ (i)Let $P_1$ on $C_1$ and $P_2$ on $C_2$ such that the line $P_1P_2$ passes through $A$. Prove that $P_1B \cdot r_2 = P_2B \cdot r_1$ (ii)Let $DEF$ be a triangle that it's inscribed in $C_1$ , and let $D'E'F'$ be a triangle that is inscribed in $C_2$ . The lines $EE'$,$DD'$ and $FF'$ all pass through $A$ . Prove that the triangles $DEF$ and $D'E'F'$ are similar (iii)The circle $C_3$ also passes through $A$ and $B$ . Let $l$ be a line that passes through $A$ and cuts circles $C_i$ in $M_i$ with $i = 1,2,3$ . Prove that the value of$$\frac{M_1M_2}{M_1M_3}$$is constant regardless of the position of $l$ Provided that $l$ is different from $AB$

The diagonals of a trapezoid $ ABCD$ intersect at point $ P$. Point $ Q$ lies between the parallel lines $ BC$ and $ AD$ such that $ \angle AQD \equal{} \angle CQB$, and line $ CD$ separates points $ P$ and $ Q$. Prove that $ \angle BQP \equal{} \angle DAQ$. [i]Author: Vyacheslav Yasinskiy, Ukraine[/i]

Show that it is possible to color the set of integers \[M=\{ 1, 2, 3, \cdots, 1987 \},\] using four colors, so that no arithmetic progression with $10$ terms has all its members the same color.

Let $n>1$ be a positive integer. Call a rearrangement $a_1,a_2, \cdots , a_n$ of $1,2, \cdots , n$ [i]nice[/i] if for every $k = 2 ,3, \cdots , n$, we have that $a_1^2 + a_2^2 + \cdots + a_k^2$ is [b]not[/b] divisible by $k$. Determine which positive integers $n>1$ have a [i]nice[/i] arrangement.

Consider the graph on $1000$ vertices $v_1, v_2, ...v_{1000}$ such that for all $1 \le i < j \le 1000$, $v_i$ is connected to $v_j$ if and only if $i$ divides $j$. Determine the minimum number of colors that must be used to color the vertices of this graph such that no two vertices sharing an edge are the same color.

Show that there are infinitely many positive integers n such that $2\underbrace{555...55}_{n}3$ is divisible by $2553$.

Let $\{a_{n}\}_{n \ge 1}$ be a sequence of positive numbers such that \[a_{n+1}^{2}= a_{n}+1, \;\; n \in \mathbb{N}.\] Show that the sequence contains an irrational number.

A spider built a web on the unit circle. The web is a planar graph with straight edges inside the circle, bounded by the circumference of the circle. Each vertex of the graph lying on the circle belongs to a unique edge, which goes perpendicularly inward to the circle. For each vertex of the graph inside the circle, the sum of the unit outgoing vectors along the edges of the graph is zero. Prove that the total length of the web is equal to the number of its vertices on the circle.

Find the real roots of the equation $x^2 + 2ax + \frac{1}{16} = -a +\sqrt{ a^2 + x - \frac{1}{16} }$ , $\left(0 < a < \frac14 \right)$ .

An ellipse with focus $F$ is given. Two perpendicular lines passing through $F$ meet the ellipse at four points. The tangents to the ellipse at these points form a quadrilateral circumscribed around the ellipse. Prove that this quadrilateral is inscribed into a conic with focus $F$

You have $8$ friends, each of whom lives at a different vertex of a cube. You want to chart a path along the cube’s edges that will visit each of your friends exactly once. You can start at any vertex, but you must end at the vertex you started at, and you cannot travel on any edge more than once. How many different paths can you take?

A number $n$ is [i]interesting[/i] if 2018 divides $d(n)$ (the number of positive divisors of $n$). Determine all positive integers $k$ such that there exists an infinite arithmetic progression with common difference $k$ whose terms are all interesting.

$2023$ balls are divided into several buckets such that no bucket contains more than $99$ balls. We can remove balls from any bucket or remove an entire bucket, as many times as we want. Prove that we can remove them in such a way that each of the remaining buckets will have an equal number of balls and the total number of remaining balls will be at least $100$.

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$.

Suppose that $a$ and $b$ are natural numbers such that \[p=\frac{b}{4}\sqrt{\frac{2a-b}{2a+b}}\] is a prime number. What is the maximum possible value of $p$?

What is the maximum number of subsets, having property that none of them is a subset of another, can a set with 10 elements have? $\textbf{(A)}\ 126 \qquad\textbf{(B)}\ 210 \qquad\textbf{(C)}\ 252 \qquad\textbf{(D)}\ 420 \qquad\textbf{(E)}\ 1024$

Let N be a positive integer greater than 2. We number the vertices of a regular 2n-gon clockwise with the numbers 1, 2, . . . ,N,−N,−N + 1, . . . ,−2,−1. Then we proceed to mark the vertices in the following way. In the first step we mark the vertex 1. If ni is the vertex marked in the i-th step, in the i+1-th step we mark the vertex that is |ni| vertices away from vertex ni, counting clockwise if ni is positive and counter-clockwise if ni is negative. This procedure is repeated till we reach a vertex that has already been marked. Let $f(N)$ be the number of non-marked vertices. (a) If $f(N) = 0$, prove that 2N + 1 is a prime number. (b) Compute $f(1997)$.

We call a square table of a binary, if at each cell is written a single number 0 or 1. The binary table is called regular if each row and each column exactly two units. Determine the number of regular size tables $n\times n$ ($n> 1$ - given a fixed positive integer). (We can assume that the rows and columns of the tables are numbered: the cases of coincidence in turn, reflect, and so considered different).

The function $ƒ$ is defined at $[0,1]$, and $f\{f(x)\} = ƒ(x)$. $\exists _{c\in [0,1]} \left[f(c) =\frac12 \right]$ Determine $f\left(\frac12 \right).$ $\forall _{t\in [0,1]}\exists _{s\in [0,1]}[f(s) = t]$. Determine $f$. Prove that the function $g$, with $g(x) = x$,$0 \le x \le k$, $g(x) = k$, $k \le x \le 1$ satisfies the relation $g\{g(x)\} = g(x)$.

Let $O$ be the center of a regular triangle $ABC$. From an arbitrary point $P$ of the plane, the perpendiculars were drawn on the sides of the triangle. Let $M$ denote the intersection point of the medians of the triangle , having vertices the feet of the perpendiculars. Prove that $M$ is the midpoint of the segment $PO$.

A line initially $ 1$ inch long grows according to the following law, where the first term is the initial length. \[ 1 \plus{} \frac {1}{4}\sqrt {2} \plus{} \frac {1}{4} \plus{} \frac {1}{16}\sqrt {2} \plus{} \frac {1}{16} \plus{} \frac {1}{64}\sqrt {2} \plus{} \frac {1}{64} \plus{} \cdots. \]If the growth process continues forever, the limit of the length of the line is: $ \textbf{(A)}\ \infty \qquad\textbf{(B)}\ \frac {4}{3} \qquad\textbf{(C)}\ \frac {8}{3} \qquad\textbf{(D)}\ \frac {1}{3}(4 \plus{} \sqrt {2}) \qquad\textbf{(E)}\ \frac {2}{3}(4 \plus{} \sqrt {2})$