Let $M(n)$ and $m(n)$ are maximal and minimal proper divisors of $n$ Natural number $n>1000$ is on the board. Every minute we replace our number with $n+M(n)-m(n)$. If we get prime, then process is stopped. Prove that after some moves we will get number, that is not divisible by $17$

We are given a positive integer $ r$ and a rectangular board $ ABCD$ with dimensions $ AB \equal{} 20, BC \equal{} 12$. The rectangle is divided into a grid of $ 20 \times 12$ unit squares. The following moves are permitted on the board: one can move from one square to another only if the distance between the centers of the two squares is $ \sqrt {r}$. The task is to find a sequence of moves leading from the square with $ A$ as a vertex to the square with $ B$ as a vertex. (a) Show that the task cannot be done if $ r$ is divisible by 2 or 3. (b) Prove that the task is possible when $ r \equal{} 73$. (c) Can the task be done when $ r \equal{} 97$?

Consider the following sequence : $a_1=1 ; a_n=\frac{a_[{\frac{n}{2}]}}{2}+\frac{a_[{\frac{n}{3}]}}{3}+\ldots+\frac{a_[{\frac{n}{n}]}}{n}$. Prove that $ a_{2n}< 2*a_{n } (\forall n\in\mathbb{N})$

Show that the equation, $2x^4+2x^2y^2+y^4=z^2$, does not have integer solution when $x \neq 0$.

Let $ABC$ be a triangle and $D$ be the midpoint of the segment $BC$. The circle that passes through $D$ and tangent to $AB$ at $B$, and the circle that passes through $D$ and tangent to $AC$ at $C$ intersect at $M\neq D$. Let $M'$ be the reflection of $M$ with respect to $BC$. Prove that $M'$ is on $AD$.

A line, which passes through the incentre $I$ of the triangle $ABC$, meets its sides $AB$ and $BC$ at the points $M$ and $N$ respectively. The triangle $BMN$ is acute. The points $K,L$ are chosen on the side $AC$ such that $\angle ILA=\angle IMB$ and $\angle KC=\angle INB$. Prove that $AM+KL+CN=AC$. [i]S. Berlov[/i]

Find the maximum number of pairwise disjoint sets of the form \[S_{a,b}=\{n^{2}+an+b \; \vert \; n \in \mathbb{Z}\},\] with $a,b \in \mathbb{Z}$.

The hexagon $ABCDEF$ is convex and opposite sides are parallel. Show that the triangles $ACE$ and $BDF$ have equal area

A triangle $ABC$ is given with $AC = BC = 5$. The altitude of this triangle drawn from vertex $A$ has length $4$. Calculate the length of the altitude of $ABC$ drawn from vertex $C$.

Let $n$ be a natural number. For all real numbers $x,y,z$, $(x^2+y^2+z^2)^2\geq n(x^4+y^4+z^4)$, then the minumum value of $n$ is________.

Let \(Q\) be a set of permutations of \(1,2,...,100\) such that for all \(1\leq a,b \leq 100\), \(a\) can be found to the left of \(b\) and adjacent to \(b\) in at most one permutation in \(Q\). Find the largest possible number of elements in \(Q\).

If the digit $1$ is placed after a two digit number whose tens' digit is $t$, and units' digit is $u$, the new number is: $\textbf{(A)}\ 10t+u+1 \qquad \textbf{(B)}\ 100t+10u+1 \qquad \textbf{(C)}\ 100t+10u+1\qquad \textbf{(D)}\ t+u+1 \qquad \textbf{(E)}\ \text{None of these answers}$

Find all pairs of prime natural numbers $(p, q)$ for which the value of the expression $\frac{p}{q}+\frac{p+1}{q+1}$ is an integer.

The Fahrenheit temperature ($F$) is related to the Celsius temperature ($C$) by $F = \tfrac{9}{5} \cdot C + 32$. What is the temperature in Fahrenheit degrees that is one-fifth as large if measured in Celsius degrees?

