location:

25.
Let $a$, $b$, $c$ be non-negative numbers such that $a+b+c=1$. Prove that

$\frac{\mathrm{ab}}{c+1}+\frac{\mathrm{bc}}{a+1}+\frac{\mathrm{ca}}{b+1}\le \frac{1}{4} .$

When does equality hold?
Solution. It is straightforward to show that the inequality holds when one of the numbers is equal to zero. Equality holds if and only if the other two numbers are each equal to $1/2$. Henceforth, assume that all values are positive.
Since $a+b+c=1$, at least one of the numbers is less than $4/9$. Assume that $c<4/9$. Let $E$ denote the left side of the inequality. Then

$E=\mathrm{abc}\left(\frac{1}{a}+\frac{1}{b}+\frac{1}{c}-\frac{1}{a+1}-\frac{1}{b+1}-\frac{1}{c+1}\right) .$

Since

$\frac{1}{a+1}+\frac{1}{b+1}+\frac{1}{c+1}=\frac{1}{4}\left[\left(a+1\right)+\left(b+1\right)+\left(c+1\right)\right]\left[\frac{1}{a+1}+\frac{1}{b+1}+\frac{1}{c+1}\right]\ge \frac{9}{4} ,$

(by the Cauchy-Schwarz Inequality for example), we have that

$E\le \mathrm{abc}\left(\frac{1}{a}+\frac{1}{b}+\frac{1}{c}-\frac{9}{4}\right)=\mathrm{ab}+\mathrm{bc}+\mathrm{ca}-\frac{9}{4}\mathrm{abc} .$

On the other hand, $\left(1-c\right){}^{2}=\left(a+b\right){}^{2}\ge 4\mathrm{ab}$, whence $\mathrm{ab}\le \frac{1}{4}\left(1-c\right){}^{2} .$ Therefore

$\begin{array}{cc}E-\frac{1}{4}\hfill & \le \mathrm{ab}+c\left(a+b\right)-\frac{9}{4}\mathrm{abc}-\frac{1}{4}\hfill \\ \multicolumn{0}{c}{}& =\mathrm{ab}\left(1-\frac{9}{4}c\right)+c\left(1-c\right)-\frac{1}{4}\hfill \\ \multicolumn{0}{c}{}& \le \frac{1}{4}\left(1-c\right){}^{2}\left(1-\frac{9}{4}c\right)+c\left(1-c\right)-\frac{1}{4}\hfill \\ \multicolumn{0}{c}{}& =-\frac{1}{16}c\left(3c-1\right){}^{2}\le 0 .\hfill \end{array}$

Equality occurs everywhere if and only if $a=b=c=1/3$.

26.
Each of $m$ cards is labelled by one of the numbers $1,2,\dots ,m$. Prove that, if the sum of labels of any subset of cards is not a multiple of $m+1$, then each card is labelled by the same number.
Solution. Let ${a}_{k}$ be the label of the $k$th card, and let ${s}_{n}=\sum _{k=1}^{n}{a}_{k}$ for $n=1,2,\dots ,m$. Since the sum of the labels of any subset of cards is not a multiple of $m+1$, we get different remainders when we divide the ${s}_{n}$ by $m+1$. These remainders must be $1,2,\dots ,m$ in some order. Hence there is an index $i\in \left\{1,2,\dots ,m\right\}$ for which ${a}_{2}\equiv {s}_{i}$ (mod $m+1$). If $i$ were to exceed 1, then we would have a contradiction, since then ${s}_{i}-{a}_{2}$ would be a multiple of $m+1$. Therefore, ${a}_{2}\equiv {s}_{1}={a}_{1}$, so that ${a}_{2}\equiv {a}_{1}$ (mod $m+1$), whence ${a}_{2}={a}_{1}$. By cyclic rotation of the ${a}_{k}$, we can argue that all of the ${a}_{k}$ are equal.

