Solve in positive integers the equation $$m^{\frac{1}{n}}+n^{\frac{1}{m}}=2+\frac{2}{mn(m+n)^{\frac{1}{m}+\frac{1}{n}}}.$$

The positive real numbers $a, b, c$ satisfy the equality $a + b + c = 1$. For every natural number $n$ find the minimal possible value of the expression $$E=\frac{a^{-n}+b}{1-a}+\frac{b^{-n}+c}{1-b}+\frac{c^{-n}+a}{1-c}$$

Trapezium $ABCD$ and parallelogram $MBDK$ are located so that the sides of the parallelogram are parallel to the diagonals of the trapezoid (see fig.). Prove that the area of the gray part is equal to the sum of the areas of the black part. (Yu. Blinkov) [img]https://cdn.artofproblemsolving.com/attachments/b/9/cfff83b1b85aea16b603995d4f3d327256b60b.png[/img]

They tell us that a married couple has $5$ children. Calculate the probability that among them there are at least two men and at least one woman. Probability of being born male is considered $1/2$.

There are $28$ students who have to be separated into two groups such that the number of students in each group is a multiple of $4$. The number of ways to split them into the groups can be written as $$\sum_{k \ge 0} 2^k a_k = a_0 +2a_1 +4a_2 +...$$ where each $a_i$ is either $0$ or $1$. Find the value of $$\sum_{k \ge 0} ka_k = 0+ a_1 +2a_2 +3a3_ +....$$

Let $n{}$ be a positive integer. What is the smallest sum of digits that $5^n + 6^n + 2022^n$ can take?

Given that x, y, and z are real numbers satisfying $x+y +z = 10$ and $x^2 +y^2 +z^2 = 50$, find the maximum possible value of $(x + 2y + 3z)^2 + (y + 2z + 3x)^2 + (z + 2x + 3y)^2$.

We have $98$ cards, in each one we will write one of the numbers: $1, 2, 3, 4,...., 97, 98$. We can order the $98$ cards, in a sequence such that two consecutive numbers $X$ and $Y$ and the number $X - Y$ is greater than $48$, determine how and how many ways we can make this sequence!!

The numbers $1,2,\ldots,49,50$ are written on the blackboard. Ann performs the following operation: she chooses three arbitrary numbers $a,b,c$ from the board, replaces them by their sum $a+b+c$ and writes $(a+b)(b+c)(c+a)$ to her notebook. Ann performs such operations until only two numbers remain on the board (in total 24 operations). Then she calculates the sum of all $24$ numbers written in the notebook. Let $A$ and $B$ be the maximum and the minimum possible sums that Ann san obtain. Find the value of $\frac{A}{B}$. [i](I. Voronovich)[/i]

Consider a function $f: \mathbb{R} \to \mathbb{R}$ satisfying for all $x \in \mathbb{R}$: \[ f(x+1) = \frac{1}{2} + \sqrt{f(x) - f(x)^2}. \] Prove that there exists a $b > 0$ such that $f(x + b) = f(x)$ for all $x \in \mathbb{R}$.

A [i]prime power[/i] is an integer of the form $p^k,$ where $p$ is a prime and $k$ is a nonnegative integer. How many prime powers are there less than or equal to $10^6?$ Your score will be $16-80|\frac{\textbf{Your Answer}}{\textbf{Actual Answer}}-1|$ rounded to the nearest integer or $0,$ whichever is higher.

For a positive integer $n$, let $f\left(n\right)$ be the sum of the first $n$ terms of the sequence $$0,1,1,2,2,3,3,4,4,\ldots,r,r,r+1,r+1,\ldots.$$ For example, $f\left(5\right)=0+1+1+2+2=6$. (a) Find a formula for $f\left(n\right)$. (b) Prove that $f\left(s+t\right)-f\left(s-t\right)=st$ for all positive integers $s$ and $t$, where $s>t$.

Find the smallest constant $C > 0$ for which the following statement holds: among any five positive real numbers $a_1,a_2,a_3,a_4,a_5$ (not necessarily distinct), one can always choose distinct subscripts $i,j,k,l$ such that \[ \left| \frac{a_i}{a_j} - \frac {a_k}{a_l} \right| \le C. \]

Let $a_0 = \frac{1}{2}$ and $a_n$ be defined inductively by \[a_n = \sqrt{\frac{1+a_{n-1}}{2}} \text{, $n \ge 1$.} \] [list=a] [*] Show that for $n = 0,1,2, \ldots,$ \[a_n = \cos(\theta_n) \text{ for some $0 < \theta_n < \frac{\pi}{2}$, }\] and determine $\theta_n$. [*] Using (a) or otherwise, calculate \[ \lim_{n \to \infty} 4^n (1 - a_n).\] [/list]

