Školjka

%V0 We take $100$ consecutive natural numbers $a_{1},$ $a_{2},$ $...,$ $a_{100}.$ Determine the last two digits of the number $a_{1}^{8}+a_{2}^{8}+...+a_{100}^{8}.$

%V0 Is it possible to choose a set of $100$ (or $200$) points on the boundary of a cube such that this set is fixed under each isometry of the cube into itself? Justify your answer.

%V0 The $n$ points $P_1,P_2, \ldots, P_n$ are placed inside or on the boundary of a disk of radius 1 in such a way that the minimum distance $D_n$ between any two of these points has its largest possible value $D_n.$ Calculate $D_n$ for $n = 2$ to 7. and justify your answer.

%V0 Given five real numbers $u_0, u_1, u_2, u_3, u_4$, prove that it is always possible to find five real numbers $v0, v_1, v_2, v_3, v_4$ that satisfy the following conditions: $(i)$ $u_i-v_i \in \mathbb N, \quad 0 \leq i \leq 4$ $(ii)$ $\sum_{0 \leq i<j \leq 4} (v_i - v_j)^2 < 4.$ Proposed by Netherlands.

%V0 Does there exist a set $M$ in usual Euclidean space such that for every plane $\lambda$ the intersection $M \cap \lambda$ is finite and nonempty ? Proposed by Hungary. RemarkI'm not sure I'm posting this in a right Forum.

%V0 Find the number of partitions of the set $\{1, 2, \cdots, n\}$ into three subsets $A_1,A_2,A_3$, some of which may be empty, such that the following conditions are satisfied: $(i)$ After the elements of every subset have been put in ascending order, every two consecutive elements of any subset have different parity. $(ii)$ If $A_1,A_2,A_3$ are all nonempty, then in exactly one of them the minimal number is even . Proposed by Poland.