27.
Find the least number of the form $‖{36}^{m}-{5}^{n}‖$ where $m$ and $n$ are positive integers.
Solution. Since the last digit of ${36}^{m}$ is 6 and the last digit of ${5}^{n}$ is 5, then the last digit of ${36}^{m}-{5}^{n}$ is 1 when ${36}^{m}>{5}^{n}$ and the last digit of ${5}^{n}-{36}^{m}$ is 9 when ${5}^{n}>{36}^{m}$. If ${36}^{m}-{5}^{n}=1$, then

${5}^{n}={36}^{m}-1=\left({6}^{m}+1\right)\left({6}^{m}-1\right)$

whence ${6}^{m}+1$ must be a power of 5, an impossibility. ${36}^{m}-{5}^{n}$ can be neither $-1$ nor 9. If ${5}^{n}-{36}^{m}=9$, then ${5}^{n}=9\left(4·{36}^{m-1}+1\right)$, which is impossible. For $m=1$ and $n=2$, we have that ${36}^{m}-{5}^{n}=36-25=11$, and this is the least number of the given form.

28.
Let $A$ be a finite set of real numbers which contains at least two elements and let $f:A\to A$ be a function such that $‖f\left(x\right)-f\left(y\right)‖<‖x-y‖$ for every $x,y\in A$, $x\ne y$. Prove that there is $a\in A$ for which $f\left(a\right)=a$. Does the result remain valid if $A$ is not a finite set?

Solution 1. Let $a\in A$, ${a}_{1}=f\left(a\right)$, and, for $n\ge 2$, ${a}_{n}=f\left({a}_{n-1}\right)$. Consider the sequence $\left\{{x}_{n}\right\}$ with

${x}_{n}=‖{a}_{n+1}-{a}_{n}‖$

where $n=1,2,\dots$. Since $A$ is a finite set and each ${a}_{n}$ belongs to $A$, there are only a finite number of distinct ${x}_{n}$. Let ${x}_{k}=\mathrm{min}{}_{n\ge 1}\left\{{x}_{n}\right\}$; we prove by contradiction that ${x}_{k}=0$.
Suppose if possible that ${x}_{k}>0$. Then

${x}_{k}=‖{a}_{k+1}-{a}_{k}‖>‖f\left({a}_{k+1}\right)-f\left({a}_{k}\right)‖=‖{a}_{k+2}-{a}_{k+1}‖={x}_{k+1} .$

But this does not agree with the selection of ${x}_{k}$. Hence, ${x}_{k}=0$, and this is equivalent to ${a}_{k+1}={a}_{k}$ or $f\left({a}_{k}\right)={a}_{k}$. The desired result follows.
Solution 2. We first prove that $f\left(A\right)\ne A$. Suppose, if possible, that $f\left(A\right)=A$. Let $M$ be the largest and $m$ be the smallest number in $A$. Since $f\left(A\right)=A$, there are elements ${a}_{1}$ and ${a}_{2}$ in $A$ for which $M=f\left({a}_{1}\right)$ and $m=f\left({a}_{2}\right)$. Hence

$M-m=‖f\left({a}_{1}\right)-f\left({a}_{2}\right)‖<‖{a}_{1}-{a}_{2}‖\le ‖M-m‖=M-m$

which is a contradiction. Therefore, $f\left(A\right)\subset A$.
Note that $A\supseteq f\left(A\right)\supseteq {f}^{2}\left(A\right)\supseteq \dots \supseteq {f}^{n}\left(A\right)\supseteq \dots$. In fact, we can extend the foregoing argument to show strict inclusion as long as the sets in question have more than one element:

$A\supset f\left(A\right)\supset {f}^{2}\left(A\right)\supset \dots \supset {f}^{n}\left(A\right)\supset \dots .$

