The numbers \(a,b,c\) are positive. Show that: \[\frac{ab}{c} + \frac{bc}{a} + \frac{ac}{b} \ge a +b+c.\]
The number \(n\) is natural. Show that: \[\frac1{\sqrt{1}} +\frac1{\sqrt{2}}+ \frac1{\sqrt{3}} + \dots +\frac1{\sqrt{n}} < 3 \sqrt{n+1} -3.\]
If \(n\) is a positive integer, we denote by \(s(n)\) the sum of the divisors of \(n\). For example, the divisors of \(n=6\) are \(1,2,3,6\), so \(s(6)=1+2+3+6=12\). Prove that, for all \(n\geq1\), \[s(1)+s(2)+\cdots+s(n)\leq n^2.\] Furthermore, denote by \(t(n)\) the sum of the squares of the divisors of \(n\) (e.g., \(t(6)=1^2+2^2+3^2+6^2=50\)), can you find a similar inequality for \(t(n)\)?
Consider the following sum: \[\frac1{1 \times 2} + \frac1{2 \times 3} + \frac1{3 \times 4} + \dots\] Show that no matter how many terms it has, the sum will never be larger than \(1\).
For positive real numbers \(a,b,c\) prove the inequality: \[(a^2b + b^2c + c^2a)(ab^2 + bc^2 + ca^2)\geq 9a^2b^2c^2.\]
Suppose \(x,y\) are real numbers such that \(x < y + \varepsilon\) for every \(\varepsilon > 0\). Show that \(x \leq y\).
Let \(n\) be a positive integer. We denote by \(s(n)\) the sum of the divisors of \(n\). For example, the divisors of \(n=6\) are \(1\), \(2\), \(3\) and \(6\), so \(s(6)=1+2+3+6=12\). Prove that, for all \(n\ge1\), \[\sum_{k=1}^ns(k)=s(1)+s(2)+...+s(n)\le\frac{\pi^2}{12}n^2+\frac{n\log n}{2}+\frac{n}{2}.\]
Let \(a\), \(b\) and \(c\) be positive real numbers such that \(a+b+c=3\). Prove that \(a^a+b^b+c^c\ge3\).
Three clubs take part in a festival. Each club has at least one member.
During the festival, every member of one club shakes hands with every member of another club. In total (counting all three pairs of clubs), there were \(243\) handshakes between people from different clubs.
What is the smallest possible total number of participants?
Three positive numbers \(a,b,c\) satisfy \(ac-bc+ab=63\). What is the smallest value that \(a^2+b^2+c^2\) can be?