Let be the sequence of sets $ \left(\left\{ A\in\mathcal{M}_2\left(\mathbb{R} \right) | A^{n+1} =2007^nA\right\}\right)_{n\ge 1} . $ [b]a)[/b] Prove that each term of the above sequence hasn't a finite cardinal. [b]b)[/b] Determine the intersection of the fourth element of the above sequence with the $ 2007\text{th} $ element. [i]Gheorghe Iurea[/i] [hide=Note]Similar with [url]https://artofproblemsolving.com/community/c7h1928039p13233629[/url].[/hide]

In this infinite tree, degree of each vertex is equal to 3. A real number $ \lambda$ is given. We want to assign a real number to each node in such a way that for each node sum of numbers assigned to its neighbors is equal to $ \lambda$ times of the number assigned to this node. Find all $ \lambda$ for which this is possible.

What is the smallest positive integer $m$ such that $15! \, m$ can be expressed in more than one way as a product of $16$ distinct positive integers, up to order?

Consider the diagonals $A_1A_3, A_2A_4, A_3A_5, A_4A_6, A_5A_4$ and $A_6A_2$ of a convex hexagon $A_1A_2A_3A_4A_5A_6$. The hexagon whose vertices are the points of intersection of the diagonals is regular. Can we conclude that the hexagon $A_1A_2A_3A_4A_5A_6$ is also regular?

Alice and Bob play a game, in which they take turns drawing segments of length $1$ in the Euclidean plane. Alice begins, drawing the first segment, and from then on, each segment must start at the endpoint of the previous segment. It is not permitted to draw the segment lying over the preceding one. If the new segment shares at least one point - except for its starting point - with one of the previously drawn segments, one has lost. a) Show that both Alice and Bob could force the game to end, if they don’t care who wins. b) Is there a winning strategy for one of them?

Let $ABCD$ be a convex quadrilateral with $AD = BC$, $\angle BAC+\angle DCA = 180^{\circ}$, and $\angle BAC \neq 90^{\circ}.$ Let $O_1$ and $O_2$ be the circumcenters of triangles $ABC$ and $CAD$, respectively. Prove that one intersection point of the circumcircles of triangles $O_1BC$ and $O_2AD$ lies on $AC$.

Four congruent semicircular half-disks are arranged inside a circle with radius $4$ so that each semicircle is internally tangent to the circle, and the diameters of the semicircles form a $2\times 2$ square centered at the center of the circle as shown. The radius of each semicircular half-disk is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [img]https://cdn.artofproblemsolving.com/attachments/f/e/8c0b9fdd69f6b54d39708da94ef2b2d039cb1e.png[/img]

Let $a$ and $b$ be distinct real numbers. Prove that there exist integers $m$ and $n$ such that $am+bn<0$, $bm+an>0$.

MTRPia in $2044$ is highly advanced and a lot of the work is done by disc-shaped robots, each of radius $1$ unit. In order to not collide with each other, there robots have a smaller $360$-degree camera mounted on top, as shown in the figure (robot $r_1$ 'sees' robot $r_2$). Each of there cameras themselves are smaller discs of radius $c$. Suppose there are three robots $r_1, r_2, r_3$ placed 'consecutively' such that $r_2$ is roughly in the middle. The angle between the lines joining the centres of $r_1, r_2$ and $r_2, r_3$ is given to be $\theta$. The distance between the centres of $r_1,r_2 = $ distance between centres of $r_2,r_3 = d$. Show (with the aid of clear diagrams) that $r_1$ and $r_3$ can see each other iff $\sin{\theta} > \frac{1-c}{d}$. As a bonus, try to show that in a longer 'chain' of such robots (same $d$, $\theta$), if $\sin{\theta} > \frac{1-c}{d}$ then all robots can see each other.

Let $n$ be a positive integer, $k\in \mathbb{C}$ and $A\in \mathcal{M}_n(\mathbb{C})$ such that $\text{Tr } A\neq 0$ and $$\text{rank } A +\text{rank } ((\text{Tr } A) \cdot I_n - kA) =n.$$ Find $\text{rank } A$.

Let $x,y$, and $z$ be positive real numbers such that $xy+yz+zx=3xyz$. Prove that $$x^2y+y^2z+z^2x \geq 2(x+y+z)-3.$$ In which cases do we have equality?