(The superscripts indicate multiple composites of $f$.) Since $A$ is a finite set, there must be a positive integer $m$ for which ${f}^{m}\left(A\right)=\left\{a\right\}$, so that ${f}^{m+1}\left(A\right)={f}^{m}\left(A\right)$. Thus, $f\left(a\right)=a$.
Example. If $A$ is not finite, the result may fail. Indeed, we can take $A=\left(0,\frac{1}{2}\right)$ (the open interval of real numbers strictly between 0 and $\frac{1}{2}$) or $A=\left\{{2}^{-2n}:n=1,2,\dots \right\}$ and $f\left(x\right)={x}^{2}$.

29.
Let $A$ be a nonempty set of positive integers such that if $a\in A$, then $4a$ and $⌊\sqrt{a}⌋$ both belong to $A$. Prove that $A$ is the set of all positive integers.
Solution. (i) Let us first prove that $1\in A$. Let $a\in A$. Then we have

$⌊{a}^{1/2}⌋\in A , ⌊⌊{a}^{1/2}{⌋}^{1/2}⌋\in A , \dots ,⌊\dots ⌊{a}^{1/2}{⌋}^{1/2}{⌋}^{1/2}\dots ⌋\in A , \dots .$

Also, the following inequalities are true

$1\le ⌊{a}^{1/2}⌋\le {a}^{1/2} , 1\le ⌊⌊{a}^{1/2}{⌋}^{1/2}⌋\le {a}^{1/{2}^{2}} , \dots , 1\le ⌊\dots ⌊{a}^{1/2}{⌋}^{1/2}{⌋}^{1/2}\dots ⌋\le {a}^{1/{2}^{n}} ,$

where there are $n$ brackets in the general inequality. There is a sufficiently large positive integer $k$ for which ${a}^{1/{2}^{k}}\le 1.5$, and for this $k$, we have, with $k$ brackets,

$1\le ⌊\dots ⌊{a}^{1/2}{⌋}^{1/2}{⌋}^{1/2}\dots ⌋\le {a}^{1/{2}^{k}}\le 1.5 ,$

and thus

$⌊\dots ⌊⌊{a}^{1/2}{⌋}^{1/2}{⌋}^{1/2}\dots ⌋=1 ,$

(ii) We next prove that ${2}^{n}\in A$ for $n=1,2,\dots$. Indeed, since $1\in A$, we obtain that, for each positive integer $n$, ${2}^{2n}\in A$ so that ${2}^{n}=⌊\sqrt{{2}^{2n}}⌋\in A$.
(iii) We finally prove that an arbitrary positive integer $m$ is in $A$. It suffices to show that there is a positive integer $k$ for which ${m}^{{2}^{k}}\in A$. For each positive integer $k$, there is a positive integer ${p}_{k}$ such that ${2}^{{p}_{k}}\le {m}^{{2}^{k}}<{2}^{{p}_{k}+1}$ (we can take ${p}_{k}=⌊\mathrm{log}{}_{2}{m}^{{2}^{k}}⌋$). For $k$ sufficiently large, we have the inequality

$\left(1+\frac{1}{m}{\right)}^{{2}^{k}}\ge 1+\frac{1}{m}·{2}^{k}>4 .$

This combined with the foregoing inequality produces

${2}^{{p}_{k}}\le {m}^{{2}^{k}}<{2}^{{p}_{k}+1}<{2}^{{p}_{k}+2}<\left(m+1\right){}^{{2}^{k}} .\text{ }\left(*\right)$

Since ${2}^{2\left({p}_{k}+1\right)+1}\in A$, we have that

$⌊\sqrt{{2}^{2\left({p}_{k}+1\right)+1}}⌋=⌊{2}^{{p}_{k}+1}\sqrt{2}⌋\in A .$

Hence, with $k+1$ brackets,

$⌊\dots ⌊⌊{2}^{\left({p}_{k}+1\right)}\sqrt{2}{⌋}^{1/2}{⌋}^{1/2}\dots ⌋\in A .$

