freeCodeCamp/problem-148-exploring-pascals-triangle.english.md at 92377cf71af628cb5ea6b28ff7d6fa66a9b52449

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

1.2 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4021000cf542c50ff14	5	false	Problem 148: Exploring Pascal's triangle	301777

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⁹) rows of Pascal's triangle.

Tests

tests:
  - text: <code>euler148()</code> should return 2129970655314432.
    testString: assert.strictEqual(euler148(), 2129970655314432);

Challenge Seed

function euler148() {
  // Good luck!
  return true;
}

euler148();

Solution

// solution required

1.2 KiB Raw Blame History