Sum of every prime number below n

Created on Jan. 16, 2017 by Julien Palard

Write a function that prints Pascal's triangle.

Your function should be named print_pascal_triangle and accept a single argument, the height of the triangle.

Your triangle should be properly displayed as a triangle (use spaces) like:

1
2
3

  1
 1 1
1 2 1

or:

 1

1
2

>>> sum_primes(10)
17

Advice

You may copy/paste your is_prime function from a previous exercise ;)