Problems about Pascal’s triangle itself: building rows, missing numbers, row sums, the numbers down a diagonal, powers of 11, 101 and 1001, counting routes, heads and tails, and (extension) neighbours in a given ratio · eight levels, timed, full worked solutions