Problem

Source: St Petersburg Olympiad 2014, Grade 10, P2

Tags: combinatorics



There are $40$ points on the two parallel lines. We divide it to pairs, such that line segments, that connects point in pair, do not intersect each other ( endpoint from one segment cannot lies on another segment). Prove, that number of ways to do it is less than $3^{39}$