Per and Kari each have n pieces of paper. They both write down the numbers from 1 to 2n in an arbitrary order, one number on each side. Afterwards, they place the pieces of paper on a table showing one side. Prove that they can always place them so that all the numbers from 1 to 2n are visible at once. combinatoricscombinatorics solved