Files

gikf bfc21e4c40 fix(curriculum): clean-up Project Euler 141-160 (#42750 )

* fix: clean-up Project Euler 141-160

* fix: corrections from review

Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com>

* fix: corrections from review

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

* fix: use different notation for consistency

* Update curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.md

Co-authored-by: gikf <60067306+gikf@users.noreply.github.com>

Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com>
Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

2021-07-14 13:05:12 +02:00

1.0 KiB

Raw Blame History

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 ({10}^9) rows of Pascal's triangle.

--hints--

entriesOfPascalsTriangle() should return 2129970655314432.

assert.strictEqual(entriesOfPascalsTriangle(), 2129970655314432);

--seed--

--seed-contents--

function entriesOfPascalsTriangle() {

  return true;
}

entriesOfPascalsTriangle();

--solutions--

// solution required

1.0 KiB Raw Blame History