3. Six points A, B, C, D, E, F are connected with segments length of $1$. Each segment is painted red or black probability of $\frac{1}{2}$ independence. When point A to Point E exist through segments painted red, let $X$ be. Let $X=0$ be non-exist it. Then, for $n=0,2,4$, find the probability of $X=n$.

Given the natural number N, consider triples of different positive integers $(a, b, c)$ such that $a + b + c = N$. Take the largest possible system of these triples such that no two triples of the system have any common elements. Denote the number of triples of this system by $K(N)$. Prove that: (a) $K(N) >\frac{N}{6}-1$ (b) $K(N) <\frac{2N}{9}$ (L.D. Kurliandchik, Leningrad)

Let $ABC$ be a triangle and $\ell$ be a line parallel to $BC$ that passes through vertex $A$. Draw two circles congruent to the circle inscribed in triangle $ABC$ and tangent to line $\ell$, $AB$ and $BC$ (see picture). Lines $DE$ and $FG$ intersect at point $P$. Prove that $P$ lies on $BC$ if and only if $P$ is the midpoint of $BC$. (Mykhailo Plotnikov) [img]https://cdn.artofproblemsolving.com/attachments/8/b/2dacf9a6d94a490511a2dc06fbd36f79f25eec.png[/img]

a) Suppose that $ RBR'B'$ is a convex quadrilateral such that vertices $ R$ and $ R'$ have red color and vertices $ B$ and $ B'$ have blue color. We put $ k$ arbitrary points of colors blue and red in the quadrilateral such that no four of these $ k\plus{}4$ point (except probably $ RBR'B'$) lie one a circle. Prove that exactly one of the following cases occur? 1. There is a path from $ R$ to $ R'$ such that distance of every point on this path from one of red points is less than its distance from all blue points. 2. There is a path from $ B$ to $ B'$ such that distance of every point on this path from one of blue points is less than its distance from all red points. We call these two paths the blue path and the red path respectively. Let $ n$ be a natural number. Two people play the following game. At each step one player puts a point in quadrilateral satisfying the above conditions. First player only puts red point and second player only puts blue points. Game finishes when every player has put $ n$ points on the plane. First player's goal is to make a red path from $ R$ to $ R'$ and the second player's goal is to make a blue path from $ B$ to $ B'$. b) Prove that if $ RBR'B'$ is rectangle then for each $ n$ the second player wins. c) Try to specify the winner for other quadrilaterals.

Let the rest energy of a particle be $E$. Let the work done to increase the speed of this particle from rest to $v$ be $W$. If $ W = \frac {13}{40} E $, then $ v = kc $, where $ k $ is a constant. Find $10000k$ and round to the nearest whole number. [i](Proposed by Ahaan Rungta)[/i]

If $x=t^{(1/(t-1))}$ and $x=t^{(t/(t-1))}$, $t>0$, $t\not=1$, a relation between $x$ and $y$ is $\textbf{(A)}\ y^x=x^{1/y}\qquad \textbf{(B)}\ y^{1/x}=x^{y} \qquad \textbf{(C)}\ y^x=x^{y}\qquad \textbf{(D)}\ x^x=y^y\\ \textbf{(E)}\ \text{none of these}$

Let $p, q$ be positive integers and let $x_{0}=0$. Suppose $x_{n+1}=x_{n} + p + \sqrt{q^{2} + 4px_{n}}$. Find an explicit formula for $x_{n}$.

Let $a_1<a_2<a_3<\dots$ be positive integers such that $a_{k+1}$ divides $2(a_1+a_2+\dots+a_k)$ for every $k\geqslant 1$. Suppose that for infinitely many primes $p$, there exists $k$ such that $p$ divides $a_k$. Prove that for every positive integer $n$, there exists $k$ such that $n$ divides $a_k$.

We roll a regular 6-sided dice $n$ times. What is the probabilty that the total number of eyes rolled is a multiple of 5?

Let $a_1, a_2,..., a_n$ be positive integers and $a$ positive integer greater than $1$ which is a multiple of the product $a_1a_2...a_n$. Prove that $a^{n+1} + a - 1$ is not divisible by $(a + a_1 -1)(a + a_2 - 1) ... (a + a_n -1)$.

