Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.md
Oliver Eyton-Williams ee1e8abd87 feat(curriculum): restore seed + solution to Chinese (#40683)
* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
2021-01-12 19:31:00 -07:00

997 B

id, title, challengeType, forumTopicId, dashedName
id title challengeType forumTopicId dashedName
5900f4021000cf542c50ff14 Problem 148: Exploring Pascal's triangle 5 301777 problem-148-exploring-pascals-triangle

--description--

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.

--instructions--

Find the number of entries which are not divisible by 7 in the first one billion (109) rows of Pascal's triangle.

--hints--

euler148() should return 2129970655314432.

assert.strictEqual(euler148(), 2129970655314432);

--seed--

--seed-contents--

function euler148() {

  return true;
}

euler148();

--solutions--

// solution required