To make the leaning tower of lire lean over the edge of the table by N brick lengths, the minimum number of bricks you need is supposedly round(e^(2*N-y)), where 'y' is Euler-Mascheroni constant. How do you prove this?