"30 shoes are arbitrary ordered in a row, 15 left and 15 right shoes. In this row there will always be 10 succeeding shoes such that 5 of theme are left shoes (and 5 of theme are right shoes. Prove this mathematically"
I suppose this is some kind of combinatorial problem, but I don't manage to prove it.
Let the shoes be numbered from 1 to 30 and let $f(n)$ be the number of left shoes in the set of the $n$-th to the $(n+9)$-th shoe for $1\leq n \leq 21$. $f$ has a minimum that is at most $5$ and a maximum that is at least $5$. Considering the fact that $|f(n+1)-f(n)| \leq 1$ for all $n$ will lead to a proof.
EDIT: Argument with minimum and maximum of $f$.