Compute $$\frac{2+3+\cdots+100}{1}+\frac{3+4+\cdots+100}{1+2}+\cdots+\frac{100}{1+2+\cdots+99}.$$

We consider the set of expressions that can be written with real numbers, $\pm$, $+$, $\times$, and parenthesis, such that if each $\pm$ is independently replaced with either $+$ or $-$, we are left with a valid arithmetic expression. For example, this includes: \[0\pm 1, 1 \pm 2, 1+2\times (1+2\pm 3), (1 \pm 2) \times (3 \pm 4).\] We define the [i]range[/i] of an expression of this form to be the set of all of the possible values when replacing each $\pm$ with either a $+$ or a $-$. For example, [list] [*] $1 \pm 2$ has range $\{-1,3\}$, since $1-2=-1$ and $1+2=3$. [*] $(1 \pm 1) \times (1 \pm 1)$ has range $\{0,4\}$, since $(1-1)(1-1)=(1-1)(1+1)=(1+1)(1-1)=0$ and $(1+1)(1+1)=4.$ [*] $(1 \pm 2)(3\pm 4)$ has range $\{-7,-3,1,21\}$, since $(1-2)(3+4)=-7$, $(1+2)(3-4)=-3$, $(1-2)(3-4)=1$, and $(1+2)(3+4)=21$. [/list] We will prove that every finite nonempty set of real numbers is the range of some expression of this form. Call a nonempty set of real numbers [i]good[/i] if it is the range of some expression of this form. (a) For each of the following sets, find an expression with a range equal to the given set. You do not need to justify the expression. [list=i] [*] $\{1\}$ [*] $\{1,3\}$ [*] $\{-1,0,1\}$ [/list] (b) Prove that if $S$ and $T$ are good sets, the product set $S \cdot T = \{ xy \mid x \in S, y \in T \}$ (the set of product of elements of $S$ with elements of $T$) is good. (c) Prove that if a set $S$ not containing $0$ is good, the set $S \cup \{ 0 \}$ (obtained upon adding $0$ to $S$) is good. (d) Prove that every finite nonempty set of real numbers is good.

Let $P(x, y)$ and $Q(x, y)$ be polynomials in two variables with integer coefficients. The sequences of integers $a_0, a_1,\ldots$ and $b_0, b_1,\ldots$ satisfy \[a_{n+1}=P(a_n,b_n),\quad b_{n+1}=Q(a_n,b_n)\]for all $n\geqslant 0$. Let $m_n$ be the number of integer points of the coordinate plane, lying strictly inside the segment with endpoints $(a_n,b_n)$ and $(a_{n+1},b_{n+1})$. Prove that the sequence $m_0,m_1,\ldots$ is non-decreasing.

A square with side length $x$ is inscribed in a right triangle with sides of length $3$, $4$, and $5$ so that one vertex of the square coincides with the right-angle vertex of the triangle. A square with side length $y$ is inscribed so that one side of the square lies on the hypotenuse of the triangle. What is $\frac{x}{y}$? $\textbf{(A)}\ \frac{12}{13}\qquad\textbf{(B)}\ \frac{35}{37}\qquad\textbf{(C)}\ 1\qquad\textbf{(D)}\ \frac{37}{35}\qquad\textbf{(E)}\ \frac{13}{12}$

Let $ E$ be a system of $ n^2 \plus{} 1$ closed intervals of the real line. Show that $ E$ has either a subsystem consisting of $ n \plus{} 1$ elements which are monotonically ordered with respect to inclusion or a subsystem consisting of $ n \plus{} 1$ elements none of which contains another element of the subsystem.

A $\text{0.3 kg}$ apple falls from rest through a height of $\text{40 cm}$ onto a flat surface. Upon impact, the apple comes to rest in $\text{0.1 s}$, and $\text{4 cm}^2$ of the apple comes into contact with the surface during the impact. What is the average pressure exerted on the apple during the impact? Ignore air resistance. (A) $\text{67,000 Pa}$ (B) $\text{21,000 Pa}$ (C) $\text{6,700 Pa}$ (D) $\text{210 Pa}$ (E) $\text{67 Pa}$

