On a line, there are 50 segments. Prove that either it is possible to find some 8 segments all of which have a shared intersection, or there can be found 8 segments, no two of which intersect.
In how many ways can you rearrange the numbers from 1 to 100 so that the neighbouring numbers differ by no more than 1?