PROJECT EULER · #0148
Exploring Pascal's Triangle
We can easily verify that none of the entries in the first seven rows of Pascal's triangle are divisible by
However, if we check the first one hundred rows, we will find that only
Find the number of entries which are not divisible by
Write-up coming later
The complete problem is available here. An approach, code, and answer will be added later.