Let $a$ and $b$ be rational numbers such that $s=a+b=a^2+b^2$. Prove that $s$ can be written as a fraction where the denominator is relatively prime to $6$.

We are given an infinite cylinder in space (i.e. the locus of points of a given distance $R>0$ from a given straight line). Can six straight lines containing the edges of a tetrahedron all have exactly one common point with this cylinder? [i]Proposed by A. Kuznetsov[/i]

The perimeter of an isosceles trapezoid is $24$. If each of the legs is two times the length of the shorter base and is two-thirds the length of the longer base, what is the area of the trapezoid?

A sequence of integers $a_{1}, a_{2}, a_{3}, \cdots$ is defined as follows: $a_{1}=1$, and for $n \ge 1$, $a_{n+1}$ is the smallest integer greater than $a_{n}$ such that $a_{i}+a_{j} \neq 3a_{k}$ for any $i, j, $ and $k$ in $\{1, 2, 3, \cdots, n+1 \}$, not necessarily distinct. Determine $a_{1998}$.

On the side $ AB$ of a cyclic quadrilateral $ ABCD$ there is a point $ X$ such that diagonal $ BD$ bisects $ CX$ and diagonal $ AC$ bisects $ DX$. What is the minimum possible value of $ AB\over CD$? [i]Proposed by S. Berlov[/i]

(a) Prove that $x^4+3x^3+6x^2+9x+12$ cannot be expressed as product of two polynomials of degree 2 with integers coefficients. (b) $2n+1$ segments are marked on a line. Each of these segments intersects at least $n$ other segments. Prove that one of these segments intersects all other segments.

The diagram below shows the first three figures of a sequence of figures. The first figure shows an equilateral triangle $ABC$ with side length $1$. The leading edge of the triangle going in a clockwise direction around $A$ is labeled $\overline{AB}$ and is darkened in on the figure. The second figure shows the same equilateral triangle with a square with side length $1$ attached to the leading clockwise edge of the triangle. The third figure shows the same triangle and square with a regular pentagon with side length $1$ attached to the leading clockwise edge of the square. The fourth figure in the sequence will be formed by attaching a regular hexagon with side length $1$ to the leading clockwise edge of the pentagon. The hexagon will overlap the triangle. Continue this sequence through the eighth figure. After attaching the last regular figure (a regular decagon), its leading clockwise edge will form an angle of less than $180^\circ$ with the side $\overline{AC}$ of the equilateral triangle. The degree measure of that angle can be written in the form $\tfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [asy] size(250); defaultpen(linewidth(0.7)+fontsize(10)); pair x[],y[],z[]; x[0]=origin; x[1]=(5,0); x[2]=rotate(60,x[0])*x[1]; draw(x[0]--x[1]--x[2]--cycle); for(int i=0;i<=2;i=i+1) { y[i]=x[i]+(15,0); } y[3]=rotate(90,y[0])*y[2]; y[4]=rotate(-90,y[2])*y[0]; draw(y[0]--y[1]--y[2]--y[0]--y[3]--y[4]--y[2]); for(int i=0;i<=4;i=i+1) { z[i]=y[i]+(15,0); } z[5]=rotate(108,z[4])*z[2]; z[6]=rotate(108,z[5])*z[4]; z[7]=rotate(108,z[6])*z[5]; draw(z[0]--z[1]--z[2]--z[0]--z[3]--z[4]--z[2]--z[7]--z[6]--z[5]--z[4]); dot(x[2]^^y[2]^^z[2],linewidth(3)); draw(x[2]--x[0]^^y[2]--y[4]^^z[2]--z[7],linewidth(1)); label("A",(x[2].x,x[2].y-.3),S); label("B",origin,S); label("C",x[1],S);[/asy]

A differentiable function $f$ with $f(0) = f(1) = 0$ is defined on the interval $[0,1]$. Prove that there exists a point $y \in [0,1]$ such that $| f' (y)| = 4 \int _0^1 | f(x)|dx$.

A class has $25$ students. The teacher wants to stock $N$ candies, hold the Olympics and give away all $N$ candies for success in it (those who solve equally tasks should get equally, those who solve less get less, including, possibly, zero candies). At what smallest $N$ this will be possible, regardless of the number of tasks on Olympiad and the student successes?