Two small, equal masses are attached by a lightweight rod. This object orbits a planet; the length of the rod is smaller than the radius of the orbit, but not negligible. The rod rotates about its axis in such a way that it remains vertical with respect to the planet. Is there a force in the rod? If so, tension or compression? Is the equlibrium stable, unstable, or neutral wrt small perturbations in the vertical angle of the rod? (A) There is no force in the rod; the equilibrium is neutral. (B) The rod is in tension; the equilibrium is stable. (C) The rod is in compression; the equilibrium is stable. (D) The rod is in tension; the equilibrium is unstable. (E) The rod is in compression; the equilibrium is unstable.

In $\triangle ABC$, $\angle A = 60^{\circ}$, $AB>AC$, $O$ is the circumcenter and $H$ is the intersection point of two heights $BE$ and $CF$. Points $M$ and $N$ lie on segments $BH$ and $HF$ respectively, and $BM=CN$. Find the value of $\frac{MH+NH}{OH}$.

In triangles ABC and DEF, DE = 4AB, EF = 4BC, and F D = 4CA. The area of DEF is 360 units more than the area of ABC. Compute the area of ABC.

Prove for all positive reals a,b,c,d: $ \frac{a\minus{}b}{b\plus{}c}\plus{}\frac{b\minus{}c}{c\plus{}d}\plus{}\frac{c\minus{}d}{d\plus{}a}\plus{}\frac{d\minus{}a}{a\plus{}b} \geq 0$

Prove that the number $\left\lfloor\left(5+\sqrt{35}\right)^{2n-1}\right\rfloor$ is divisible by $10^n$ for each $n\in\mathbb N$.

Let $n$ be the number that is produced by concatenating the numbers $1, 2,... , 4022$, that is, $n = 1234567891011...40214022$. a. Show that $n$ is divisible by $3$. b. Let $a_1 = n^{2011}$, and let $a_i$ be the sum of the digits of $a_{i-1}$ for $i > 1$. Find $a_4$

$n\ge2$ is a given positive integer. $i\leq a_i \leq n$ satisfies for all $1\leq i\leq n$, and $S_i$ is defined as $a_1+a_2+...+a_i(S_0=0)$. Show that there exists such $1\leq k\leq n$ that satisfies $a_k^2+S_{n-k}<2S_n-\frac{n(n+1)}{2}$.

Find all integer numbers $x$ and $y$ such that: \[(y^3+xy-1)(x^2+x-y)=(x^3-xy+1)(y^2+x-y).\] [i]Proposed by Mahyar Sefidgaran[/i]

A solid figure consisting of unit cubes is shown in the picture. Is it possible to exactly fill a cube with these figures if the side length of the cube is a) 15; b) 30?

Find all positive integers $n$ such that $n^{2}+2^{n}$ is square of an integer.

A cuboctahedron is the convex hull of (smallest convex set containing) the $12$ points $(\pm 1, \pm 1, 0), (\pm 1, 0, \pm 1), (0, \pm 1, \pm 1)$. Find the cosine of the solid angle of one of the triangular faces, as viewed from the origin. (Take a figure and consider the set of points on the unit sphere centered on the origin such that the ray from the origin through the point intersects the figure. The area of that set is the solid angle of the figure as viewed from the origin.)

Two players take turns writing down all proper non-decreasing fractions with denominators from $1 $ to $1999$ and at the same time writing a "$+$" sign before each fraction. After all such fractions are written out, their sum is found. If this amount is an integer number, then the one who made the entry last wins, otherwise his opponent wins. Who will be able to secure a win?

Determine if there exists a convex polyhedron such that (1) it has 12 edges, 6 faces and 8 vertices; (2) it has 4 faces with each pair of them sharing a common edge of the polyhedron.