The circle $x^2+ y^2 = r^2$ meets the coordinate axis at $A = (r,0), B = (-r,0), C = (0,r)$ and $D = (0,-r).$ Let $P = (u,v)$ and $Q = (-u,v)$ be two points on the circumference of the circle. Let $N$ be the point of intersection of $PQ$ and the $y$-axis, and $M$ be the foot of the perpendicular drawn from $P$ to the $x$-axis. If $r^2$ is odd, $u = p^m > q^n = v,$ where $p$ and $q$ are prime numbers and $m$ and $n$ are natural numbers, show that \[ |AM| = 1, |BM| = 9, |DN| = 8, |PQ| = 8. \]

Let $p\geq5$ be a prime and $S_k=1^k+2^k+...+(p-1)^k,\forall k\in\mathbb{N}.$ Prove that there is an infinity of numbers $n\in\mathbb{N}$ such that $p^3$ divides $S_n$ and $ p $ divides $S_{n-1}$ and $S_{n-2}.$

Solve following system equations: \[\left\{ \begin{array}{c} 3x+4y=26\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \\ \sqrt{x^2+y^2-4x+2y+5}+\sqrt{x^2+y^2-20x-10y+125}=10\ \end{array} \right.\ \ \]

For some integer $m$, the polynomial $x^3-2011x+m$ has the three integer roots $a$, $b$, and $c$. Find $|a|+|b|+|c|$.

A subset $S$ of $\mathbb N$ is [i]eventually linear[/i] iff there are $k,N\in\mathbb N$ that for $n>N,n\in S\Longleftrightarrow k|n$. Let $S$ be a subset of $\mathbb N$ that is closed under addition. Prove that $S$ is eventually linear.

Let $m \ge 2$ and $n \ge 1$ be integers and $A=(a_{ij})$ a square matrix of order $n$ with integer entries. Prove that for any permutation $\sigma \in S_n$ there is a function $\varepsilon : \{1,2,\ldots,n\} \to \{0,1\}$ such that replacing the entries $a_{\sigma(1)1},$ $a_{\sigma(2)2}, $ $\ldots,$ $a_{\sigma(n)n}$ of $A$ respectively by $$a_{\sigma(1)1}+\varepsilon(1), ~a_{\sigma(2)2}+\varepsilon(2), ~\ldots, ~a_{\sigma(n)n}+\varepsilon(n),$$ the determinant of the matrix $A_{\varepsilon}$ thus obtained is not divisible by $m.$

Natural numbers $a$, $b$ are written in decimal using the same digits (i.e. every digit from 0 to 9 appears the same number of times in $a$ and in $b$). Prove that if $a+b=10^{1000}$ then both numbers $a$ and $b$ are divisible by $10$.

A rectangle $3 \times 5$ is divided into $15$ $1 \times 1$ cells. The middle $3$ cells that have no common points with the border of the rectangle are deleted. Is it possible to put in the remaining $12$ cells numbers $1, 2, \ldots, 12$ in some order, so that the sums of the numbers in the cells along each of the four sides of the rectangle are equal? [i]Proposed by Mariia Rozhkova[/i]

Given integer $n\geq 2$, two invisible [color=#eee]rabbits[/color] (rabbits) discussed their strategy and was sent to two points $A, B$ with distance $n$ units on a plane, respectively. However, they do not know whether they are on the same or different side of the plane (when facing each other, the might view the left/right direction as the same or different). They both can see points $A,B$, and they need to hop to each other's starting point. Each hop would measure $1$ unit in distance, and they would jump and land at the same time for each round. However, if at any time they landed no more than $1$ unit away, they'll both turn into deer. Find the minimum number of round they need to reach their destiny while ensuring they won't turn into deer. [i]Proposed by redshrimp[/i]

Let $a, b, c$ be pairwise coprime natural numbers. A positive integer $n$ is said to be [i]stubborn[/i] if it cannot be written in the form $n = bcx+cay+abz$, for some $x, y, z \in\mathbb{ N}.$ Determine the number of stubborn numbers.

A jacket and a shirt originally sold for $ \$80$ and $ \$40$, respectively. During a sale Chris bought the $ \$80$ jacket at a $40\%$ discount and the $ \$40$ shirt at a $55\%$ discount. The total amount saved was what percent of the total of the original prices? $\text{(A)}\ 45\% \qquad \text{(B)}\ 47\dfrac{1}{2}\% \qquad \text{(C)}\ 50\% \qquad \text{(D)}\ 79\dfrac{1}{6}\% \qquad \text{(E)}\ 95\%$.