Problems

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.\] Denote by \(t(n)\) is instead 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)\)?

There are \(16\) cities in the kingdom. Prove that it is not possible to build a system of roads in such a way that one can get from any city to any other without passing through more than one city on the way, and with at most four roads coming out of each city.

The marked angles are all \(45^{\circ}\). Show that the total green and blue areas are the same.

In a parallelogram \(ABCD\), point \(E\) belongs to the side \(AB\), point \(F\) belongs to the side \(CD\) and point \(G\) belongs to the side \(AD\). We know that the marked red segments \(AE\) and \(CF\) have equal lengths. Prove that the total grey area is equal to the total black area.

In every group of \(9\) randomly chosen crayons from Jamie’s drawer, some \(3\) will have the same colour. Show that if Jamie chooses \(25\) crayons at random, some \(7\) will have the same colour.

Suppose \(n \ge 2\) cricket teams play in a tournament. If no two teams play each other more than once, prove that some two teams have to play the same number of games.

A rectangular parallelepiped of the size \(m\times n\times k\) is divided into unit cubes. How many rectangular parallelepipeds are formed in total (including the original one)?

Each integer on the number line is coloured either white or black. The numbers \(2016\) and \(2017\) are coloured differently. Prove that there are three identically coloured integers which sum to zero.

Detective Nero Wolf investigates a crime. He’s got \(80\) people involved in the case, among whom one is a criminal and another is a witness to the crime (but it is not known who either of them are). Each day the detective may invite one or more of these \(80\) people, and if there is a witness among those invited, but not the perpetrator, the witness will report who the perpetrator is. Can the detective solve a case in \(12\) days?

In the picture below you can see the graphs of \(K_5\), the complete graph on \(5\) vertices, and \(K_{3,3}\), the complete bipartite graph on \(3\) and \(3\) vertices. A theorem states that these graphs cannot be embedded into plane, namely one cannot draw graphs \(K_5\) and \(K_{3,3}\) on a plane in such a way that there are no intersecting edges.
The question is: can you draw the graphs \(K_5\) and \(K_{3,3}\) without intersecting edges on a torus?