On the other hand, using $\left(*\right)$, we get

${m}^{{2}^{k}}<{2}^{{p}_{k}+1}\le ⌊{2}^{\left({p}_{k}+1\right)}\sqrt{2}⌋<\left(m+1\right){}^{{2}^{k}}$

and, then, with $k+1$ brackets,

$m\le ⌊\dots ⌊⌊{2}^{\left({p}_{k}+1\right)}\sqrt{2}{⌋}^{1/2}{⌋}^{1/2}\dots ⌋

Thus,

$m=⌊\dots ⌊⌊{2}^{\left({p}_{k}+1\right)}\sqrt{2}{⌋}^{1/2}{⌋}^{1/2}\dots ⌋\in A .$

30.
Find a point $M$ within a regular pentagon for which the sum of its distances to the vertices is minimum.
Solution. We solve this problem for the regular $n-$gon ${A}_{1}{A}_{2}\dots {A}_{n}$. Choose a system of coordinates centred at $O$ (the circumcentre) such that

${A}_{k}~\left(r\mathrm{cos}\frac{2k\pi }{n},r\mathrm{sin}\frac{2k\pi }{n}\right) , r={\mathrm{OA}}_{k}$

for $k=1,2,\dots ,n$. Then

$\sum _{k=1}^{n}{\mathrm{OA}}_{k}=\sum _{k=1}^{n}\left(r\mathrm{cos}\frac{2k\pi }{n},r\mathrm{sin}\frac{2k\pi }{n}\right)=\left(r\sum _{k=1}^{n}\mathrm{cos}\frac{2k\pi }{n},r\sum _{k=1}^{n}\mathrm{sin}\frac{2k\pi }{n}\right)=\left(0,0\right) .$

Indeed, letting $\zeta =\mathrm{cos}\frac{2\pi }{n}+i\mathrm{sin}\frac{2\pi }{n}$ and using DeMoivreß Theorem, we have that ${\zeta }^{n}=1$ and

$\begin{array}{cc}\sum _{k=1}^{n}\mathrm{cos}\frac{2k\pi }{n}+i\sum _{k=1}^{n}\mathrm{sin}\frac{2k\pi }{n}\hfill & =\sum _{k=1}^{n}\left(\mathrm{cos}\frac{2\pi }{n}+i\mathrm{sin}\frac{2\pi }{n}{\right)}^{k}\hfill \\ \multicolumn{0}{c}{}& =\sum _{k=1}^{n}{\zeta }^{k}=\zeta \left(\frac{1-{\zeta }^{n}}{1-\zeta }\right)=0 ,\hfill \end{array}$

whence $\sum _{k=1}^{n}\mathrm{cos}\left(2\pi k/n\right)=\sum _{k=1}^{n}\mathrm{sin}\left(2\pi k/n\right)=0$. On the other hand,

$\begin{array}{cc}\sum _{k=1}^{n}{\mathrm{MA}}_{k}\hfill & =\frac{1}{r}\sum _{k=1}^{n}{\mathrm{OA}}_{k}-\mathrm{OM}{\mathrm{OA}}_{k}\hfill \\ \multicolumn{0}{c}{}& \ge \frac{1}{r}\sum _{k=1}^{n}\left({\mathrm{OA}}_{k}-\mathrm{OM}\right)·{\mathrm{OA}}_{k}\hfill \\ \multicolumn{0}{c}{}& =\frac{1}{r}\left(\sum _{k=1}^{n}{\mathrm{OA}}_{k}{}^{2}-\mathrm{OM}\sum _{k=1}^{n}{\mathrm{OA}}_{k}\right)\hfill \\ \multicolumn{0}{c}{}& =\sum _{k=1}^{n}r=\sum _{k=1}^{n}{\mathrm{OA}}_{k} .\hfill \end{array}$

Equality occurs if and only if $M=O$, so that $O$ is the desired point.