yaworsw/euler-manager

View on GitHub
data/problems/148.yml

Summary

Maintainability
Test Coverage
---
:id: 148
:name: Exploring Pascal's triangle
:url: https://projecteuler.net/problem=148
:content: |+
  We can easily verify that none of the entries in the first seven rows of Pascal's triangle are divisible by 7:

  |   |   |   |   |   |   |  1 |
  |   |   |   |   |   |  1 |   |  1 |
  |   |   |   |   |  1 |   |  2 |   |  1 |
  |   |   |   |  1 |   |  3 |   |  3 |   |  1 |
  |   |   |  1 |   |  4 |   |  6 |   |  4 |   |  1 |
  |   |  1 |   |  5 |   | 10 |   | 10 |   |  5 |   |  1 |
  | 1 |   |  6 |   | 15 |   | 20 |   | 15 |   |  6 |   |  1 |

  However, if we check the first one hundred rows, we will find that only 2361 of the 5050 entries are _not_ divisible by 7.

  Find the number of entries which are _not_ divisible by 7 in the first one billion (10<sup>9</sup>) rows of Pascal's triangle.