Decide whether there exists a set $M$ of positive integers satisfying the following conditions: (i) For any natural number $m>1$ there exist $a, b \in M$ such that $a+b = m.$ (ii) If $a, b, c, d \in M$, $a, b, c, d > 10$ and $a + b = c + d$, then $a = c$ or $a = d.$

Twelve balls are numbered by the numbers $1,2,3,\cdots,12$. Each ball is colored either red or green, so that the following two conditions are satisfied: (i) If two balls marked by different numbers $a$ and $b$ are colored red and $a+b<13$, then the ball marked by the number $a+b$ is colored red, too. (ii) If two balls marked by different numbers $a$ and $b$ are colored green and $a+b<13$, then the ball marked by the number $a+b$ is also colored green. How many ways are there of coloring the balls? Please remember to hide your solution. (by using the hide tags of course.. I don't literally mean that you should hide it :ninja: )

Find the derivative of the solution of the equation $\ddot{x} = \dot{x}^2 + x^3$ with initial condition $x(0) = 0$, $\dot{x}(0) = A$ with respect to $A$ for $A = 0$.

How many multiples of $20$ are also divisors of $17!$?

Let $a_1, a_2, \ldots, a_n$ ($n\ge 3$) be positive integers such that $gcd(a_1, a_2, \ldots, a_n)=1$ and for each $i\in \lbrace 1,2,\ldots, n \rbrace$ we have $a_i|a_1+a_2+\ldots+a_n$. Prove that $a_1a_2\ldots a_n | (a_1+a_2+\ldots+a_n)^{n-2}$.

Let $a_1,a_2,\ldots,a_{2n}$ be positive real numbers such that $a_ja_{n+j}=1$ for the values $j=1,2,\ldots,n$. [list] a. Prove that either the average of the numbers $a_1,a_2,\ldots,a_n$ is at least 1 or the average of the numbers $a_{n+1},a_{n+2},\ldots,a_{2n}$ is at least 1. b. Assuming that $n\ge2$, prove that there exist two distinct numbers $j,k$ in the set $\{1,2,\ldots,2n\}$ such that \[|a_j-a_k|<\frac{1}{n-1}.\] [/list]

Let $F$ be the midpoint of circle arc $AB$, and let $M$ be a point on the arc such that $AM <MB$. The perpendicular drawn from point $F$ on $AM$ intersects $AM$ at point $T$. Show that $T$ bisects the broken line $AMB$, that is $AT =TM+MB$. KöMaL Gy. 2404. (March 1987), Archimedes of Syracuse

Given a segment $ AB $ and a line $ m $ parallel to this segment. Find the midpoint of the segment $ AB $ using only a ruler, i.e. drawing only straight lines.

Let $-2 < x_1 < 2$ be a real number and define $x_2, x_3, \ldots$ by $x_{n+1} = x_n^2-2$ for $n \geq 1$. Assume that no $x_n$ is $0$ and define a number $A$, $0 \leq A \leq 1$ in the following way: The $n^{\text{th}}$ digit after the decimal point in the binary representation of $A$ is a $0$ if $x_1x_2\cdots x_n$ is positive and $1$ otherwise. Prove that $A = \frac{1}{\pi}\cos^{-1}\left(\frac{x_1}{2}\right)$. [i]Evan O' Dorney.[/i]

Each of the numbers $1, 2, ... , 10$ is colored red or blue. $5$ is red and at least one number is blue. If $m, n$ are different colors and $m+n \le 10$, then $m+n$ is blue. If $m, n$ are different colors and $mn \le 10$, then $mn$ is red. Find all the colors.

$\overline{5654}_b$ is a power of a prime number. Find $b$ if $b > 6$.

Original post by shalomrav, but for some reason the mods locked the problem without any solves :noo: Let $ABCD$ be a cyclic quadrilateral inscribed in circle $\Omega$. Let $F_A$ be the (associated with $\Omega$) Feuerbach point of the triangle formed by the tangents to $\Omega$ at $B,C,D$, that is, the point of tangency of $\Omega$ and the nine-point circle of that triangle. Define $F_B, F_C, F_D$ similarly. Let $A'$ be the intersection of the tangents to $\Omega$ at $A$ and $F_A$. Define $B', C', D'$ similarly. Prove that quadrilaterals $ABCD$ and $A'B'C'D'$ are similar

Prove that for any convex quadrilateral it is always possible to cut out three smaller quadrilaterals similar to the original one with the scale factor equal to 1/2. (The angles of a smaller quadrilateral are equal to the corresponding original angles and the sides are twice smaller then the corresponding sides of the original quadrilateral.)

Cities $A$ and $B$ are $45$ miles apart. Alicia lives in $A$ and Beth lives in $B$. Alicia bikes towards $B$ at 18 miles per hour. Leaving at the same time, Beth bikes toward $A$ at 12 miles per hour. How many miles from City $A$ will they be when they meet? $\textbf{(A) }20\qquad\textbf{(B) }24\qquad\textbf{(C) }25\qquad\textbf{(D) }26\qquad\textbf{(E) }27$

Circles with centers $ A$ and $ B$ have radii 3 and 8, respectively. A common internal tangent intersects the circles at $ C$ and $ D$, respectively. Lines $ AB$ and $ CD$ intersect at $ E$, and $ AE \equal{} 5$. What is $ CD$? [asy]unitsize(2.5mm); defaultpen(fontsize(10pt)+linewidth(.8pt)); dotfactor=3; pair A=(0,0), Ep=(5,0), B=(5+40/3,0); pair M=midpoint(A--Ep); pair C=intersectionpoints(Circle(M,2.5),Circle(A,3))[1]; pair D=B+8*dir(180+degrees(C)); dot(A); dot(C); dot(B); dot(D); draw(C--D); draw(A--B); draw(Circle(A,3)); draw(Circle(B,8)); label("$A$",A,W); label("$B$",B,E); label("$C$",C,SE); label("$E$",Ep,SSE); label("$D$",D,NW);[/asy]$ \textbf{(A) } 13\qquad \textbf{(B) } \frac {44}{3}\qquad \textbf{(C) } \sqrt {221}\qquad \textbf{(D) } \sqrt {255}\qquad \textbf{(E) } \frac {55}{3}$

Call a sequence of positive integers $\{a_n\}$ good if for any distinct positive integers $m,n$, one has $$\gcd(m,n) \mid a_m^2 + a_n^2 \text{ and } \gcd(a_m,a_n) \mid m^2 + n^2.$$ Call a positive integer $a$ to be $k$-good if there exists a good sequence such that $a_k = a$. Does there exists a $k$ such that there are exactly $2019$ $k$-good positive integers?

Show that for any rational number $a$ the equation $y =\sqrt{x^2 +a}$ has infinitely many solutions in rational numbers $x$ and $y$.

Prove that the function $f : \mathbb{N}\longrightarrow \mathbb{Z}$ defined by $f(n) = n^{2007}-n!$, is injective.

Given two circles $\omega_1$ and $\omega_2$, with centers $O_1$ and $O_2$, respectively intesrecting at two points $A$ and $B$. Let $X$ and $Y$ be points on $\omega_1$. The lines $XA$ and $YA$ intersect $\omega_2$ again in $Z$ and $W$, respectively, such that $A$ is between $X,Z$ and $A$ is between $Y,W$. Let $M$ be the midpoint of $O_1O_2$, S be the midpoint of $XA$ and $T$ be the midpoint of $WA$. Prove that $MS = MT$ if, and only if, the points $X, Y, Z$ and $W$ are concyclic.

Let $n$ be a positive integer. Find the largest integer $N$ for which there exists a set of $n$ weights such that it is possible to determine the mass of all bodies with masses of $1, 2, ..., N$ using a balance scale . (i.e. to determine whether a body with unknown mass has a mass $1, 2, ..., N$, and which namely).

Let $ABCD$ be a parallelogram and let $P{}$ be a point inside it such that $\angle PDA= \angle PBA$. Let $\omega_1$ be the excircle of $PAB$ opposite to the vertex $A{}$. Let $\omega_2$ be the incircle of the triangle $PCD$. Prove that one of the common tangents of $\omega_1$ and $\omega_2$ is parallel to $AD$. [i]Ivan Frolov[/i]

On the square, $1,995$ soldiers lined up in a column, and some of them stood correctly, and some turned backwards. Sergeant Smith remembers only the command "as". With this command, each soldier who sees an even number of faces facing him turns $180^o$, while the rest remain stationary. All movements on command are performed simultaneously. Prove that the sergeant can orient all the soldiers in one direction.

Suppose that point $D$ lies on side $BC$ of triangle $ABC$ such that $AD$ bisects $\angle BAC,$ and let $\ell$ denote the line through $A$ perpendicular to $AD.$ If the distances from $B$ and $C$ to $\ell$ are $5$ and $6,$ respectively, compute $AD.$

Zeroes and ones are arranged in all the squares of $n\times n$ table. All the squares of the left column are filled by ones, and the sum of numbers in every figure of the form [asy]size(50); draw((2,1)--(0,1)--(0,2)--(2,2)--(2,0)--(1,0)--(1,2));[/asy] (consisting of a square and its neighbours from left and from below) is even. Prove that no two rows of the table are identical. [i]Proposed by O. Vanyushina[/i]

Let $ABC$ be a triangle with $BC=30$, $AC=50$, and $AB=60$. Circle $\omega_B$ is the circle passing through $A$ and $B$ tangent to $BC$ at $B$; $\omega_C$ is defined similarly. Suppose the tangent to $\odot(ABC)$ at $A$ intersects $\omega_B$ and $\omega_C$ for the second time at $X$ and $Y$ respectively. Compute $XY$. Let $T = TNYWR$. For some positive integer $k$, a circle is drawn tangent to the coordinate axes such that the lines $x + y = k^2, x + y = (k+1)^2, \dots, x+y = (k+T)^2$ all pass through it. What is the minimum possible value of $k$?