In triangle $ABC$, let $A'$ is the symmetrical of $A$ with respect to the circumcenter $O$ of $ABC$. Prove that: [b]a)[/b] The sum of the squares of the tangents segments drawn from $A$ and $A'$ to the incircle of $ABC$ equals $$4R^2-4Rr-2r^2$$ where $R$ and $r$ are the radii of the circumscribed and inscribed circles of $ABC$ respectively. [b]b)[/b] The circle with center $A'$ and radius $A'I$ intersects the circumcircle of $ABC$ in a point $L$ such that $$AL=\sqrt{ AB.AC}$$ where $I$ is the centre of the inscribed circle of $ABC$.

In a triangle $ABC$, let $D$ and $E$ be the feet of the angle bisectors of angles $A$ and $B$, respectively. A rhombus is inscribed into the quadrilateral $AEDB$ (all vertices of the rhombus lie on different sides of $AEDB$). Let $\varphi$ be the non-obtuse angle of the rhombus. Prove that $\varphi \le \max \{ \angle BAC, \angle ABC \}$.

Evaluate the infinite product $$\prod_{n=2}^{\infty} \frac{n^3-1}{n^3+1}.$$

Let $k$ be an integer $\geq 3$. Sequence $\{a_n\}$ satisfies that $a_k = 2k$ and for all $n > k$, we have \[a_n = \begin{cases} a_{n-1}+1 & \text{if } (a_{n-1},n) = 1 \\ 2n & \text{if } (a_{n-1},n) > 1 \end{cases} \] Prove that there are infinitely many primes in the sequence $\{a_n - a_{n-1}\}$.

Prove that the polynomial \[ f(x) \equal{} \frac {x^n \plus{} x^m \minus{} 2}{x^{\gcd(m,n)} \minus{} 1}\] is irreducible over $ \mathbb{Q}$ for all integers $ n > m > 0$.

Let $A_1$ and $C_1$ be the feet of altitudes $AH$ and $CH$ of an acute-angled triangle $ABC$. Points $A_2$ and $C_2$ are the reflections of $A_1$ and $C_1$ about $AC$. Prove that the distance between the circumcenters of triangles $C_2HA_1$ and $C_1HA_2$ equals $AC$.

Let $a$, $n$ be positive integers such that $a^n$ is a perfect number. Prove that $$a^{\frac{n}{\mu}}> \frac{\mu}{2}$$ where $\mu$ denotes the number of distinct prime divisors of $a^n$

There is a closed polyline with $n$ edges on the plane. We build a new polyline which edges connect the midpoints of two adjacent edges of the previous polyline. Then we erase previous polyline and start over and over. Also we know that each polyline satisfy that all vertices are different and not all of them are collinear. For which $n$ we can get a polyline that is a сonvex polygon?

Two ants are moving along the edges of a convex polyhedron. The route of every ant ends in its starting point, so that one ant does not pass through the same point twice along its way. On every face $F$ of the polyhedron are written the number of edges of $F$ belonging to the route of the first ant and the number of edges of $F$ belonging to the route of the second ant. Is there a polyhedron and a pair of routes described as above, such that only one face contains a pair of distinct numbers? [i]Proposed by Nikolai Beluhov[/i]

Let $n\geq 3$ and $A_1,A_2,\ldots,A_n$ be points on a circle. Find the largest number of acute triangles that can be considered with vertices in these points. [i]G. Eckstein[/i]

A set of $n$ dominoes, each colored with one white square and one black square, is used to cover a $2 \times n$ board of squares. For $n = 6$, how many different patterns of colors can the board have? (For $n = 2$, this number is $6$.)

Let $n\geq 3$ be a positive integer. Consider an $n\times n$ square. In each cell of the square, one of the numbers from the set $M=\{1,2,\ldots,2n-1\}$ is to be written. One such filling is called [i]good[/i] if, for every index $1\leq i\leq n,$ row no. $i$ and column no. $i,$ together, contain all the elements of $M$. [list=a] [*]Prove that there exists $n\geq 3$ for which a good filling exists. [*]Prove that for $n=2017$ there is no good filling of the $n\times n$ square. [/list]